Quantum computation and quantum information
Quantum computation and quantum information
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
Fast parallel circuits for the quantum Fourier transform
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Circuit for Shor's algorithm using 2n+3 qubits
Quantum Information & Computation
A linear-size quantum circuit for addition with no ancillary qubits
Quantum Information & Computation
Quantum addition circuits and unbounded fan-out
Quantum Information & Computation
The quantum fourier transform on a linear nearest neighbor architecture
Quantum Information & Computation
Estimating Jones polynomials is a complete problem for one clean qubit
Quantum Information & Computation
A 2D nearest-neighbor quantum architecture for factoring in polylogarithmic depth
Quantum Information & Computation
| Hi-index | 0.00 |
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 circuitare O(n3) and O(n3 log n), respectivel). The number of qubits used in the circuit is lessthan 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 circuitfor Shor's factoring algorithm, which uses 2n + 3 qubits.