Quantum search of spatial regions

Theory of Computing

Volumn 1, Issue , 2005, Pages 47-79

  Aaronson, Scott ^a   Ambainis, Andris ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Amplitude amplification; Disjointness; Grover search; Lower bounds; Quantum communication complexity; Quantum computing

Indexed keywords

GRAPH ALGORITHMS; QUANTUM COMPUTERS; THERMODYNAMICS;

DISJOINTNESS; GROVER SEARCH; LOWER BOUNDS; QUANTUM COMMUNICATION COMPLEXITY; QUANTUM COMPUTING;

QUANTUM COMMUNICATION;

EID: 84927700972     PISSN: None     EISSN: 15572862     Source Type: Journal    
DOI: 10.4086/toc.2005.v001a004     Document Type: Article

References (33)

1. D. AHARONOV, A. AMBAINIS, J. KEMPE, and U. VAZIRANI: Quantum walks on graphs. In Proc. ACM STOC, pp. 50-59, 2001. [STOC:380752.380758, arXiv:quant-ph/0012090]. 1.1, 1.2, 3
2. A. AMBAINIS: Quantum lower bounds by quantum arguments. J. Comput. Sys. Sci., 64:750-767, 2002. [JCSS:10.1006/jcss.2002.1826, STOC:335305.335394, arXiv:quant-ph/0002066]. 3
3. A. AMBAINIS, J. KEMPE, and A. RIVOSH: Coins make quantum walks faster. In Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA), 2005. To appear. [arXiv:quant-ph/0402107]. 1.2, 2, 8
4. R. BEALS, H. BUHRMAN, R. CLEVE, M. MOSCA, and R. DE WOLF: Quantum lower bounds by polynomials. J. ACM, 48(4):778-797, 2001. Earlier version in IEEE FOCS 1998. [JACM:502090.502097, FOCS:10.1109/SFCS.1998.743485, arXiv:quant-ph/9802049]. 1.1, 3, 4
5. J. D. BEKENSTEIN: A universal upper bound on the entropy to energy ratio for bounded systems. Phys. Rev. D, 23(2):287-298, 1981. [PRD:10.1103/PhysRevD.23.287]. 2
6. P. BENIOFF: Space searches with a quantum robot. In S. J. Lomonaco and H. E. Brandt, editors, Quantum Computation and Information, Contemporary Mathematics Series. AMS, 2002. [arXiv:quant-ph/0003006]. 1.2, 2
7. C. BENNETT, E. BERNSTEIN, G. BRASSARD, and U. VAZIRANI: Strengths and weaknesses of quantum computing. SIAM J. Comput., 26(5):1510-1523, 1997. [SICOMP:30093, arXiv:quant-ph/9701001]. 1.1, 3, 4
8. R. BOUSSO: Positive vacuum energy and the N-bound. J. High Energy Phys., 11(38), 2000. [arXiv:hep-th/0010252]. 2
9. R. BOUSSO: The holographic principle. Reviews of Modern Physics, 74(3), 2002. [arXiv:hep-th/0203101]. 1, 2
10. M. BOYER, G. BRASSARD, P. HØYER, and A. TAPP: Tight bounds on quantum searching. Fortschritte Der Physik, 46(4-5):493-505, 1998. [arXiv:quant-ph/9605034]. 5.4, 5.5
11. G. BRASSARD, P. HØYER, M. MOSCA, and A. TAPP: Quantum amplitude amplification and estimation. In S. J. Lomonaco and H. E. Brandt, editors, Quantum Computation and Information, Contemporary Mathematics Series. AMS, 2002. [arXiv:quant-ph/0005055]. 1.1, 5, 5.1, 5.1
12. H. BUHRMAN, R. CLEVE, and A. WIGDERSON: Quantum vs. classical communication and computation. In Proc. ACM STOC, pp. 63-68, 1998. [STOC:276698.276713, arXiv:quant-ph/9702040]. 7
13. A. M. CHILDS, R. CLEVE, E. DEOTTO, E. FARHI, S. GUTMANN, and D. A. SPIELMAN: Exponential algorithmic speedup by quantum walk. In Proc. ACM STOC, pp. 59-68, 2003. [STOC:780542.780552, arXiv:quant-ph/0209131]. 1.2
14. A. M. CHILDS, E. FARHI, and S. GUTMANN: An example of the difference between quantum and classical random walks. Quantum Information and Computation, 1(1-2):35-43, 2002. [arXiv:quant-ph/0103020]. 1.2
15. A. M. CHILDS and J. GOLDSTONE: Spatial search and the Dirac equation. Phys. Rev. A, 70(042312), 2004. [PRA:10.1103/PhysRevA.70.042312, arXiv:quant-ph/0405120]. 1.2, 2
16. A. M. CHILDS and J. GOLDSTONE: Spatial search by quantum walk. Phys. Rev. A, 70(022314), 2004. [PRA:10.1103/PhysRevA.70.022314, arXiv:quant-ph/0306054]. 1.2, 2, 1.2
17. L. K. GROVER: A fast quantum mechanical algorithm for database search. In Proc. ACM STOC, pp. 212-219, 1996. [STOC:237814.237866, arXiv:quant-ph/9605043]. 1, 3
18. L. K. GROVER: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett., 79(2):325-328, 1997
19. [PRL:10.1103/PhysRevLett.79.325, arXiv:quant-ph/9706033]. 1
20. L. K. GROVER: A framework for fast quantum mechanical algorithms. In Proc. ACM STOC, pp. 53-62, 1998. [STOC:276698.276712, arXiv:quant-ph/9711043]. 1.1, 5, 5.1
21. P. HØYER and R. DE WOLF: Improved quantum communication complexity bounds for disjointness and equality. In Proc. Intl. Symp. on Theoretical Aspects of Computer Science (STACS), pp. 299-310, 2002. [STACS:c22a2t8cewg784jh, arXiv:quant-ph/0109068]. 1.1, 7
22. S. LLOYD: Computational capacity of the universe. Phys. Rev. Lett., 88, 2002. [PRL:10.1103/PhysRevLett.88.237901, arXiv:quant-ph/0110141]. 3
23. M. NIELSEN and I. CHUANG: Quantum Computation and Quantum Information. Cambridge University Press, 2000. 3.1
24. A. A. RAZBOROV: Quantum communication complexity of symmetric predicates. Izvestiya Math. (English version), 67(1):145-159, 2003. [arXiv:quant-ph/0204025]. 1.1, 7
25. T. RUDOLPH and L. GROVER: Quantum searching a classical database (or how we learned to stop worrying and love the bomb). 2002. [arXiv:quant-ph/0206066]. 2
26. B. S. RYDEN: Introduction to Cosmology. Addison-Wesley, 2002. 3
27. S. PERLMUTTER and CH. ZALKA (SUPERNOVA COSMOLOGY PROJECT): Measurements of W and L from 42 high-redshift supernovae. Astrophysical Journal, 517(2):565-586, 1999. [arXiv:astro-ph/9812133]. 2, 3
28. A. SAHAI and S. VADHAN: A complete promise problem for statistical zero-knowledge. J. ACM, 50(2):196-249, 2003. Earlier version in IEEE FOCS 1997. [JACM:636865.636868, FOCS:10.1109/SFCS.1997.646133, ECCC:TR00-084]. 2
29. N. SHENVI, J. KEMPE, and K. B. WHALEY: A quantum random walk search algorithm. Phys. Rev. A, 67(5), 2003. [PRA:10.1103/PhysRevA.67.052307, arXiv:quant-ph/0210064]. 1.2
30. P. SHOR: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput., 26(5):1484-1509, 1997. Earlier version in IEEE FOCS 1994. [SICOMP:29317, FOCS:10.1109/SFCS.1994.365700, arXiv:quant-ph/9508027]. 1, 3
31. V. STRASSEN: Gaussian elimination is not optimal. Numerische Mathematik, 14(13):354-356, 1969. 1.2
32. J. WATROUS: On one-dimensional quantum cellular automata. In Proc. IEEE FOCS, pp. 528-537, 1995. [FOCS:10.1109/SFCS.1995.492583]. 1.1
33. CH. ZALKA: Could Grover’s algorithm help in searching an actual database? 1999. [arXiv:quant-ph/9901068]. 2