par Roland, Jérémie 
;Cerf, Nicolas
Référence Physical review. A, Atomic, Molecular, and Optical Physics, 68, 6, 062312
Publication Publié, 2003
;Cerf, Nicolas Référence Physical review. A, Atomic, Molecular, and Optical Physics, 68, 6, 062312
Publication Publié, 2003
Article révisé par les pairs
| Résumé : | The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an unstructured search problem with a quadratic speedup over a classical search, just as Grover’s algorithm. In this paper, we study how the structure of the search problem may be exploited to further improve the efficiency of these quantum adiabatic algorithms. We show that by nesting a partial search over a reduced set of variables into a global search, it is possible to devise quantum adiabatic algorithms with a complexity that, although still exponential, grows with a reduced order in the problem size. © 2003 The American Physical Society. |
