 |
|
Subscribers:
to view the full text of a paper, click on the title of the paper. If you
have any problem to access the full text, please check with your librarian
or contact
qic@rintonpress.com
To subscribe to QIC, please click
Here.
|
Quantum
Information and Computation
ISSN: 1533-7146
published since 2001
|
|
Vol.3 No.2, March 2003 |
|
Circuit
for Shor's algorithm using 2n+3 qubits
(pp175-185)
S. Beauregard
doi:
https://doi.org/10.26421/QIC3.2-8
Abstracts:
We try to minimize the number of qubits needed to factor
an integer of n bits using Shor's algorithm on a quantum computer. We
introduce a circuit which uses 2n+3 qubits and O(n^3 lg(n)) elementary
quantum gates in a depth of O(n^3) to implement the factorization
algorithm. The circuit is computable in polynomial time on a classical
computer and is completely general as it does not rely on any property
of the number to be factored.
Key words:
factorization, quantum circuits, modular arithmetics |
กก |
