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} }
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
36 Citations
Optimal Quantum Adversary Lower Bounds for Ordered Search
- Mathematics, Computer Science
- ICALP
- 2008
- 16
- PDF
A Formulation of a Matrix Sparsity Approach for the Quantum Ordered Search Algorithm
- Mathematics, Physics
- 2016
- PDF
Finding quantum algorithms via convex optimization
- Mathematics
- 2007 European Control Conference (ECC)
- 2007
- PDF
Reconstructing Strings from Substrings with Quantum Queries
- Computer Science, Mathematics
- SWAT
- 2012
- 7
- PDF
Quantum Search in an Ordered List via Adaptive Learning
- Physics, Mathematics
- 2007
- 13
- Highly Influenced
- PDF
Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
- Mathematics, Physics
- 2009 50th Annual IEEE Symposium on Foundations of Computer Science
- 2009
- 134
- PDF
References
SHOWING 1-6 OF 6 REFERENCES
The Art of Computer Programming, Volume III: Sorting and Searching
- Computer Science, Mathematics
- 1973
- 2,565