analiza aiqbench
This perspective piece argues that quantum computational advantage has been achieved, drawing a parallel to the historical validation of Bell-inequality violations despite remaining loopholes in scalability and verifiability. The author outlines three critical milestones for the upcoming 100-logical-qubit era, focusing on demonstrating fault-tolerant advantage, utilizing symmetric random circuits for efficient verification, and eventually achieving classically verifiable advantage for cryptographic applications. These steps represent essential progress toward closing current experimental gaps and enabling practical quantum algorithms.
Has quantum advantage been achieved?
arXiv:2603.09901v2 Announce Type: replace Abstract: Quantum computational advantage was claimed for the first time in 2019 and several experiments since then have reinforced and strengthened the claim. At the same time, a new generation of quantum computing devices with 100 logical qubits is being built. This raises two questions: Has quantum advantage actually been achieved? And what should our next milestones be for the upcoming 100-logical-qubit era? In this perspective, I argue that, in fact, quantum advantage has been achieved. The status today is analogous to Bell-inequality violations in the 1980s where some loopholes remain open, specifically, scalability and verifiability. I then outline three milestones for the 100-logical-qubit era aiming to close those loopholes: demonstrate fault-tolerant quantum advantage, perform efficiently verifiable advantage using random circuits with symmetries, and eventually demonstrate classically verifiable advantage with applications to certified randomness. These milestones are also natural stepping stones towards running algorithms with cryptographic applications.
Abstract:Quantum computational advantage was claimed for the first time in 2019 and several experiments since then have reinforced and strengthened the claim. At the same time, a new generation of quantum computing devices with 100 logical qubits is being built. This raises two questions: Has quantum advantage actually been achieved? And what should our next milestones be for the upcoming 100-logical-qubit era? In this perspective, I argue that, in fact, quantum advantage has been achieved. The status today is analogous to Bell-inequality violations in the 1980s where some loopholes remain open, specifically, scalability and verifiability. I then outline three milestones for the 100-logical-qubit era aiming to close those loopholes: demonstrate fault-tolerant quantum advantage, perform efficiently verifiable advantage using random circuits with symmetries, and eventually demonstrate classically verifiable advantage with applications to certified randomness. These milestones are also natural stepping stones towards running algorithms with cryptographic applications.
This is a copyedited version of the original three-part mini series that was published on the Caltech Quantum Frontiers blog. v2: extended introduction, and fixed the definition of finite-fidelity RCS due to a silly counterexample
Quantum Physics (quant-ph); Computational Complexity (cs.CC); History and Philosophy of Physics (physics.hist-ph)
arXiv:2603.09901 [quant-ph]
(or arXiv:2603.09901v2 [quant-ph] for this version)
Text integral sub licența deschisă a publicației · 201 cuvinte
Subiecte conexe
News
Quantum Computing Report · 7 iun. 2026
Coherent Quantum Processing Needs Far Fewer Measurements Than Previous Methods
Quantum Zeitgeist · 23 mai 2026
Pighin and Colleagues Develop Control Framework for Characterizing Quantum Advantage
Quantum Zeitgeist · 15 iun. 2026
Quantum key rates improve with squeezed light over fiber
Quantum Zeitgeist · 16 oct. 2026