Bibliography

1

S. Wiesner.
Conjugate coding.
Sigact News, (original manuscript $\sim$1969), 15:78-88, 1983.

2

C. H. Bennett, G. Brassard, S. Breidbart, and S. Wiesner.
Quantum cryptography, or unforgeable subway tokens.
In Advances in Cryptology: Proceedings of Crypto'82, pages 267-275. Plenum Press, 1982.

3

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

4

P. W. Shor.
Algorithms for quantum computation: Discrete logarithms and factoring.
In Proceedings of the 35'th Annual Symposium on Foundations of Computer Science, pages 124-134, Los Alamitos, California, 1994. IEEE Press.

5

P. W. Shor.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer.
SIAM J. Comput., 26:1484-1509, 1997.

6

L. K. Grover.
A fast quantum mechanical algorithm for database search.
In Proceedings of the 28th Annual ACM Symposium on the Theory of Computation, pages 212-219, New York, New York, 1996. ACM press.

7

A. Yao.
Quantum circuit complexity.
In Proceedings of the 34th Annual Symposium on Foundations of Computer Science, pages 352-360, Los Alamitos, California, 1993. IEEE Press.

8

T. H. Cormen, C. E. Leiserson, and R. L. Rivest.
Introduction to Algorithms.
MIT Press, Cambridge, Mass, 1990.

9

C. H. Papadimitriou.
Computational Complexity.
Addison-Wesley, Reading, Mass, 1994.

10

R. Gupta, S. A. Smolka, and S. Bhaskar.
On randomization in sequential and distributed algorithms.
ACM Comp. Surv., 26:7-86, 1994.

11

R. Laflamme, E. Knill, D. Cory, E. M. Fortunato, T. Havel, C. Miquel, R. Martinez, C. Negrevergne, G. Ortiz, M. A. Pravia, S. Sinha, R. Somma, and L. Viola.
Introduction to NMR quantum information processing.
Technical Report LAUR-02-6132, Los Alamos National Laboratory, 2001.
To appear in LA Science.

12

E. Knill, R. Laflamme, A. Ashikhmin, H. Barnum, L. Viola, and W. Zurek.
Introduction to quantum error correction.
Technical Report LAUR-01-6115, Los Alamos National Laboratory, 2001.
To appear in LA Science.

13

E. Bernstein and U. Vazirani.
Quantum complexity theory.
In Proceedings of the 25th Annual ACM Symposium on the Theory of Computation, pages 11-20, New York, New York, 1993. ACM press.

14

D. R. Simon.
On the power of quantum computation.
In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pages 116-123, Los Alamitos, California, 1994. IEEE Press.

15

A. Ekert.
From quantum code-making to quantum code-breaking.
In The geometric universe, pages 195-214. Oxford Univ. Press, Oxford, 1998.

16

R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca.
Quantum algorithms revisited.
Proc. R. Soc. Lond. A, 454:339-354, 1998.
quant-ph/9708016.

17

A. Yu. Kitaev.
Quantum measurements and the Abelian stabilizer problem.
quant-ph/9511026, 1995.

18

E. D. Bolker.
Elementary Number Theory: An Algebraic Approach.
W. A. Benjamin, Inc., New York, 1970.

19

G. H. Hardy and E. M. Wright.
An Introduction to the Theory of Numbers.
Oxford University Press, London, fifth edition edition, 1979.

20

R. B. Griffiths and C-S Niu.
Semiclassical Fourier transform for quantum computation.
Phys. Rev. Lett., 76:3228-3231, 1996.

21

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

22

R. Landauer.
Information is physical.
Phys. Today, 44:22-29, 1991.

23

R. Landauer.
Irreversibility and heat generation in the computing process.
IBM J. Res. Dev., 5:183-192, 1961.
See also [54].

24

C. H. Bennett.
Logical reversibility of computation.
IBM J. Res. Dev., 17:525-532, 1973.

25

J. von Neumann.
Measurement and reversibility.
In Mathematische Grundlagen der Quantenmechanik, page Ch. V. Springer, Berlin, 1932.

26

J. von Neumann.
The measuring process.
In Mathematische Grundlagen der Quantenmechanik, page Ch. VI. Springer, Berlin, 1932.

27

