Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 3 min ago
PreprintCC BY 4.0arXiv

Feynman's clock and hierarchy-informed sampling for quantum error mitigation

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.

Related

  1. Hardware-Efficient Error Mitigation and Shot-Efficient Sampling on IBM Quantum Hardware
    Sumit Chongder
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  2. Accuracy, Decision Risk, and Sampling Cost in Quantum Error Mitigation
    Vicenzo Scavino Alfaro
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  3. Characterization and Mitigation of Boundary Sampling Artifacts in Electron Phase Space Generation for Clinical FLASH-RT Deployment
    Rafael Carballeira, Rongxiao Zhang, Kevin J. Willy +2
    arXivPreprintCC BY-NC-ND 4.0Full textBiological & medical physicsarXiv
  4. Between Heisenberg and Feynman: Ettore Majorana's Reflections on the Meaning of Quantum Theory
    Andrea Oldofredi
    arXivPreprintCC BY 4.0Full textGeneral physicsarXiv
  5. Towards quantum computing Feynman diagrams in hybrid qubit-oscillator devices
    S. Varona, S. Saner, O. BÄzÄvan +3
    QuantumPeer-reviewedCC BY 4.0Full textQuantum physics & quantum informationQuantumCrossref
BibTeX
@misc{saporiti2026feynmans,
  title = {{Feynman's clock and hierarchy-informed sampling for quantum error mitigation}},
  author = {Theo Saporiti},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2607.06752},
  eprint = {2607.06752},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2607.06752},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Feynman's clock and hierarchy-informed sampling for quantum error mitigation
AU  - Theo Saporiti
PY  - 2026
DA  - 2026/09/22
PB  - arXiv
DO  - 10.48550/arxiv.2607.06752
UR  - https://arxiv.org/abs/2607.06752
AB  - 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.
ER  -