CIS 622 Computational Complexity
Quantum Computing Papers
The following are some classic papers on quantum computing
from a 1997 special issue of the SIAM Journal on Computing
(volume 26, number 5).
The links will
take you to the SIAM site - you will be able to download them only if
you are coming from an originating site with access to the electronic
versions, such as "uoregon".
-
Quantum Complexity Theory, by Ethan Bernstein and Umesh Vazirani.
-
On the Power of Quantum Computation, by Daniel R. Simon .
-
Polynomial-Time Algorithms for Prime Factorization and Discrete
Logarithms on a Quantum Computer, by Peter W. Shor.
-
Strengths and Weaknesses of Quantum Computing, by
Charles H. Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani.
-
Quantum Computability, by Leonard M. Adleman, Jonathan DeMarrais,
and Ming-Deh A. Huang.
-
Stabilization of Quantum Computations by Symmetrization, by
Adriano Barenco, Andr? Berthiaume, David Deutsch, Artur Ekert,
Richard Jozsa, and Chiara Macchiavello.
- Here is an article from the Bulletin of the EATCS by Stephen Fenner,
A Physics Free Introduction to the Quantum
Computation Model