Quantum Computing
Pointers to the Literature
The most comprehensive archive of quantum computing research papers is
in the quantum physics section of the e-Print archive maintained at
Los Alamos National Labs (http://xxx.lanl.gov/archive/quant-ph).
Nearly all quantum computing papers can be found there. Some papers
also appear under Computer Science, especially Computational
Complexity. Here are a few highlights (hastily compiled):
ALGORITHMS, GATES, FAULT-TOLERANCE
quant-ph/9508027
Title: Polynomial-Time Algorithms for Prime Factorization and
Discrete Logarithms on a Quantum Computer
Authors: Peter W. Shor (AT&T Research)
quant-ph/9711043
Title: A framework for fast quantum mechanical algorithms
Author: Lov K. Grover (Bell Labs, Murray Hill NJ)
quant-ph/9503016
Title: Elementary gates for quantum computation
Authors: A. Barenco (Oxford), C. H. Bennett (IBM), R. Cleve
(Calgary), D. P. DiVincenzo (IBM), N. Margolus (MIT), P. Shor
(AT&T), T. Sleator (NYU), J. Smolin (UCLA), H. Weinfurter (Innsbruck)
quant-ph/9512032
Title: Good Quantum Error-Correcting Codes Exist
Authors: A. R. Calderbank, Peter W. Shor (AT&T Research)
quant-ph/9604028
Title: Stabilisation of Quantum Computations by Symmetrisation
Authors: Adriano Barenco, Andre` Berthiaume, David Deutsch, Artur
Ekert, Richard Jozsa, Chiara Macchiavello
quant-ph/9605011
Title: Fault-tolerant quantum computation
Authors: Peter W. Shor (AT&T Research)
quant-ph/9712048
Title: Fault-tolerant quantum computation
Authors: John Preskill (Cal Tech)
quant-ph/9906054
Title: On Universal and Fault-Tolerant Quantum Computing
Author: P. Oscar Boykin, Tal Mor, Matthew Pulver, Vwani
Roychowdhury, Farrokh Vatan
COMPLEXITY
quant-ph/9906111
Title: An Introduction to Quantum Complexity Theory
Authors: Richard Cleve (U of Calgary)
quant-ph/9701001
Title: Strengths and Weaknesses of Quantum Computing
Authors: Charles H. Bennett, Ethan Bernstein, Gilles Brassard,
Umesh Vazirani
cs.CC/9811023
Title: Complexity limitations on quantum computation
Authors: Lance Fortnow, John D. Rogers
quant-ph/9812056
Title: Determining Acceptance Possibility for a Quantum
Computation is Hard for the Polynomial Hierarchy
Authors: Stephen Fenner, Frederic Green, Steven Homer, Randall Pruim
CRYPTOGRAPHY
quant-ph/9712023
Title: A brief review on the impossibility of quantum bit commitment
Authors: Gilles Brassard, Claude Crépeau, Dominic Mayers, Louis Salvail
quant-ph/9806031
Title: Defeating classical bit commitments with a quantum computer
Authors: Gilles Brassard, Claude Crépeau, Dominic Mayers, Louis Salvail
An issue of the SIAM Journal of Computing was devoted to quantum
computing and has a number of foundational papers, including updates
of some of the ones listed above:
SIAM Journal of Computing, Volume 26, Number 5, 1997.
Here is a recent book that looks pretty good:
Jozef Gruska. Quantum Computing. Advanced Topics in Computer
Science Series, McGraw Hill, 1999.
There is a yearly workshop, Algorithms in Quantum Information
Processing (AQIP). The last one was in Montreal last December
(1999). The next one is in Amsterdam.
WEB SITES
This is a citation index which is sorted, presumably by number of hits
from NEC researchers. This gives you an idea of what they're
interested in.
http://citeseer.nj.nec.com/Theory/QuantumComputing