Trade-offs in the quantum search algorithm

Journal Article · Fri Nov 01 00:00:00 EST 2002 · Physical Review. A

DOI:https://doi.org/10.1103/PhysRevA.66.052314· OSTI ID:20632269

Grover, Lov K ^[1]

---

1. 1D435 Bell Laboratories, Lucent Technologies, 600-700 Mountain Avenue, Murray Hill, New Jersey 07974 (United States)

Quantum search has been proved to be the best possible algorithm for the exhaustive search problem in the sense that the number of queries it requires cannot be reduced. However, the number of nonquery operations, and thus the total number of operations, can be reduced. The number of nonquery unitary operations can be reduced by a factor of log N/{alpha} log(log N) while increasing the number of queries by a factor of only [1+(log N){sup -{alpha}}]. For example, by choosing {alpha} to be O(log N/log (log N)), the number of nonquery unitary operations can be reduced by 40% while increasing the number of queries by just two.

• OSTI ID: 20632269
• Journal Information: Physical Review. A, Vol. 66, Issue 5; Other Information: DOI: 10.1103/PhysRevA.66.052314; (c) 2002 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA); ISSN 1050-2947
• Country of Publication: United States
• Language: English

Related Subjects

74 ATOMIC AND MOLECULAR PHYSICS
ALGORITHMS
INFORMATION THEORY
QUANTUM MECHANICS
SORTING
UNITARITY