Bibliography

1

Abrams D S and Lloyd S, Non-Linear Quantum Mechanics implies Polynomial Time solution for NP-complete and $\char93$P problems, http://xxx.lanl.gov/abs/quant-ph/9801041

2

Aharonov D, Beckman D, Chuang I and Nielsen M, What Makes Quantum Computers Powerful? http://wwwcas.phys.unm.edu/~mnielsen/science.html

3

Aharonov, D., Quantum Computation, Annual Reviews of Computational Physics VI, Edited by Dietrich Stauffer, World Scientific, 1998

4

Barenco A A universal two-bit gate for quantum computation, Proc. R. Soc. Lond. A 449 679-683, 1995

5

Barenco A, Deutsch D, Ekert E and Jozsa R, Conditional quantum dynamics and quantum gates, Phys. Rev. Lett. 74 4083-4086, 1995

6

Barenco A, Bennett C H, Cleve R, DiVincenzo D P, Margolus N, Shor P, Sleator T, Smolin J A and Weinfurter H, Elementary gates for quantum computation, Phys. Rev. A 52, 3457-3467, 1995

7

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

8

Bell J S On the problem of hidden variables in quantum theory, Rev. Mod. Phys. 38 447-52, 1966 Speakable and unspeakable in quantum mechanics 1987 (Cambridge University Press)

9

Bennett C H, Brassard G, Crépeau C, Jozsa R, Peres A and Wootters W K Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels, Phys. Rev. Lett. 70 1895-1898, 1993

10

Bennett C H, DiVincenzo D P, Smolin J A and Wootters W K Mixed state entanglement and quantum error correction, Phys. Rev. A 54 3825, 1996

11

Bennett C H, Bernstein E, Brassard G and Vazirani U Strengths and Weaknesses of quantum computing, SIAM Journal of Computation 26 5 pp 1510-1523 October, 1997

12

Boyer M, Brassard G, Hoyer P and Tapp A, Tight bounds on quantum searching, in Fortsch.Phys. 46, (1998) pp. 493-506

13

Brassard G, Searching a quantum phone book, Science 275 627-628 1997

14

Calderbank A R and Shor P W, Good quantum error-correcting codes exist, Phys. Rev. A 54 1098-1105, 1996

15

Chuang I L, Laflamme R, Shor P W and Zurek W H, Quantum computers, factoring, and decoherence, Science 270 1633-1635, 1995

16

Chuang I L, Laflamme R and Paz J P, Effects of Loss and Decoherence on a Simple Quantum Computer, http://xxx.lanl.gov/abs/quant-ph/9602018

17

Clausen M, Fast Generalized Fourier transforms, Theoret. Comput. Sci. 56 55-63 1989

18

Coppersmith D, An approximate Fourier transform useful in quantum factoring, IBM Research Report RC 19642, 1994

19

Cormen T, Leiserson C and Rivest R, Introduction to Algorithms, (pp 776-800 for FFT, 837-844 for primality test, 812 for extended Euclid algorithm, 834-836 for RSA cryptosystem) MIT press, 1990

20

Cory D G, Fahmy A F, and Havel T F, Nuclear magnetic resonance spectroscopy: an experimentally accessible paradigm for quantum computing, in Proc. of the 4th Workshop on Physics and Computation (Complex Systems Institute, Boston, New England) 1996

21

Deutsch D, Quantum theory, the Church-Turing principle and the universal quantum computer, In Proc. Roy. Soc. Lond. A 400 97-117, 1985

22

Deutsch D, Quantum computational networks, In Proc. Roy. Soc. Lond. A 425 73-90, 1989

23

Deutsch D and Jozsa R, Rapid solution of problems by quantum computation, In Proc. Roy. Soc. Lond A 439 553-558, 1992

24

Deutsch D, Barenco A and Ekert A, Universality in quantum computation, In Proc. R. Soc. Lond. A 449 669-677, 1995

25

DiVincenzo D P, Two-bit gates are universal for quantum computation, Phys. Rev. A 51 1015-1022 1995

26

DiVincenzo D P, Quantum computation, Science 270 255-261 1995

27

Einstein A, Rosen N and Podolsky B, Phys. Rev. 47, 777 1935

28

Ekert A and Jozsa R Quantum computation and Shor's factoring algorithm, Rev. Mod. Phys. 68 733 1996

29

Feynman R P Simulating physics with computers, In Int. J. Theor. Phys. 21 467-488, 1982

30

Feynman R P,
Quantum mechanical computers, In Found. of Phys. 16 507-531, 1986 see also Optics News February 1985, 11-20.

31

R. Feynman,
Feynman lectures on computation, 1996.

32

Garey M R and Johnson D S, Computers and Intractability, published by Freeman and Company, New York, 1979

33

Gershenfeld N A and Chuang I L
Bulk spin-resonance quantum computation, Science, 275:350-356, 1997.

34

Grover L K, Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett. 79, 325-328 1997 and the original STOC paper: A fast quantum mechanical algorithm for database search Proc. of the 28th Annual ACM Symposium on Theory of Computing (STOC) 212-221, 1996

35

Grover L K, A framework for fast quantum mechanical algorithms, http://xxx.lanl.gov/abs/quant-ph/9711043

36

