Quantum complexities of ordered searching, sorting, and element distinctness

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2076 LNCS, Issue , 2001, Pages 346-357

  Høyer, Peter ^a   Neerbek, Jan ^b   Shi, Yaoyun ^c  

^a UNIVERSITY OF CALGARY   (Canada)

^b AARHUS UNIVERSITY   (Denmark)

^c Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; INFORMATION DISSEMINATION; QUANTUM THEORY; TREES (MATHEMATICS); BINARY TREES; BINS; COMPUTATIONAL LINGUISTICS;

BINARY SEARCH TREES; INNER PRODUCT; LOWER BOUNDS; ORACLE ACCESS; QUANTUM ALGORITHMS; QUANTUM COMPLEXITY;

BINARY TREES; TREES (MATHEMATICS);

EID: 84879540958     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_29     Document Type: Conference Paper

References (18)

1. Ambainis, A. : A better lower bound for quantum algorithms searching an ordered list. Proc. of 40th IEEE FOCS (1999) 352-357
2. Ambainis, A. : Quantum lower bounds by quantum arguments. Proc. of 32nd ACM STOC (2000) 636-643
3. Beals, R. , Buhrman, H. , Cleve, R. , Mosca, M. , de Wolf, R. : Quantum lower bounds by polynomials. Proc. of 39th IEEE FOCS (1998) 352-361
4. Beame, P. : A general sequential time-space tradeoff for finding unique elements. SIAM J. Comput. 20 (1991) 270-277
5. Bennett, C. H. , Bernstein, E. , Brassard, G. , Vazirani, U. : Strengths and weaknesses of quantum computation. SIAM J. Comput. 26 (1997) 1510-1523
6. Borodin, A. , Fischer, M. J. , Kirkpatrick, D. G. , Lynch, NA. , Tompa, M. : A time-space tradeoff for sorting on nonoblivious machines. J. Comput. Sys. Sci. 22 (1981) 351-364
7. Brassard, G. , Høyer, P. , Mosca, M. , Tapp, A. : Quantum amplitude amplification and estimation. quant-ph/0005055, 2000
8. Buhrman, H. , Dürr, C. , Heiligman, M. , Høyer, P. , Magniez, F. , Santha, M. , de Wolf, R. : Quantum algorithms for element distinctness. Proc. of 16th IEEE Computational Complexity (2001) (to appear)
9. Buhrman, H. , de Wolf, R. : A lower bound for quantum search of an ordered list. Inform. Proc. Lett. 70 (1999) 205-209
10. Choi, M.-D. : Tricks or treats with the Hilbert matrix. Amer. Math. Monthly 90 (1983) 301-312
11. Farhi, E. , Goldstone, J. , Gutmann, S. , Sipser, M. : A limit on the speed of quantum computation for insertion into an ordered list. quant-ph/9812057, 1998
12. Farhi, E. , Goldstone, J. , Gutmann, S. , Sipser, M. : Invariant quantum algorithms for insertion into an ordered list. quant-ph/9901059, 1999
13. Grigoriev, D. , Karpinski, M. , Meyer auf der Heide, F. , Smolensky, R. : A lower bound for randomized algebraic decision trees. Comput. Complexity 6 (1996/1997) 357-375
14. Grover, L. K. : Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Letters 79 (1997) 325-328
15. Jozsa, R. , Schlienz, J. : Distinguishability of states and von Neumann entropy. Phys. Rev. A 62 (2000) 012301
16. Shor, P. W. : Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26 (1997) 1484-1509
17. Vedral, V. : The role of relative entropy in quantum information theory. quant-ph/0102094, 2001
18. Zalka, Ch. : Grover's quantum searching algorithm is optimal. Phys. Rev. A 60 (1999) 2746-2751