Back to News
quantum-computing

Uncovering and Circumventing Noise in Quantum Algorithms via Metastability

Antonio Sannia, Pratik Sathe, Luis Pedro Garc\'ia-Pintos
Loading...
3 min read
0 likes
⚡ Quantum Brief
Researchers introduced a noise-mitigation strategy leveraging metastability—a phenomenon where quantum systems linger in intermediate states—offering intrinsic resilience for both digital and analog quantum algorithms. The team experimentally validated metastable noise in gate-model quantum processors and quantum annealers, proving its presence in near-term hardware and enabling noise-aware algorithm design. A new theoretical framework includes an efficiently computable noise resilience metric, eliminating the need for full classical simulation of quantum algorithms to assess performance. Applications were demonstrated in variational quantum algorithms and analog adiabatic state preparation, showing how metastability can improve final state accuracy under noisy conditions. This work shifts the paradigm by exploiting hardware noise’s intrinsic properties, providing practical implementation strategies to bridge the gap between noisy and ideal quantum computations.
AI Audio Summary
0:00 / 0:00
Click to play
Quantum computing technology
Unsplash · Validated Fallback

Quantum Physics arXiv:2511.09821 (quant-ph) [Submitted on 12 Nov 2025] Title:Uncovering and Circumventing Noise in Quantum Algorithms via Metastability Authors:Antonio Sannia, Pratik Sathe, Luis Pedro García-Pintos View a PDF of the paper titled Uncovering and Circumventing Noise in Quantum Algorithms via Metastability, by Antonio Sannia and 2 other authors View PDF HTML (experimental) Abstract:The presence of noise is the primary challenge in realizing fault-tolerant quantum computers. In this work, we introduce and experimentally validate a novel strategy to circumvent noise by exploiting the phenomenon of metastability, where a dynamical system exhibits long-lived intermediate states. We demonstrate that if quantum hardware noise exhibits metastability, both digital and analog algorithms can be designed in a noise-aware fashion to achieve intrinsic resilience. We develop a general theoretical framework and introduce an efficiently computable noise resilience metric that avoids the need for full classical simulation of the quantum algorithm. We illustrate the use of our framework with applications to variational quantum algorithms and analog adiabatic state preparation. Crucially, we provide experimental evidence supporting the presence of metastable noise in gate-model quantum processors as well as quantum annealing devices. Thus, we establish that the intrinsic nature of noise in near-term quantum hardware can be leveraged to inform practical implementation strategies, enabling the preparation of final noisy states that more closely approximate the ideal ones. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2511.09821 [quant-ph] (or arXiv:2511.09821v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2511.09821 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Antonio Sannia [view email] [v1] Wed, 12 Nov 2025 23:55:27 UTC (580 KB) Full-text links: Access Paper: View a PDF of the paper titled Uncovering and Circumventing Noise in Quantum Algorithms via Metastability, by Antonio Sannia and 2 other authorsView PDFHTML (experimental)TeX 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

quantum-algorithms
quantum-annealing
quantum-computing
quantum-hardware
quantum-machine-learning

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.