Quantum search of spatial regions

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 200-209

  Aaronson, Scott ^a   Ambainis, Andris ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF LATVIA   (Latvia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; GRAPH THEORY; MATHEMATICAL MODELS; QUANTUM THEORY;

QUANTUM QUERY COMPLEXITY; QUANTUM SEARCH;

COMPUTATIONAL COMPLEXITY;

EID: 0344009617     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. D. Aharonov, A. Ambainis, J. Kemp, and U. Vazirani. Quantum walks on graphs, STOC'2001, pp. 50-59, 2001. quant-ph/0012090.
2. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. De Wolf. Quantum lower bounds by polynomials, FOCS'98, pp. 352-361, 1998. quant-ph/9802049.
3. J. D. Bekenstein. A universal upper bound on the entropy to energy ratio for bounded systems, Phys. Rev. D23:287, 1981.
4. P. Benioff. Space searches with a quantum robot, Quantum Computation & Information (S. J. Lomonaco and H. E. Brandt, eds.), 2002. quant-ph/003006.
5. C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani. Strengths and weaknessess of quantum computing, SIAM J. Comput. 26(5):1510-1523, 1997. quant-ph/9701001.
6. R. Bousso. Positive vacuum energy and the N-bound, J. High Energy Phys. 0011:038, 2000. hepth/0010252.
7. R. Bousso. The holographic principle, Rev. Mod. Phys. 74(3), 2002. hep-th/0203101.
8. M. Boyer, G. Brassard, P. Høyer, and A. Tapp. Tight bounds on quantum searching, Fortschritte Der Physik 46(4-5):493-505, 1998. quant-ph/9605034.
9. G. Brassard, P. Høyer, M. Mosca, and A. Tapp. Quantum amplitude amplification and estimation, Quantum Computation & Information (S. J. Lomonaco and H. E. Brandt, eds.), 2002. quant-ph/0005055.
10. H. Buhrman, R. Cleve, and A. Wigderson. Quantum vs. classical communication and computation, STOC'98, pp. 63-68, quant-ph/9702040.
11. A. M. Childs and J. Goldstone. Spatial search by quantum walk, submitted, 2003. quant-ph/0306054.
12. G. Gour. Extensive entropy bounds, Phys. Rev. D67, 2003. gr-qc/0212087.
13. L. K. Grover. A fast quantum mechanical algorithm for database search, STOC'96, pp. 212-219, 1996. quant-ph/9605043.
14. P. Høyer and R. de Wolf. Improved quantum communication complexity bounds for disjointness and equality, STACS'2002, LNCS 2285, pp. 299-310, 2002. quant-ph/0109068.
15. S. Lloyd. Computational capacity of the universe, Phys. Rev. Lett. 88 (237901), 2002. quant-ph/0110141.
16. S. Perlmutter and 32 others (Supernova Cosmology Project), Measurements of Ω and Λ from 42 high-redshift supernovae, Astrophysical Journal 517(2):565-586, 1999. astro-ph/9812133.
17. A. A. Razborov. Quantum communication complexity of symmetric predicates (Russian), Izvestiya Math. 6, 2002, English version at quant-ph/0204025.
18. T. Rudolph and L. Grover. Quantum searching a classical database (or how we learned to stop worrying and love the bomb), 2002. quant-gh/0206066.
19. N. Shenvi, J. Kempe, and K. B. Whaley. A quantum random walk search algorithm, Phys. Rev. A67 (052307), 2003. quant-ph/0210064.
20. P. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput. 26(5):1484-1509, 1997. quant-ph/9508027.
21. J. Watrous. On one-dimensional quantum cellular automata, FOCS'95, pp. 528-537, 1995.
22. Ch. Zalka. Could Grover's algorithm help in searching an actual database?, 1999. quant-ph/9901068.