Efficient factorization with a single pure qubit
Scott Parker, Martin Bodo Plenio · arXiv (Cornell University) · 2000
It is commonly assumed that the initial state in Shor's quantum algorithm for the efficient factorization of large numbers 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.