COSC85/185-S96: Quantum Computation
For this part of the course we are working from the paper
Polynomial-Time Algorithms for Prime Factorisation and
Discrete Logarithms on a Quantum Computer, P.W. Shor.
(Submitted to SIAM Journal of Computing, 1995.)
Here is
An instructive high-level description of Shor's algorithm.
Misc. links:
- Quantum computation home pages:
uk,
nl,
us.
- On the
Power of Quantum Computation. D. Simon.
-
In Proc. 35th IEEE Symposium on Foundations of Computer Science, pages 116-123, 1994.
- Oracle
Quantum Computing.A. Berthiaume and G. Brassard.
-
In Journal of Modern Optics, 41(12):2521-2535, 1994.
- Algorithms for
Quantum Computation: Discrete log and Factoring. P.W. Shor.
-
In Proc. 35th IEEE Symposium on Foundations of Computer Science,
pages 20-22, 1994.
- Shor's Quantum Algorithm for Factorising
Numbers.A. Ekert et R. Jozsa.
-
In Review of Modern Physics, 1996. (to appear)
- Elementary
Gates for Quantum ComputationA. Barenco, C.H. Bennett, R. Cleve et al.
-
In Physical Review Letter A, 1995.
Last modified: Sat Nov 2 05:36:09 EST 2002
Neal Young <Neal.Young@dartmouth.edu>