A. S. Holevo.
Statistical problems in quantum physics.
In G. Maruyama and J. V. Prokhorov, editors, Proceedings of the Second Japan-USSR Symposium on Probability Theory, Lecture Notes in Mathematics 330, Berlin, 1973. Springer Verlag.

28

C. W. Helstrom.
Quantum Detection and Estimation Theory.
Mathematics in Science and Engineering 123. Academic Press, New York, 1976.

29

A. S. Holevo.
Bounds for the quantity of information transmitted by a quantum communication channel.
Prob. Inf. Trans., 9:177-183, 1973.

30

J. S. Bell.
On the einstein podolsky rosen paradox.
Physics, 1:195-200, 1964.

31

P. Benioff.
The computer as a physical system: A microscopic quantum mechanical hamiltonian model of computers as represented by turing machines.
J. Stat. Phys., 22:563-591, 1980.

32

Y. I. Manin.
The Computable and the Not Computable.
Sovetskoye Radio, Moscow, 1980.
In Russian.

33

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

34

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

35

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

36

P. W. Shor.
Scheme for reducing decoherence in quantum computer memory.
Phys. Rev. A, 52:2493-2496, 1995.

37

A. Steane.
Multiple particle interference and quantum error correction.
Proc. R. Soc. Lond. A, 452:2551-2577, 1996.

38

M. A. Nielsen and I. L. Chuang.
Quantum Computation and Quantum Information.
Cambridge University Press, 2001.

39

S. Lloyd.
Universal quantum simulators.
Science, 273:1073-1078, 1996.

40

S. Wiesner.
Simulations of many-body quantum systems by a quantum computer.
quant-ph/9603028, 1996.

41

C. Zalka.
Simulating quantum-systems on a quantum computer.
Proc. R. Soc. Lond. A, 454:313-322, 1998.

42

B. M. Terhal and D. P. DiVincenzo.
Problem of equilibration and the computation of correlation functions on a quantum computer.
Phys. Rev. A, 61:022301/1-22, 2000.

43

E. Knill and R. Laflamme.
On the power of one bit of quantum information.
Phys. Rev. Lett., 81:5672-5675, 1998.

44

D. S. Abrams and S. Lloyd.
Quantum algorithm providing an exponential speed increase for finding eigenvalues and eigenvectors.
Phys. Rev. Lett., 83:5162-5165, 1999.

45

G. Ortiz, J. E. Gubernatis, E. Knill, and R. Laflamme.
Quantum algorithms for fermionic simulations.
Phys. Rev. A, 64:022319/1-14, 2001.

46

C. Miquel, J. P. Paz, M. Saraceno, E. Knill, R. Laflamme, and C. Negrevergne.
Interpretation of tomography and spectroscopy as dual forms of quantum computations.
Nature, 418:59-62, 2002.
quant-ph/0109072.

47

G. Brassard, P. Høyer, and A. Tapp.
Quantum counting.
In K. G. Larsen, S. Skyum, and G. Winskel, editors, Automata, Languages and Programming, Proceedings of ICALP'98, volume 1443 of Lecture Notes in Computer Science, pages 820-831, Berline, Germany, 1998. Springer Verlag.

48

R. J. Hughes, G. L. Morgan, and C. G. Peterson.
Quantum key distribution over a 48km optical fibre network.
J. Mod. Optics, 47:533-547, 2000.

49

P. D. Townsend.
Quantum cryptography on optical fiber networks.
Opt. Fiber Tech.: Mat., Dev., Sys., 4:345-370, 1998.

50

G. Ribordy, J. Brendel, J.-D. Gautier, N. Gisin, and H. Zbinden.
Long-distance entanglement-based quantum key distribution.
Phys. Rev. A, 63:012309/1-12, 2001.

51

R. Cleve and H. Buhrman.
Substituting quantum entanglement for communication.
Phys. Rev. A, 56:1201-1204, 1997.

52

H. Buhrman, R. Cleve, and W. Van Dam.
Quantum entanglement and communication complexity.
SIAM J. Comput., 30:1829-1841, 2000.

53

R. Raz.
Exponential separation of quantum and classical communication complexity.
In Proceedings of the 31st Annual ACM Symposium on the Theory of Computation (STOC), pages 358-367, El Paso, Texas, 1999. ACM Press.

54

R. Landauer.
Irreversibility and heat generation in the computing process.
IBM J. Res. Dev., 44:261-269, 2000.