• DOI:10.1103/PhysRevA.75.032335
Corpus ID: 41539957

Quantum algorithms for the ordered search problem via semidefinite programming

@article{Childs2007QuantumAF,
  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},
  year={2007},
  volume={75},
  pages={032335}
}

Andrew M. Childs, A. Landahl, P. Parrilo

Published 2007

Physics

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… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed