Feynman's clock and hierarchy-informed sampling for quantum error mitigation
This approach offers a scalable, polynomial-overhead framework for error mitigation, potentially bridging the gap between noisy near-term devices and fault-tolerant quantum computing by addressing a key bottleneck in practical implementations.
Understand this faster with AI
Quantum Physics arXiv:2607.06752 (quant-ph) [Submitted on 7 Jul 2026] Title:Feynman's clock and hierarchy-informed sampling for quantum error mitigation Authors:Theo Saporiti View a PDF of the paper titled Feynman's clock and hierarchy-informed sampling for quantum error mitigation, by Theo Saporiti View PDF HTML (experimental) Abstract:Near-term physical implementations of quantum algorithms require efficient quantum error mitigation schemes to reduce quantum noise. In this letter we propose a new mitigation technique, by extending the applicability of our BBGKY-ISM scheme from quantum simulations of spin chains to arbitrary quantum circuits. We map executions of quantum circuits using Feynman's clock Hamiltonian to the Hamiltonian dynamics of a corresponding quantum system, whose time evolution obeys a BBGKY-like hierarchy of equations informing the BBGKY-ISM mitigation. We show that the method's classical and quantum overheads are polynomial in the circuit size and in the number of qubits. We apply our method to numerical simulations of tunable Bell state preparation circuits under state-of-the-art quantum noise, and numerically demonstrate its systematic and controllable quantum error reduction capability. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2607.06752 [quant-ph] (or arXiv:2607.06752v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2607.06752 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Theo Saporiti [view email] [v1] Tue, 7 Jul 2026 19:33:58 UTC (421 KB) Full-text links: Access Paper: View a PDF of the paper titled Feynman's clock and hierarchy-informed sampling for quantum error mitigation, by Theo SaporitiView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-07 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?) 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?)