Quantum algorithms for the ordered search problem via semidefinite programming

  title={Quantum algorithms for the ordered search problem via semidefinite programming},
  author={Andrew M. Childs and A. Landahl and P. Parrilo},
  journal={Physical Review A},
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 ${\mathrm{log}}_{2}\phantom{\rule{0.2em}{0ex}}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… Expand
37 Citations

Figures and Tables from this paper

Optimal Quantum Adversary Lower Bounds for Ordered Search
  • 16
  • PDF
An efficient quantum search engine on unsorted database
  • PDF
Finding quantum algorithms via convex optimization
  • PDF
Quantum Communication-Query Tradeoffs
  • 1
  • PDF
Reconstructing Strings from Substrings with Quantum Queries
  • 7
  • PDF
Quantum Search in an Ordered List via Adaptive Learning
  • 13
  • Highly Influenced
  • PDF
Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
  • B. Reichardt
  • Mathematics, Physics
  • 2009 50th Annual IEEE Symposium on Foundations of Computer Science
  • 2009
  • 135
  • PDF
An adversary for algorithms
  • 16
  • PDF
Quantum search of partially ordered sets
  • A. Montanaro
  • Computer Science, Physics
  • Quantum Inf. Comput.
  • 2009
  • 1
  • PDF


Convex Optimization
  • 36,393
  • PDF
Sorting and Searching
  • 1,557
The Art of Computer Programming, Volume III: Sorting and Searching
  • D. Knuth
  • Computer Science, Mathematics
  • 1973
  • 2,574