Circuit for Shor's algorithm using 2n+3 qubits

Details Circuit for Shor's algorithm using 2n+3 qubits Circuit for Shor's algorithm using 2n+3 qubits

2002-05-15

arxiv.org/abs/quant-ph/0205095v3

Quantum Information and Computation, Vol. 3, No. 2 (2003) pp. 175-185

Physics

Quantum Physics

14 pages, 10 figures, revised January 24, 2003

Scientific paper

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. Keywords: Factorization, quantum circuits, modular arithmetics

Affiliated with

Also associated with

No associations

Rating

Circuit for Shor's algorithm using 2n+3 qubits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Circuit for Shor's algorithm using 2n+3 qubits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Circuit for Shor's algorithm using 2n+3 qubits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-239788