Quantum Information Processing

Ortiz, O., J. E. Gubernatis, E. Knill, and R. Laflamme. 2001. Quantum Algorithms for Fermionic Simulations.
Phys. Rev. A 64: 022319.
Papadimitriou, C. H. 1994. Computational Complexity. Reading, MA: Addison-Wesley.
Raz, R. 1999. Exponential Separation of Quantum and Classical Communication Complexity. In Proceedings
of the 3lst Annual ACM Symposium on the Theory of Computation (STOC), p. 358. El Paso, TX:
ACM Press.
Ribordy, O., J. Brendel, J.-D. Gautier, N. Gisin, and H. Zbinden. 2001. Long-Distance Entanglement-Based
Quantum Key Distribution. Phys. Rev. A 63: 012309.
Shor, P. W. 1994. Algorithms for Quantum Computation: Discrete Logarithms and Factoring. In Proceedings
of the 35’th Annual Symposium on Foundations of Computer Science. p. 124. Los Alamitos, CA:
IEEE Press.
———. 1995. Scheme for Reducing Decoherence in Quantum Computer Memory. Phys. Rev. A 52: 2493.
———. 1997. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a
Quantum Computer. SIAM J. Comput. 26: 1484.
Simon, D. R. 1994. On the Power of Quantum Computation. In Proceedings of the 35th Annual Symposium on
Foundations of Computer Science, p. 116. Los Alamitos, CA: IEEE Press.
Steane, A. 1996. Multiple Particle Interference and Quantum Error Correction. Proc. R. Soc. London, Ser.
A 452: 2551
Terhal, B. M., and D. P. DiVincenzo. 2000. Problem of Equilibration and the Computation of Correlation
Functions on a Quantum Computer. Phys. Rev. A 61: 022301.
Townsend, P. D. 1998. Quantum Cryptography on Optical Fiber Networks. Opt. Fiber Tech.: Mat., Dev.,
Sys. 4: 345.
von Neumann, J. 1932a. Der Messprozess. Ch. VI. In Mathematische Grundlagen der Quantenmechanik.
Berlin: Springer Verlag.
———. 1932b. “Messung und Reversibilität.” Allgemeine Betrachtungen. Ch. V. In Mathematische
Grundlagen der Quantenmechanik. Berlin: Springer Verlag.
Wiesner, S. 1983. Conjugate Coding. Sigact News 15: 78.
———. 1996. Simulations of Many-Body Quantum Systems by a Quantum Computer. [Online]:
http://eprints.lanl.gov. (quant-ph/9603028).
Yao, A. 1993. Quantum Circuit Complexity. In Proceedings of the 34th Annual Symposium on Foundations
of Computer Science. p. 352. Los Alamitos, CA: IEEE Press.
Zalka, C. 1998. Simulating Quantum Systems on a Quantum Computer. Proc. R. Soc. London,
Ser. A 454: 313.
Glossary
Algorithm. A set of instructions to be executed by a computing device. What
instructions are available depends on the computing device. Typically, instructions
include commands for manipulating the contents of memory and means for repeating
blocks of instructions indefinitely or until a desired condition is met.
Amplitude. A quantum system with a chosen orthonormal basis of “logical” states |i〉
can be in any superposition Σ i α i |i〉 of these states, where Σ i |α i | 2 = 1. In such a
superposition, the complex numbers α ι are called the amplitudes. Note that the
amplitudes depend on the chosen basis.
Ancillas. Helper systems used to assist in a computation involving other
information systems.
Bell basis. For two qubits A and B, the Bell basis consists of the four states
1/√2(|〉 AB ±|〉 AB ) and 1/√2(|〉 AB ±|〉 AB ).
Bell states. The members of the Bell basis.
Bit. The basic unit of deterministic information. It is a system that can be in one of two
possible states, and .
Quantum Information Processing
Number 27 2002 Los Alamos Science 33