Efficient factorization with a single pure qubit and $log N$ mixed qubits

Details Efficient factorization with a single pure qubit and $log N$ mixed qubits Efficient factorization with a single pure qubit and $log N$ mixed qubits

2000-01-18

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

Phys. Rev. Lett. 85, 3049 (2000)

Physics

Quantum Physics

5 pages including 2 figures. Final version submitted to PRL. Now includes additional comments on entanglement and mixedness as

Scientific paper

10.1103/PhysRevLett.85.3049

It is commonly assumed that Shor's quantum algorithm for the efficient
factorization of a large number $N$ requires a pure initial state. Here we
demonstrate that a single pure qubit together with a collection of $log_2 N$
qubits in an arbitrary mixed state is sufficient to implement Shor's
factorization algorithm efficiently.

Affiliated with

Also associated with

No associations

Rating

Efficient factorization with a single pure qubit and $log N$ mixed 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 Efficient factorization with a single pure qubit and $log N$ mixed qubits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient factorization with a single pure qubit and $log N$ mixed qubits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-429829