containing Notes on Shor's Efficient Algorithm for Factoring on a Quantum Computer (1994)
by
Prepared Artur Ekert
,
Richard Jozsa
BibTeX
@MISC{Ekert94containingnotes,
author = {Prepared Artur Ekert and Richard Jozsa},
title = {containing Notes on Shor's Efficient Algorithm for Factoring on a Quantum Computer},
year = {1994}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
INTRODUCTION These notes are intended to be a self-contained exposition of Shor's polynomial-time algorithm for factoring on a quantum computer, including some background in number theory and quantum computation. Thanks to David Deutsch and Umesh Vazirani for discussions and clarification of many essential points. THE NUMBER-THEORETIC BASIS OF THE FACTORING METHOD
Citations
| 712 | Algorithms for Quantum Computation: Discrete Logrithms and Factoring - Shor - 1994 |
| 2 | Number Theory in Science and Communication", Third Edition - Schroeder - 1997 |
| 1 | Private communication. [4] D. Coppersmith, "An Approximate Fourier Transform Useful in Quantum Factoring", manuscript - Deutsch - 1994 |
| 1 | An Introduction to the Theory of Numbers", 4th edition OUP - Hardy, Wright - 1965 |
| 1 | 11] Cavity QED edited by P - unknown authors - 1982 |
