Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This study demonstrates that even minimal depolarizing noise can destroy the exponential speedup of Shor's algorithm through a "resonance breaking" effect, effectively nullifying its practical utility for large-scale factoring. The authors further propose a polynomial-time classical alternative to handle low-frequency contributions, suggesting that current fault-tolerance thresholds may be significantly lower than previously assumed.
Sources coveringarXiv, Fortune
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Resonance Breaking in Noisy Shor's Algorithm

arXiv2 min read

arXiv:2609.37636v1 Announce Type: new Abstract: We argue that the exponential quantum advantage in Shor's algorithm is broken under one-layer depolarizing noise of arbitrary small error rate, by analyzing a resonance breaking phenomenon in noisy quantum circuits. First, we express the distribution of measurements on $n$-qubit strings as the superposition of the $4^n$ wave functions in the Pauli path integral. In the noiseless case, the bit-strings achieving resonant peaks guaranteed a constant rate of successful measurements to factor a large number. Secondly, when the middle layer of the quantum circuit has independent depolarizing noise of rate $\lambda$, for any Hamming weight $d$, we obtain corresponding measurement rate bounded by $2(1-\lambda)^d$ for higher frequency terms and by $O(n^d)/2^{n/2}$ for low frequency terms. The rate approaches to zero as $n$ and $d$ approaches to infinity. Resonance breaking destroys the exponential quantum advantage. Furthermore, we design a classical factoring algorithm in polynomial time $O(n^d)$ to substitute the low frequency contribution.

Abstract:We argue that the exponential quantum advantage in Shor's algorithm is broken under one-layer depolarizing noise of arbitrary small error rate, by analyzing a resonance breaking phenomenon in noisy quantum circuits. First, we express the distribution of measurements on $n$-qubit strings as the superposition of the $4^n$ wave functions in the Pauli path integral. In the noiseless case, the bit-strings achieving resonant peaks guaranteed a constant rate of successful measurements to factor a large number. Secondly, when the middle layer of the quantum circuit has independent depolarizing noise of rate $\lambda$, for any Hamming weight $d$, we obtain corresponding measurement rate bounded by $2(1-\lambda)^d$ for higher frequency terms and by $O(n^d)/2^{n/2}$ for low frequency terms. The rate approaches to zero as $n$ and $d$ approaches to infinity. Resonance breaking destroys the exponential quantum advantage. Furthermore, we design a classical factoring algorithm in polynomial time $O(n^d)$ to substitute the low frequency contribution.

Quantum Physics (quant-ph); Computational Complexity (cs.CC); Information Theory (cs.IT); Mathematical Physics (math-ph); Operator Algebras (math.OA)

arXiv:2609.37636 [quant-ph]

(or arXiv:2609.37636v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.37636 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 257 words

Related coverage