- 23 September 2002
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 66 (3) , 032314
Abstract
We propose a quantum algorithm for solving combinatorial search problems that uses only a sequence of measurements. The algorithm is similar to quantum computation by adiabatic evolution, in that the goal is to remain in the ground state of a time-varying Hamiltonian. Indeed, we show that the running times of the two algorithms are closely related. We also show how to achieve the quadratic speedup for Grover’s unstructured search problem with only two measurements. Finally, we discuss some similarities and differences between the adiabatic and measurement algorithms.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Quantum search by local adiabatic evolutionPhysical Review A, 2002
- Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and EigenvectorsPhysical Review Letters, 1999
- Analog analogue of a digital quantum computationPhysical Review A, 1998
- Simulating quantum systems on a quantum computerProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
- Quantum algorithms revisitedProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
- Strengths and Weaknesses of Quantum ComputingSIAM Journal on Computing, 1997
- Quantum Mechanics Helps in Searching for a Needle in a HaystackPhysical Review Letters, 1997
- Universal Quantum SimulatorsScience, 1996
- Characteristic scales for dominated time evolutionPhysica Scripta, 1994
- Meaning of an individual "Feynman path"Physical Review D, 1980