Literatur

Ber97

BERTHIAUME, ANDRÉ: Quantum Computation.
In: HEMASPAANDRA, LANE A. und ALAN L. SELMAN (Herausgeber): Complexity Theory Retrospective II, Seiten 23-51. Springer, New York, 1997.

DW95

DRUMM, V. und W. WEIL: Lineare Algebra und Analytische Geometrie.
1995.

EJ94

EKERT, ARTUR und RICHARD JOZSA: Notes on Shor's Efficient Algorithm for Factoring on a Quantum Computer.
NIST Workshop on Quantum Computing and Communication, Gaithersburg, MD, 18. - 19. August, 1994.

Heu98

HEUSER, HARRO: Lehrbuch der Analysis - Teil 1.
Teubner; Stuttgart, Leipzig, 12. Auflage, 1998.

HW79

HARDY, G. H. und E. M. WRIGHT: An Introduction to the Theory of Numbers.
Oxford University Press, New York, 5. Auflage, 1979.

Knu97

KNUTH, DONALD E.: The Art of Computer Programming - Volume 2 Seminumerical Algorithms.
Addison-Wesley Longman, 3. Auflage, 1997.

Sho94

SHOR, PETER W.: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms.
In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Seiten 124-134. IEEE Computer Society Press, November 1994.
Siehe auch LANL preprint quant-ph/9508027.

Sho97

SHOR, PETER W.: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer.
SIAM Journal on Computing, 26(5):1484-1509, 1997.

Zal98

ZALKA, CHRISTOF: Fast versions of Shor's quantum factoring algorithm.
LANL preprint quant-ph/9806084, 1998.