Quantum algorithms for the ordered search problem via semidefinite programming
- Institute for Quantum Information, California Institute of Technology, Pasadena, California 91125 (United States)
- Center for Advanced Studies, Department of Physics and Astronomy, University of New Mexico, Albuquerque, New Mexico 87131 (United States)
- Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 (United States)
One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log{sub 2} N queries to the list, a quantum computer can solve the problem using a constant factor fewer queries. However, the precise value of this constant is unknown. By characterizing a class of quantum query algorithms for the ordered search problem in terms of a semidefinite program, we find quantum algorithms for small instances of the ordered search problem. Extending these algorithms to arbitrarily large instances using recursion, we show that there is an exact quantum ordered search algorithm using 4 log{sub 605} N{approx_equal}0.433 log{sub 2} N queries, which improves upon the previously best known exact algorithm.
- OSTI ID:
- 20982281
- Journal Information:
- Physical Review. A, Vol. 75, Issue 3; Other Information: DOI: 10.1103/PhysRevA.75.032335; (c) 2007 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA); ISSN 1050-2947
- Country of Publication:
- United States
- Language:
- English
Similar Records
Quantum Interior Point Methods for Semidefinite Optimization
Complexity issues in solving III-behaved semidefinite programs