Shor's factorization algorithm with a single control qubit and imperfections

dc.creatorGarcia-Mata, Ignacio
dc.creatorFrahm, Klaus M.
dc.creatorShepelyansky, Dima L.
dc.date2008-09-25
dc.date.accessioned2026-07-07T12:12:19Z
dc.date.available2026-07-07T12:12:19Z
dc.descriptionWe 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 $n_q=18$ computational qubits allowing to factor numbers up to N=205193. We confirm that the algorithm remains operational up to a critical coupling strength $ε_c$ which drops only polynomially with $\log_2 N$. The obtained numerical dependence of $ε_c$ on $\log_2 N$ 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.
dc.description9 pages 5 figures, and 1 table. Research at http://www.quantware.ups-tlse.fr/
dc.identifierhttps://arxiv.org/abs/0809.4416
dc.identifierhttp://arxiv.org/abs/0809.4416
dc.identifierPhys. Rev. A 78, 062323 (2008)
dc.identifierdoi:10.1103/PhysRevA.78.062323
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/210507
dc.subjectQuantum Physics
dc.subjectDisordered Systems and Neural Networks
dc.titleShor's factorization algorithm with a single control qubit and imperfections
dc.typetext

Files

Collections