Shor's algorithm with fewer (pure) qubits

Details Shor's algorithm with fewer (pure) qubits Shor's algorithm with fewer (pure) qubits

2006-01-15

arxiv.org/abs/quant-ph/0601097v1

Physics

Quantum Physics

12 pages

Scientific paper

In this note we consider optimised circuits for implementing Shor's quantum factoring algorithm. First I give a circuit for which none of the about 2n qubits need to be initialised (though we still have to make the usual 2n measurements later on). Then I show how the modular additions in the algorithm can be carried out with a superposition of an arithmetic sequence. This makes parallelisation of Shor's algorithm easier. Finally I show how one can factor with only about 1.5n qubits, and maybe even fewer.

Affiliated with

Also associated with

No associations

Rating

Shor's algorithm with fewer (pure) 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 Shor's algorithm with fewer (pure) qubits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Shor's algorithm with fewer (pure) qubits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-523905