 |
|
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.6 No.2 March 2006 |
|
A quantum
circuit for Shor's factoring algorithm using 2n+2 qubits
(pp184-192)
Yasuhiro Takahashi and
Noboru Kunihiro
doi:https://doi.org/10.26421/QIC6.2-4
Abstracts:
We construct a quantum circuit for Shor's factoring algorithm that uses
2n+2 qubits, where n is the length of the number to be factored. The
depth and size of the circuit are O(n^3) and O(n^3\log n), respectively.
The number of qubits used in the circuit is less than that in any other
quantum circuit ever constructed for Shor's factoring algorithm.
Moreover, the size of the circuit is about half the size of Beauregard's
quantum circuit for Shor's factoring algorithm, which uses 2n+3 qubits.
Key words:
quantum circuits, elementary arithmetic operations, factoring |
กก |
