Quantum error mitigation by Pauli check sandwiching
Open accessAbstract
We describe and analyze an error mitigation technique that uses multiple pairs of parity checks to detect the presence of errors. Each pair of checks uses one ancilla qubit to detect a component of the error operator and represents one layer of the technique. We build on the results on extended flag gadgets and put it on a firm theoretical foundation. We prove that this technique can recover the noiseless state under the assumption of noise not affecting the checks. The method does not incur any encoding overhead and instead chooses the checks based on the input circuit. We provide an algorithm for obtaining such checks for an arbitrary target circuit. Since the method applies to any circuit and input state, it can be easily combined with other error mitigation techniques. We evaluate the performance of the proposed methods using extensive numerical simulations on 1850 random input circuits composed of Clifford gates and non-Clifford single-qubit rotations, a class of circuits encompassing most commonly considered variational algorithm circuits. We observe average improvements in fidelity of 34 percentage points with six layers of checks.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Our error detection scheme leads to large improvements in QAOA performance on hardware at the cost of the number of repetitions growing exponentially with the number of checks.
“As a result, our error detection scheme leads to large improvements in QAOA performance on hardware at the cost of the number of repetitions growing exponentially with the number of checks (28).”
From Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem (2024) · cites this paper as [28]
The Introduction and Methods > Numerical results (pages unavailable) report large fidelity gains in simulations of random circuits that encompass a class of QAOA circuits, alongside lower postselection probabilities. They do not report improved QAOA performance on hardware or establish that the required repetitions grow exponentially with the number of checks. (LLM, conf=0.88)
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
The citation lists haven’t been fetched yet
References 35 · Cited by 26
Research works printed but not linked: 1
- [3]Kitaev AY Quantum Error Correction with Imperfect Gates 1997 Springer US 181 188
- Authors
- Gonzales, A., Shaydulin, R., Saleem, Z. H., & Suchara, M.
- Affiliations
- Argonne National Laboratory (US)
- JPMorgan Chase & Co (United States) (US)
- Corresponding author
- Gonzales, Alvin
- Venue
- Scientific Reports
- Published
- 2023-02-06
- Volume
- 13
- Issue
- 1
- Pages
- 2122-2122
- ISSN
- 2045-2322 (ISSN-L)
- PMC
- PMC9902625
- OpenAlex
- W4281800311
- Cited by
- 26
- References
- 35
- Citations by year
- 2026: 3 · 2025: 9 · 2024: 7 · 2023: 6 · 2017: 1
- FWCI
- 2.36
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- Scientific Reports (publishedVersion, cc-by)
- Research Square (acceptedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Intelligence Community Postdoctoral Research Fellowship Program
- Argonne National Laboratory (DE-AC02-06CH11357)
- Q-NEXT
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- quantum error mitigation, parity check, ancilla qubits, Clifford circuits, variational quantum algorithms, single-qubit rotations, quantum circuit fidelity
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review