Back to News
quantum-computing

Unconditional and exponentially large violation of classicality

Marcello Benedetti, Gabriel Marin-Sanchez, Jordi Weggemans, Matthias Rosenkranz, Harry Buhrman
Loading...
3 min read
0 likes
⚡ Quantum Brief
Researchers demonstrated an unconditional, exponentially large violation of classical physics using a trapped-ion quantum computer with up to 55 qubits, marking a breakthrough in testing quantum advantage without computational hardness assumptions. The team designed a game based on complement sampling—a problem that maximizes the gap between quantum and classical performance—using input-output distributions inspired by the Bernstein-Vazirani problem for efficient verification. Experiments on Quantinuum’s H2 system involved thousands of circuits, showing scores consistent with quantum strategies, providing scalable, noise-resilient evidence of non-classical behavior in real hardware. Unlike prior tests, this method avoids reliance on unproven complexity assumptions, addressing key limitations like hardware noise and inefficient verification that plagued earlier quantum supremacy demonstrations. The work offers a practical, scalable framework to certify quantum devices, reinforcing confidence in their non-classical operation while sidestepping theoretical loopholes.
AI Audio Summary
0:00 / 0:00
Click to play
Quantum computing technology
Unsplash · Validated Fallback

Quantum Physics arXiv:2511.11008 (quant-ph) [Submitted on 14 Nov 2025] Title:Unconditional and exponentially large violation of classicality Authors:Marcello Benedetti, Gabriel Marin-Sanchez, Jordi Weggemans, Matthias Rosenkranz, Harry Buhrman View a PDF of the paper titled Unconditional and exponentially large violation of classicality, by Marcello Benedetti and 4 other authors View PDF Abstract:Testing the predictions of quantum mechanics has been one of the main experimental endeavors for decades. Recent advancements in technology led to a number of demonstrations which test non-classicality via specific computational tasks. Limitations of these experiments include dependence on complexity theory assumptions, susceptibility to hardware noise and inefficient verification, raising questions about their scalability. We propose to test non-classicality using a game based on complement sampling, an efficiently verifiable problem that achieves the largest possible separation between quantum and classical computation when both input and output represent samples from probability distributions. When restricting the input to instances inspired by the Bernstein-Vazirani problem, our game admits an exponentially large violation of classicality without relying on computational hardness assumptions. We execute the game on Quantinuum System Model H2 trapped-ion quantum computers, with experiments consisting of thousands of different circuits on up to 55 qubits. The observed scores can be explained by a systematic adoption of a quantum strategy, further corroborating the quantum nature of the hardware in an efficient and scalable way. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2511.11008 [quant-ph] (or arXiv:2511.11008v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2511.11008 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Marcello Benedetti [view email] [v1] Fri, 14 Nov 2025 06:53:00 UTC (2,162 KB) Full-text links: Access Paper: View a PDF of the paper titled Unconditional and exponentially large violation of classicality, by Marcello Benedetti and 4 other authorsView PDFTeX Source view license Current browse context: quant-ph new | recent | 2025-11 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators 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. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantinuum
quantum-computing
quantum-hardware
quantum-policy
trapped-ion

Source Information

Source: arXiv Quantum Physics

Discussion

0 professional contributions

Sign in to join this professional discussion.

Be the first to add a constructive contribution.