A quantum circuit for Shor's factoring algorithm using 2n+2 qubits

摘要

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.