Quantum complexities of ordered searching, sorting, and element distinctness

Algorithmica (New York)

Volumn 34, Issue 4, 2002, Pages 429-448

  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

Element distinctness; Lower bound; Quantum computation; Searching; Sorting

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBABILITY; SORTING; THEOREM PROVING; TREES (MATHEMATICS);

BINARY SEARCH TREE;

QUANTUM THEORY;

EID: 0042919330     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-002-0976-3     Document Type: Article

References (25)

1. A. Ambainis, A better lower bound for quantum algorithms searching an ordered list, Proc. of 40th Ann. IEEE Symp. on Foundations of Computer Science, 1999, pp. 352-357.
2. A. Ambainis, Quantum lower bounds by quantum arguments, Proc. of 32nd Ann. ACM Symp. on Theory of Computing, 2000, pp. 636-643.
3. A. Ambainis, Personal communication, July 2001.
4. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf, Quantum lower bounds by polynomials, Proc. of 39th Ann. IEEE Symp. on Foundations of Computer Science, 1998, pp. 352-361.
5. P. Beame, A general sequential time-space tradeoff for finding unique elements, SIAM J. Comput., 20 (1991), 270-277.
6. C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, Strengths and weaknesses of quantum computation, SIAM J. Comput., 26 (1997), 1510-1523.
7. A. Berthiaume, Quantum computation, in Complexity Theory Retrospective II (L. Hemaspaandra and A. L. Selman, eds.), Chapter 2, Springer-Verlag, New York, 1997, pp. 23-50.
8. A. Borodin, M. J. Fischer, D. G. Kirkpatrick, N. A. Lynch, and M. Tompa, A time-space tradeoff for sorting on nonoblivious machines, J. Comput. System Sci., 22 (1981), 351-364.
9. G. Brassard, P. Høyer, M. Mosca, and A. Tapp, Quantum amplitude amplification and estimation, in Quantum Computation and Quantum Information: A Millennium Volume (Samuel J. Lomonaco, Jr., ed.), Contemporary Mathematics, American Mathematical Society, Vol. 305, Providence, RI, to appear.
10. H. Buhrman, C. Dürr, M. Heiligman, P. Høyer, F. Magniez, M. Santha, and R. de Wolf, Quantum algorithms for finding claws, collisions and triangles, Proc. of 16th IEEE Conf. on Computational Complexity; 2001, pp. 131-137.
11. H. Buhrman and R. de Wolf, A lower bound for quantum search of an ordered list, Inform. Process. Lett., 70 (1999), 205-209.
12. M.-D. Choi, Tricks or treats with the Hubert matrix, Amer. Math. Monthly, 90 (1983), 301-312.
13. I. Daubechies, Orthonormal bases of compactly supported wavelets, Comm. Pure Appl. Math., XLI (1988), 909-996.
14. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, A limit on the speed of quantum computation for insertion into an ordered list, quant-ph/9812057, December 1998.
15. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, Invariant quantum algorithms for insertion into an ordered list, quant-ph/9901059, January 1999.
16. A. Fijany and C. P. Williams, Quantum wavelet transforms: fast algorithms and complete circuits. quant-ph/9809004, September 1998.
17. D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, A lower bound for randomized algebraic decision trees, Comput. Complexity, 6 (1996/1997), 357-375.
18. L. K. Grover, Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett., 79 (1997), 325-328.
19. A. Haar, Zur theorie der orthogonalen funktionensysteme (Erste mitteilung), Math. Ann., LXIX (1910), 331-371.
20. P. Høyer, Efficient quantum algorithms, quant-ph/9702028, February 1997.
21. R. Jozsa and J. Schlienz, Distinguishability of states and von Neumann entropy, Phys. Rev. A, 62 (2000), 012301/1-11.
22. H. Röhrig, Personal communication, 2000-2001.
23. P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput., 26 (1997), 1484-1509.
24. U. Vazirani, On the power of quantum computation, Philos. Trans. Roy: Soc. London Ser. A, 356 (1998), 1759-1768.
25. Ch. Zalka, Grover's quantum searching algorithm is optimal, Phys. Rev. A, 60 (1999), 2746-2751.