Effects of imperfections for Shor's factorization algorithm

Journal Article · Tue May 15 04:00:00 EDT 2007 · Physical Review. A

DOI:https://doi.org/10.1103/PHYSREVA.75.052311· OSTI ID:20982480

Garcia-Mata, Ignacio; Frahm, Klaus M; Shepelyansky, Dima L ^[1]

---

1. Laboratoire de Physique Theorique, UMR 5152 du CNRS, Universite Paul Sabatier, 31062 Toulouse Cedex 4 (France)

We study effects of imperfections induced by residual couplings between qubits on the accuracy of Shor's algorithm using numerical simulations of realistic quantum computations with up to 30 qubits. The factoring of numbers up to N=943 show that the width of peaks, which frequencies allow to determine the factors, grow exponentially with the number of qubits. However, the algorithm remains operational up to a critical coupling strength {epsilon}{sub c} which drops only polynomially with log{sub 2} N. The numerical dependence of {epsilon}{sub c} on log{sub 2} N is explained by analytical estimates that allows one to obtain the scaling for functionality of Shor's algorithm on realistic quantum computers with a large number of qubits.0.

• OSTI ID: 20982480
• Journal Information: Physical Review. A, Journal Name: Physical Review. A Journal Issue: 5 Vol. 75; ISSN 1050-2947; ISSN PLRAAN
• Country of Publication: United States
• Language: English

Related Subjects

71 CLASSICAL AND QUANTUM MECHANICS
GENERAL PHYSICS
ALGORITHMS
CHAOS THEORY
COMPUTERIZED SIMULATION
COUPLING
DEFECTS
FACTORIZATION
QUANTUM COMPUTERS
QUBITS
SCALING
SIMULATION