analiza aiqbench
This paper addresses the critical challenge of verifying quantum advantage through classical means by introducing Clifford circuit obfuscation as a heuristic method to hide stabilizer structures while maintaining efficient verifiability. By injecting non-stabilizer resources that resist known classical simulation attacks, this approach offers a practical pathway toward demonstrating quantum supremacy without requiring stringent implementation constraints found in previous protocols.
Classical Verification of Quantum Advantage via Clifford Obfuscation
arXiv:2608.15963v1 Announce Type: new Abstract: Demonstrating quantum advantage in a manner that can be independently verified by classical means remains one of the most pressing open problems in quantum computing. Here we propose a new heuristic approach for constructing quantum circuits that are hard to classically simulate yet whose output distributions can be efficiently verified classically. Our approach is based on Clifford circuit obfuscation. This obfuscation scheme hides the Clifford structure and injects a controlled and rapidly growing non-stabilizer resources that resist known classical attack strategies including reverse engineering and direct simulation. Our protocol is heuristic but is supported by both numerical and theoretical evidence. This work provides a new avenue toward classically verifiable quantum advantage that avoids the stringent implementation requirements of known approaches.
Abstract:Demonstrating quantum advantage in a manner that can be independently verified by classical means remains one of the most pressing open problems in quantum computing. Here we propose a new heuristic approach for constructing quantum circuits that are hard to classically simulate yet whose output distributions can be efficiently verified classically. Our approach is based on Clifford circuit obfuscation. This obfuscation scheme hides the Clifford structure and injects a controlled and rapidly growing non-stabilizer resources that resist known classical attack strategies including reverse engineering and direct simulation. Our protocol is heuristic but is supported by both numerical and theoretical evidence. This work provides a new avenue toward classically verifiable quantum advantage that avoids the stringent implementation requirements of known approaches.
arXiv:2608.15963 [quant-ph]
(or arXiv:2608.15963v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2608.15963 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.
Text integral sub licența deschisă a publicației · 211 cuvinte
Subiecte conexe

A brief history of quantum vs classical computational advantage
Quantum Journal · 1 sept. 2026

IBM and Ecosystem Partners Demonstrate “Trusted Quantum Advantage” Beyond Classical Supercomputers
Quantum Computing Report · 30 iul. 2026
IBM claims their quantum computers outperform classical ones
cen.acs.org · 4 aug. 2026
Verifiable Quantum Advantage and Computation via Quantum Circuit Obfuscation
arXiv · 1 oct. 2026