Rapid sampling though quantum computing

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 618-626

  Grover, Lov K ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIMENSIONAL VECTORS; MULTIPLE SOLUTIONS; NEW APPLICATIONS; QUANTUM COMPUTING; QUANTUM SEARCH; QUANTUM SUPERPOSITIONS; RAPID SAMPLING; SEARCH ALGORITHMS;

COMPUTATION THEORY; PROBABILITY DISTRIBUTIONS; QUANTUM COMPUTERS; QUANTUM THEORY; ALGORITHMS; VECTORS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY;

QUANTUM COMPUTING;

EID: 0033718005     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335389     Document Type: Conference Paper

References (13)

1. D. Applegate & S. Kannan, Sampling and integration of log-concave functions, Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC), 1991, 156-163.
2. E. Bernstein & U. Vazirani, Quantum complexity theory, Proc. 25th ACM Symposium on the Theory of Computation (STOC), 11-20.
3. D. Biron, O. Biham, E. Biham, M. Grassl & D. Lidar, Generalized Grover Search algorithm for arbitrary initial amplitude distribution, Proc. of the 1st NASA International Conference on Quantum Computing & Quantum Communications, 1998 (http://xxx.lanl.gov/abs/quant-ph/9801066).
4. M. Boyer, G. Brassard, P. Hoyer & A. Tapp, Tight bounds on quantum searching, Proc. PhysComp 1996 http://xxx.lanl.gov/abs/quant-ph/9605034.
5. G. Brassard, P. Hoyer & A. Tapp, Quantum counting, http://xxx.lanl.gov/abs/quant-ph/9805082.
6. H. Buhrman, R. Cleve, A. Wigderson, Quantum vs. Classical Communication and Computation, Proc. 30th ACM Symposium on Theory of Computing (STOC), 1998, 63-69.
7. H. Buhrman, R. Cleve, R. De Wolf, C. Zalka, Small error and zero error quantum algorithms, Proc. 40th Annual Symposium on Fundamentals of Computer Science (FOCS), 1999.
8. D. Deutsch & R. Jozsa, Rapid solution of problems by quantum computation, Proc. Royal Society of London, A400, 1992, 73-90.
9. L. K. Grover, A fast quantum mechanical algorithm for database search, Proc. 28th ACM Symposium on Theory of Computing (STOC), 1996, 212-218.
10. L. K. Grover, Quantum Mechanics helps in searching for a needle in a haystack, Phys. Rev. Letters, vol. 78(2), 1997, 325-328.
11. L. K. Grover, A framework for fast quantum mechanical algorithms, Proc. 30th ACM Symposium on Theory of Computing (STOC), 1998, 53-63.
12. L. K. Grover, Quantum search on structured problems, Chaos, Solitons & Fractals, vol. 10, no. 10, 1695-1705, 1999;
13. also available in Lecture Notes in Computer Science, Springer-Verlag 1509, 126-139, 1999, http://xxx.lanl.gov/abs/quant-ph/9802035.