Lower bound for quantum search of an ordered list

Information Processing Letters

Volumn 70, Issue 5, 1999, Pages 205-209

  Buhrman, Harry ^a   De Wolf, Ronald ^b  

^a CWI   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; SET THEORY; THEOREM PROVING;

QUANTUM SEARCH;

COMPUTATIONAL COMPLEXITY;

EID: 0033591580     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00069-1     Document Type: Article

References (17)

1. A. Ambainis, A Better Lower Bound for Quantum Algorithms Searching An Ordered List, Available at the LANL preprint archive, 14 February 1999 (quant-ph/9902053).
2. C.H. Bennett, E. Bernstein, G. Brassard, U. Vazirani, Strengths and weaknesses of quantum computing, SIAM J. Computing 26 (5) (1997) 1510-1523 (quant-ph/9701001).
3. A. Barenco, C.H. Bennett, R. Cleve, D.P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, H. Weinfurter, Elementary gates for quantum computation, Physical Review A 52 (1995) 3457-3467 (quant-ph/9503016).
4. R. Beals, H. Buhrman, R. Cleve, M. Mosca, R. De Wolf, Quantum lower bounds by polynomials, in: Proc. 39th FOCS, 1998, pp. 352-361 (quant-ph/9802049).
5. M. Boyer, G. Brassard, P. Høyer, A. Tapp, Tight bounds on quantum searching, Fortschritte Der Physik 46 (4-5) (1998) 493-505; Earlier version in: Physcomp'96 (quant-ph/ 9605034).
6. H. Buhrman, R. Cleve, A. Wigderson, Quantum vs. Classical communication and computation (preliminary version), in: Proc. 30th STOC, 1998, pp. 63-68 (quant-ph/9802040).
7. H. Buhrman, R. De Wolf, Lower Bounds for Quantum Search and Derandomization, 18 November 1998 (quant-ph/9811046).
8. R. Cleve, W. Van Dam, M. Nielsen, A. Tapp, Quantum entanglement and the communication complexity of the inner product function, in: Proc. 1st NASA QCQC Conference, Lecture Notes in Computer Sci., Vol. 1509, Springer, Berlin, 1998 (quant-ph/9708019).
9. C. Dürr, P. Høyer, A Quantum Algorithm for Finding the Minimum, 18 July 1996 (quant-ph/9607014).
10. E. Farhi, J. Goldstone, S. Gutmann, M. Sipser, A Limit on the Speed of Quantum Computation in Determining Parity, 16 February 1998 (quant-ph/9802045).
11. E. Farhi, J. Goldstone, S. Gutmann, M. Sipser, A Limit on the Speed of Quantum Computation for Insertion into An Ordered List, 18 December 1998 (quant-ph/9812057).
12. E. Farhi, J. Goldstone, S. Gutmann, M. Sipser, Invariant Quantum Algorithms for Insertion into an Ordered List, 19 January 1999 (quant-ph/9901059).
13. L.K. Grover, A fast quantum mechanical algorithm for database search, in: Proc. 28th STOC, 1996, pp. 212-219 (quant-ph/9605043).
14. L.K. Grover, How Fast Can A Quantum Computer Search?, 10 September 1998 (quant-ph/9809029).
15. D.E. Knuth, The Art of Computer Programming. Vol. 3: Sorting and Searching, Addison-Wesley, Reading, MA, 2nd ed., 1998.
16. W. Van Dam, Quantum oracle interrogation: Getting all information for almost half the price, in: Proc. 39th FOCS, 1998, pp. 362-367 (quant-ph/9805006).
17. Ch. Zalka, Grover's Quantum Searching Algorithm Is Optimal, 26 November 1997 (quant-ph/9711070).