Shor's factorization algorithm with a single control qubit and imperfections
arXiv:0809.4416 · doi:10.1103/PhysRevA.78.062323
Abstract
We formulate and numerically simulate the single control qubit Shor algorithm for the case of static imperfections induced by residual couplings between qubits. This allows us to study the accuracy of Shor's algorithm with respect to these imperfections using numerical simulations of realistic quantum computations with up to computational qubits allowing to factor numbers up to N=205193. We confirm that the algorithm remains operational up to a critical coupling strength which drops only polynomially with . The obtained numerical dependence of on is in a good agreement with the analytical estimates that allows to obtain the scaling for functionality of Shor's algorithm on realistic quantum computers with a large number of qubits.
9 pages 5 figures, and 1 table. Research at http://www.quantware.ups-tlse.fr/
References in corpus (14)
- Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
- Quantum Networks for Elementary Arithmetic Operations
- Semiclassical Fourier Transform for Quantum Computation
- Efficient Networks for Quantum Factoring
- Fast Quantum Modular Exponentiation
- Quantum Chaos Border for Quantum Computing
- Efficient factorization with a single pure qubit and mixed qubits
- Emergence of Quantum Chaos in Quantum Computer Core and How to Manage It
- Factoring in a Dissipative Quantum Computer
- Quantum chaos and random matrix theoryfor fidelity decay in quantum computationswith static imperfections
- Scalability of Shor's algorithm with a limited set of rotation gates
- Quantum computation with phase drift errors
- Effects of dynamical phases in Shor's factoring algorithm with operational delays
- Effects of imperfections for Shor's factorization algorithm