Operator Imprecision and Scaling of Shor's Algorithm

Simple item page
dc.creatorHill, C. Ray
dc.creatorViamontes, George F.
dc.date2008-04-18
dc.date.accessioned2026-07-07T09:33:31Z
dc.date.available2026-07-07T09:33:31Z
dc.descriptionShor's algorithm (SA) is a quantum algorithm for factoring integers. Since SA has polynomial complexity while the best classical factoring algorithms are sub-exponential, SA is cited as evidence that quantum computers are more powerful than classical computers. SA is critically dependent on the Quantum Fourier Transform (QFT) and it is known that the QFT is sensitive to errors in the quantum state input to it. In this paper, we show that the polynomial scaling of SA is destroyed by input errors to the QFT part of the algorithm. We also show that Quantum Error Correcting Codes (QECC) are not capable of suppressing errors due to operator imprecision and that propagation of operator precision errors is sufficient to severely degrade the effectiveness of SA. Additionally we show that operator imprecision in the error correction circuit for the Calderbank-Shor-Steane QECC is mathematically equivalent to decoherence on every physical qubit in a register. We conclude that, because of the effect of operator precision errors, it is likely that physically realizable quantum computers will be capable of factoring integers no more efficiently than classical computers.
dc.description15 pages
dc.identifierhttps://arxiv.org/abs/0804.3076
dc.identifierhttp://arxiv.org/abs/0804.3076
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/159158
dc.subjectQuantum Physics
dc.titleOperator Imprecision and Scaling of Shor's Algorithm
dc.typetext

Files

Collections

arXiv