next up previous
Next: About this document ... Up: No Title Previous: No Title

References

1
D. S. Abrams and S. Lloyd.
Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors.
Physical Review Letters, 83(24):5162-5165, December 1999.

2
A. Barenco, C. H. Bennett, R. Cleve, et al.
Elementary gates for quantum computation.
Technical Memorandum BL011216-950414-05TM, AT&T Bell Labs, Murray Hill, NJ, 1995.

3
J. S. Bell.
On the Einstein Podolsky Rosen paradox.
Physics, 1:195-200, 1964.

4
P. Benioff.
Quantum mechanical hamiltonian models of computers.
Annals of the New York Academy of Sciences, 480:475-486, 1986.

5
C. H. Bennett.
Quantum information and computation.
Physics Today, 48:24-30, October 1995.

6
C. H. Bennett and G. Brassard.
The dawn of a new era for quantum cryptography: The experimental prototype is working!
SIGACT News, 20:78-82, 1989.

7
C. H. Bennett, G. Brassard, C. Crépeau, et al.
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels.
Physical Review Letters, 70(13):1895-1899, March 1993.

8
C. H. Bennett, G. Brassard, and A. K. Ekert.
Quantum cryptography.
Scientific American, pages 50-57, October 1992.

9
C. H. Bennett and S. J. Weisner.
Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states.
Physical Review Letters, 69(20):2881-2884, 1992.

10
D. Deutsch and R. Jozsa.
Rapid solution of problems by quantum computation.
Proceedings Royal Society London, 439A:553-558, 1992.

11
D. P. DiVincenzo.
Two-bit gates are universal for quantum computation.
Physical Review A, 51:1015-1022, 1995.

12
A. Einstein, B. Podolsky, and N. Rosen.
Can quantum-mechanical description of physical reality be considered complete?
Physical Review, 47:777-780, 1935.

13
R. P. Feynman.
There's plenty of room at the bottom.
Engineering and Science, 23:22-36, 1960.

14
R. P. Feynman.
Simulating physics with computers.
International Journal of Theoretical Physics, 21(6/7):467-488, 1982.

15
R. P. Feynman.
Quantum mechanical computers.
Foundations of Physics, 16(6):507-531, 1986.

16
L. K. Grover.
Rapid sampling through quantum computing.
Technical Memorandum 10009585-991021-57TM, Lucent Technologies/Bell Labs, Murray Hill, NJ, 1999.

17
T. Hogg, C. Mochon, W. Polak, and E. Rieffel.
Tools for quantum algorithms.
International Journal of Modern Physics, C10:1347-1362, 1999.
http://xxx.lanl.gov/abs/quant-ph/9811073 .

18
H.-K. Lo, S. Popescu, and T. Spiller, editors.
Introduction to Quantum Computation and Information.
World Scientific Publishing, 1998.

19
P. M. Platzman and M. I. Dykman.
Quantum computing with electrons floating on liquid helium.
Science, 284(18):1967-1969, June 1999.

20
E. G. Rieffel and W. Polak.
An introduction to quantum computing for non-physicists.
http://~xxx.lanl.gov/abs/quant-ph/9809016 , 1998.

21
P. W. Shor.
Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer.
Technical Memorandum BL011216-950724-10TM, AT&T Bell Labs, Murray Hill, NJ, 1995.

22
A. Steane.
Quantum computing.
Reports on Progress in Physics, 61:117-173, 1998.
http://xxx.lanl.gov/abs/quant-ph/9708022 .



Lorenz Huelsbergen
1/14/2000