An introduction to quantum computing for non-physicists

ACM Computing Surveys

Volumn 32, Issue 3, 2000, Pages 300-335

  Rieffel, Eleanor ^a   Polak, Wolfgang ^a  

^a FX PALO ALTO LABORATORY   (United States)

Author keywords

Complexity; Parallelism; Quantum computing

Indexed keywords

INTEGERS; QUANTUM COMPUTING; QUANTUM PARALLELISM;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); ERROR CORRECTION; POLYNOMIALS; PROBABILITY; SECURITY OF DATA;

QUANTUM CRYPTOGRAPHY;

EID: 0000313016     PISSN: 03600300     EISSN: None     Source Type: Journal    
DOI: 10.1145/367701.367709     Document Type: Article

References (54)

1. ABRAMS, D. S. AND LLOYD, S. 1998. Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #p problems. Los Alamos Physics Preprint Archive, http://xxx.lanl.gov/abs/quant-ph/9801041.
2. BARENCO, A., BENNETT, C. H., CLEVE, R., DIVINCENZO, D. P., MARGOLUS, N. H., SHOR, P. W., SLEATOR, T., SMOLIN, J. A., And WEINFURTER, H. 1995. Elementary gates for quantum computation. Physical Review A 52, 5, 3457-3467. Preprint at Los Alamos Physics Preprint Archive, http : // xxx.lanl.gov/abs/quant-ph/9503016 and at http://vesta.physics.ucla.edu/cgi-bin/ uncompress.ps- cgi?torgatsl.ps.
3. BENNETT, C. H. 1992. Quantum cryptography using any two nonorthogonal states. Physical Review Letters 68, 3121-3124.
4. BENNETT, C. H., BERNSTEIN, E., BRASSARD, G., And VAZIRANI, U. V. 1997. Strengths and weaknesses of quantum computing. Society for Industrial and Applied Mathematics Journal on Computing 26, 5, 1510-1523. Preprint at Los Alamos Physics Preprint Archive, http://xxx.lanl.gov/abs/quant-ph/9701001.
5. BENNETT, C. H. AND BRASSARD, G. 1987. Quantum public key distribution reinvented. SIGACT News (ACM Special Interest Group on Automata and Computability Theory) 18, 51-53.
6. BENNETT, C. H., BRASSARD, G., And EKERT, A. K. 1992. Quantum cryptography. Scientific American 267, 4 (Oct.), 50.
7. BERNSTEIN, E. AND VAZIRANI, U. V. 1997. Quantum complexity theory. Society for Industrial and Applied Mathematics Journal on Computing 26, 5, 1411-1473. A preliminary version of this paper appeared in the Proceedings of the 25th Association for Computing Machinery Symposium on the Theory of Computing.
8. BERTHIAUME. 1997. Quantum computation. In ALAN L. SELMAN, ED., Complexity Theory Retrospective, In Honor of Juris Hartmanis on the Occasion of His Sixtieth Birthday, (July 5,1988), Vol. 2, 23-51.
9. BIRON, D., BIHAM, O., BIHAM, E., GRASSEL, M., And LiDAR, D. A. 1998. Generalized grover search algorithm for arbitrary initial amplitude distribution. Los Alamos Physics Preprint Archive, http://xxx.lanl.gov/abs/quant-ph/9801066.
10. BOSCHI, D., BRANCA, S., MARTINI, F. D., HARDY, L., And POPESCU, S. 1998. Experimental realization of teleporting an unknown pure quantum state via dual classical and einstein-podolski-rosen channels. Physical Review Letters 80,1121-1125.
11. BOUWMEESTER, D., PAN, J.-W., MATTLE, K., ElBL, M., WEINFURTER, H., And ZEILINGER, A. 1997. Experimental quantum teleportation. Nature 390, 575.
12. BOYER, M., BRASSARD, G., HOYER, P., And TAPP, A. 1996. Tight bounds on quantum search. In Proceedings of the Workshop on Physics of Computation: PhysComp '96 (Los Alamitos, CA, 1996), 36-43. Institute of Electrical and Electronic Engineers Computer Society Press. Preprint at Los Alamos Physics Preprint Archive, http://xxx.lanl.gov/abs/quant-ph/9605034.
13. BRASSARD, G., HOYER, P., And TAPP, A. 1998. Quantum counting. Preprint at Los Alamos Physics Preprint Archive, http://xxx.lanl.gov/abs/quant-ph/9805082.
14. CERF, N. J., GROVER, L. K, AND WILLIAMS, C. P. 1998. Nested quantum search and np-complete problems. Preprint at Los Alamos Physics Preprint Archive, http://xxx.lanl.gov/abs/quant-ph/9806078.
15. CIRAC, J. I. AND ZOLLER, P. 1995. Quantum computations with cold trapped ions. Physical Review Letters 74, 4091-4094.
16. CORY, D. G., MASS, W., PRICE, M., KNILL, E., LAFLAMME, R., ZUREK, W. H., HAVEL, T. R, AND SOMAROO, S. S. 1998. Experimental quantum error correction. Preprint at Los Alamos Physics Preprint Archive, http://xxx.lanl.gov/abs/quant-ph/9802018.
17. DEUTSCH, D. 1985. Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London Series A A400, 97-117.
18. DEUTSCH, D. AND JOZSA, R. 1992. Rapid solution of problems by quantum computation. Proceedings of the Royal Society of London Series A A439, 553-558.
19. DIRAC, P. 1958. The Principles of Quantum Mechanics (4th ed.). Oxford University Press.
20. EKERT, A. K., RARITY, J., TAPSTER, P., And PALMA, G. 1992. Practical quantum cryptography based on two-photon interferometry. Physical Review Letters 69, 1293-1295.
21. FEYNMAN, R. 1982. Simulating physics with computers. International Journal of Theoretical Physics 21, 6&7, 467-488.
22. FEYNMAN, R. 1985. Quantum mechanical computers. Optics News 11, 11-20. Also in Foundations of Physics, 16(6), 507-531, 1986.
23. FEYNMAN, R. 1996. In Feynman Lectures on Computation. A. J. HEY AND R. W. ALLEN EDS., Addison- Wesley.
24. FEYNMAN, R. P., LEIGHTON, R. B., And SANDS, M. 1965. Lectures on Physics, Vol. III. Addison- Wesley.
25. GERSHENFELD, N. A. AND CHUANG, I. L. 1997. Bulk spin resonance quantum computing. Science 275, 350-356.
26. GREENSTELV, G. AND ZAJONC, A. G. 1997. The Quantum Challenge. Jones and Bartlett Publishers, Sudbury, Mass.
27. GROVER, L. K. 1996. A fast quantum mechanical algorithm for database search. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (Philadelphia, Pennsylvania, 22-24 May 1996), pp. 212-219.
28. GROVER, L. K. 1998. A framework for fast quantum mechanical algorithms. Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, 53-62. Preprint at Los Alamos Physics Preprint Archive, http://xxx.lanl.gov/abs/quant-ph/9711043.
29. HARDY, G. H. AND WRIGHT, E. M. 1979. An Introduction to the Theory of Numbers. Oxford University Press.
30. HOGG, T. 1996. Quantum computing and phase transitions in combinatorial search. Journal of Artificial Intelligence Research 4, 91-128. Preprint at Los Alamos Physics Preprint Archive, http : //xxx. lanl. gov/abs/quant-ph/9508012.
31. HOGG, T. 1998. Highly structured searches with quantum computers. Physical Review Letters 80, 2473-2473.
32. HUGHES, R. J., BUTTLER, W. T., KWIAT, P. G., LAMOREAUX, S. K., MORGAN, G. L., NORDHOLT, J. E., And PETERSON, C. G. 1999. Practical Quantum Cryptography for Secure Free-Space Communications. Preprint at Los Alamos Physics Preprint Archive, http://xxx.lanl.gov/abs/quant-ph/9905009.
33. HUGHES, R. J., BUTTLER, W. T., KWIAT, P. G., LUTHER, G. G., MORGAN, G. L., NORDHOLT, J. E., PETERSON, C. G., And SIMMONS, C. M. 1997. Secure communications using quantum cryptography. In S. P. HOTALING AND A. R. PlRICH EDS., Photonic Quantum Computing, Vol. 3076, 2-11.
34. HUNGERFORD, T. A. 1974. Algebra. Springer Verlag, New York, Heidelberg, Berlin.
35. JONES, J. A. AND MOSCA, M. 1998. Implementation of a quantum algorithm on a nuclear magnetic resonance quantum computer. Journal of Chemical Physics 109, 5, 1648-1653. Preprint at Los Alamos Physics Preprint Archive, http://xxx.lanl.gov/abs/quant-ph/9801027.
36. LAFLAMME, R., KNILL, E., ZUREK, W., CATASTI, P., And MARIAPPAN, S. 1997. NMR GHZ. Los Alamos Physics Preprint Archive, http://xxx.lanl.gov/abs/quant-ph/9709025.
37. LENSTRA, A. AND LENSTRA, H. EDS. 1993. The Development of the Number Field Sieve, Vol. 1554 of Lecture Notes in Mathematics. Springer Verlag.
38. LIBOFF, R. L. 1997. Introductory Quantum Mechanics (3rd ed.). Addison-Wesley, Reading, Mass.
39. LO, H.-K. AND CHAU, H. F. 1999. Unconditional security of quantum key distribution over arbitrarily long distances. Science 283, 2050-2056.
40. MAYERS, D. 1998. Unconditional Security in Quantum Cryptography. Preprint at Los Alamos Physics Preprint Archive, http://xxx.lanl.gov/abs/quant-ph/9802025.
41. NIELSEN, M. A., KNILL, E., And LAFLAMME, R. 1998. Complete Quantum Teleportation using Nuclear Magnetic Resonance. Preprint at Los Alamos Physics Preprint Archive, http://xxx.lanl.gov/abs/quant-ph/9811020.
42. SCHULMAN, L. J. AND VAZIRANI, U. 1998. Scalable NMR Quantum Computation. Los Alamos Physics Preprint Archive, http://xxx.lanl.gov/abs/quant-ph/9804060.
43. SHOR, P. W. 1994. Algorithms for quantum computation: Discrete log and factoring. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science (Nov.), 124-134. Institute of Electrical and Electronic Engineers Computer Society Press, ftp://netlib.att.com/netlib/att/math/shor/quantum.algorithms.ps.Z.
44. SHOR, P. W. 1997. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. Society for Industrial and Applied Mathematics Journal on Computing 26, 5, 1484-1509. Expanded version of Shor [1994].
45. SIMON, D. R. 1997. On the power of quantum computation. Society for Industrial and Applied Mathematics Journal on Computing 26, 5, 1474-1483. A preliminary version of this paper ap-pcared in the Proceedings of the 35th Annual Symposium on Foundations of Computer Science.
46. STEANE, A. 1996. The Ion Trap Quantum Information Processor. Los Alamos Physics Preprint Archive, http://xxx.lanl.gov/abs/quant-ph/9608011.
47. STEANE, A. 1998. Quantum computing. Reports on Progress in Physics 61, 2, 117-173. Preprint at Los Alamos Physics Preprint Archive, http : // xxx.lanl.gov/abs/quant-ph/9708022.
48. TERHAL, B. M. AND SMOLIN, J. A. 1997. Single Quantum Querying of a Database. Los Alamos Physics Preprint Archive, http://xxx.lanl.gov/abs/quant-ph/9705041.
49. VANDERSYPEN, L. M. K., YANNONI, C. Y., SHERWOOD, M. H., And CHUANG, I. L. 1999. Realization of Effective Pure States for Bulk Quantum Computation. Preprint at Los Alamos Physics Preprint Archive, http://xxx.lanl.gov/abs/quant-ph/9905041.
50. VEDRAL, V., BARENCO, A., And EKERT, A. K 1996. Quantum Networks for Elementary Arithmetic Operations. Physical Review A. Preprint at Los Alamos Physics Preprint Archive, http : //xxx.lanl.gov/abs/quant-ph/9511018.
51. WATROUS, J. 1998. Relationships between quantum and classical space-bounded complexity classes. In 13th Annual IEEE Conference on Computational Complexity (June 1998), 210-227.
52. WILLIAMS, C. P. AND CLEARWATER, S. H. 1998. Explorations in Quantum Computing. Telos, Springer-Verlag.
53. WOOTTERS, W. K AND ZUREK, W. H. 1982. A single quantum cannot be cloned. Nature 299, 802.
54. ZALKA, C. 1997. Grover's Quantum Searching Algorithm is Optimal. Los Alamos Physics Preprint Archive, http://xxx.lanl.gov/abs/quant-ph/9711070.