Feynman's clock and hierarchy-informed sampling for quantum error mitigation
quant-ph
Submitted: 2026-07-07
Updated: 2026-09-22
Comments: 7 pages, 4 figures. Corrected minor math and text typos
License: http://creativecommons.org/licenses/by/4.0/
The gist: Near-term physical implementations of quantum algorithms require efficient quantum error mitigation schemes to reduce quantum noise.
Terminology
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.
Sources
- A fast quantum mechanical algorithm for database search
- Quantum Computing
- The Physical Implementation of Quantum Computation
- Quantum Computing
- Quantum Simulation
- Quantum Computing in the NISQ era and beyond
- Quantum Prometheus: Defying Overhead with Recycled Ancillas in Quantum Error Correction
- Efficient variational quantum simulator incorporating active error minimisation
- Digital zero noise extrapolation for quantum error mitigation
- Error mitigation by training with fermionic linear optics
- BBGKY hierarchy for quantum error mitigation
- Quantum Error Mitigation by Global Randomized Error Cancellation for Adiabatic Evolution in the Schwinger Model
- Quantum error mitigation by hierarchy-informed sampling: chiral dynamics in the Schwinger model
- Myths around quantum computation before full fault tolerance: What no-go theorems rule out and what they don't
- Demonstrating quantum error mitigation on logical qubits
- Efficiency of Feynman's quantum computer
- The Feynman-Kitaev computer's clock: bias, gaps, idling and pulse tuning
- Variational dynamics as a ground-state problem on a quantum computer
- Lecture Notes on Quantum Algorithms for Scientific Computation
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians