Efficient Factorization with a Single Pure Qubit andMixed Qubits
Open Access
- 2 October 2000
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 85 (14), 3049-3052
- https://doi.org/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.
Keywords
Other Versions
This publication has 15 references indexed in Scilit:
- Power of One Bit of Quantum InformationPhysical Review Letters, 1998
- Basics of quantum computationProgress in Quantum Electronics, 1998
- Quantum algorithms revisitedProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
- Bulk Spin-Resonance Quantum ComputationScience, 1997
- Separability Criterion for Density MatricesPhysical Review Letters, 1996
- Quantum computation and Shor's factoring algorithmReviews of Modern Physics, 1996
- Realistic lower bounds for the factorization time of large numbers on a quantum computerPhysical Review A, 1996
- Semiclassical Fourier Transform for Quantum ComputationPhysical Review Letters, 1996
- Quantum ComputationScience, 1995
- Quantum Computations with Cold Trapped IonsPhysical Review Letters, 1995