Grover L K, Quantum computers can search arbitrarily large databases by a single query in Phys. Rev. Let. 79 23, 4709-4712, 1997

37

Grover L K, A fast quantum mechanical algorithm for estimating the median, http://xxx.lanl.gov/abs/quant-ph/9607024

38

Hagley E et. al, Generation of Einstein Podolsky Rosen pairs of atoms, Phys. Rev. Lett, 79, 1-5, 1997

39

Hamming R W 1986 Coding and information theory, 2nd ed, (Prentice-Hall, Englewood Cliffs)

40

Hardy G H and Wright E M 1979 An introduction to the theory of numbers (Clarendon Press, Oxford)

41

Haroche S and Raimond J-M 1996 Quantum computing: dream or nightmare? Phys. Today August 51-52

42

Hodges A 1983 Alan Turing: the enigma (Vintage, London)

43

Hungerford T W, 1974 Algebra (Springer-Verlag, New York)

44

A. J. Jones, M. Mosca and R. H. Hansen, Implementation of a Quantum Search Algorithm on a Nuclear Magnetic Resonance Quantum Computer, in Nature 393 (1998) 344-346, and see also A. J. Jones and M. Mosca, Implementation of a Quantum Algorithm to Solve Deutsch's Problem on a Nuclear Magnetic Resonance Quantum Computer, in J. Chem. Phys. 109 (1998) 1648-1653

45

Knill E and Laflamme R 1997 A theory of quantum error-correcting codes, Phys. Rev. A 55 900-911

46

Knill E, Laflamme R and Zurek W H 1997 Resilient quantum computation: error models and thresholds http://xxx.lanl.gov/abs/quant-ph/9702058

47

Knuth D E 1981 The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 2nd ed (Addison-Wesley).

48

Lipton R J, Using DNA to solve NP-complete problems. Science, 268 542-545, Apr. 28, 1995

49

Lloyd S 1995 Almost any quantum logic gate is universal, Phys. Rev. Lett. 75, 346-349

50

Margolus N 1990 Parallel Quantum Computation, in Complexity, Entropy and the Physics of Information, Santa Fe Institute Studies in the Sciences of Complexity, vol VIII p. 273 ed Zurek W H (Addison-Wesley)

51

von Neumann, Probabilistic logic and the synthesis of reliable organisms from unreliable components, in automata studies( Shanon,McCarthy eds), 1956

52

Papadimitriou C H, Computational Complexity, Addison-Wesley, 1994

53

Peres A 1993 Quantum theory: concepts and methods (Kluwer Academic Press, Dordrecht)

54

Preskill J 1997 Fault tolerant quantum computation, to appear in Introduction to Quantum Computation, edited by H.-K. Lo, S. Popescu, and T. P. Spiller http://xxx.lanl.gov/abs/quant-ph/9712048

55

Preskill J, Kitaev A, Course notes for Physics 229, Fall 1998, Caltech Univ., http://www.theory.caltech.edu/people/preskill/ph229

56

Rieffel E, Polak W An Introduction to Quantum Computing for Non-Physicists http://xxx.lanl.gov/abs/quant-ph/9809016

57

Rivest R, Shamir A and Adleman L 1979 On digital signatures and public-key cryptosystems, MIT Laboratory for Computer Science, Technical Report, MIT/LCS/TR-212

58

J.J.Saqurai Modern Quantum Mechanics, revised edition. Addison Wesley, 1994

59

Shannon C E 1948 A mathematical theory of communication Bell Syst. Tech. J. 27 379; also p. 623

60

Shor P W,
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comp., 26, No. 5, pp 1484-1509, October 1997

61

Steane A M, Error correcting codes in quantum theory, Phys. Rev. Lett. 77 793-797, 1996, Simple quantum error-correcting codes, Phys. Rev. A 54, 4741-4751, 1996, Quantum Reed-Muller codes, submitted to IEEE Trans. Inf. Theory (preprint in LANL e-print quant-ph/9608026, http://xxx.lanl.gov) Active stabilization, quantum computation, and quantum state synthesis, Phys. Rev. Lett. 78, 2252-2255, 1997

62

Steane A, Quantum Computation, Reports on Progress in Physics 61 (1998) 117, preprint in http://xxx.lanl.gov/abs/quant-ph/9708022

63

Toffoli T 1980 Reversible computing, in Automata, Languages and Programming, Seventh Colloquium, Lecture Notes in Computer Science, Vol. 84, de Bakker J W and van Leeuwen J, eds, (Springer) 632-644

64

Turing A M 1936 On computable numbers, with an application to the Entschneidungsproblem, Proc. Lond. Math. Soc. Ser. 2 42, 230 ; see also Proc. Lond. Math. Soc. Ser. 2 43, 544

65

Wheeler J A and Zurek W H, eds, 1983 Quantum theory and measurement (Princeton Univ. Press, Princeton, NJ)

66

Wootters W K and Zurek W H 1982 A single quantum cannot be cloned, Nature 299, 802

67

Zalka C, Grover's quantum searching algorithm is optimal, http://xxx.lanl.gov/abs/quant-ph/9711070

68

Zurek W H, Decoherence and the transition from quantum to classical, Physics Today 44(10), October, 1991 36-44.