paper

Efficient factorization with a single pure qubit and mixed qubits

arXiv:quant-ph/0001066 · doi:10.1103/PhysRevLett.85.3049

Abstract

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

arXiv comment5 pages including 2 figures. Final version submitted to PRL. Now includes additional comments on entanglement and mixedness as algorithm proceeds. Added references to work by Mosca

References in corpus (9)

Cited by in corpus (64)