Reducing Quantum Error Mitigation Bias Using Verifiable Benchmark Circuits

• URL: http://arxiv.org/abs/2603.10224v1
• Date: Tue, 10 Mar 2026 20:51:30 GMT
• Title: Reducing Quantum Error Mitigation Bias Using Verifiable Benchmark Circuits
• Abstract summary: We present a simple, malleable and low-overhead approach for improving generic biased quantum error mitigation methods.<n>We achieve up to 15% fidelity improvements over standard QEM on 100-qubit circuits with up to 2000 entangling gates.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a simple, malleable and low-overhead approach for improving generic biased quantum error mitigation (QEM) methods, achieving up to 15% fidelity improvements over standard QEM on 100-qubit circuits with up to 2000 entangling gates. We do so by constructing verifiable benchmark circuits which mirror the application circuit's native-gate structure and thus noise profile. These circuits can be used to benchmark and mitigate the bias of the underlying error mitigation method, requiring only the application circuit and hardware native gate set. We present two methods for generating benchmark circuits; one is agnostic to the target hardware at the expense of a small overhead of single-qubit gates, while the other is specific to the IBM superconducting hardware and has no gate overhead. As a corollary, we introduce benchmarked-noise zero-noise extrapolation (bnZNE) as a simple adaptation of zero-noise extrapolation (ZNE), one of the most popular error mitigation methods. We consider as an example the bias-mitigated ZNE and bnZNE of Trotterized Hamiltonian simulations, observing that our approaches outperform standard ZNE using both small-scale classical simulations and 100-qubit utility-scale experiments on the IBM superconducting hardware. We consider the measurement of both single-site observables as well as two-site correlations along a one-dimensional qubit chain. We also provide a software package for implementing the error mitigation techniques used in this research.

Related papers

• Verifiable quantum advantage in extremely low depth [52.51019642214249]
  We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
  arXiv  Detail & Related papers  (2026-09-01T15:54:34Z)
• The Gain-Engineered Transmon [68.89136228609398]
  We introduce and experimentally realize a noise-biased qubit in a standard transmon-readout resonator circuit.<n>Our results open a path towards using this system as a simple building-block for hardware-efficient quantum error detection and correction schemes.
  arXiv  Detail & Related papers  (2026-08-26T17:00:42Z)
• Efficient Quantum Error Mitigation for Unitary k-Designs [0.0]
  noisy hardware makes quantum circuits prone to a myriad of error sources.<n>We use unitary k-design Pauli support distributions to estimate circuit-wide depolarization.<n>We show that the method effectively reduces gate-based error for unitary k-designs without incurring any two-qubit gate overhead.
  arXiv  Detail & Related papers  (2026-06-02T16:52:08Z)
• Zero-Noise Extrapolation via Cyclic Permutations of Quantum Circuit Layouts [0.0]
  We propose a Cyclic Layout Permutations based Zero Noise Extrapolation (CLP-ZNE) protocol for such a task.<n>The method exploits symmetries of quantum circuits with one-dimensional connectivity to extrapolate the expectation value, averaged over cyclic circuit layout permutations, to the level of zero noise.<n>When benchmarked against noise channels modeling the IBM Torino quantum computer, the method reduces a typical expectation value error by an order of magnitude depending on the protocol specifications.
  arXiv  Detail & Related papers  (2025-11-04T19:00:00Z)
• A Useful Metric for the NISQ Era: Qubit Error Probability and Its Role in Zero Noise Extrapolation [0.0]
  We propose the qubit error probability (QEP), a device specific metric that combines relaxation, dephasing, gate, and measurement contributions into a single per qubit figure of merit computable before execution.<n>In regimes where the raw circuits exhibit a finite mean QEP, the method suppresses observable errors beyond those attainable with circuit depth scaled ZNE.<n>These results demonstrate that QEP serves as a transparent and efficient error metric, and that its integration into ZNE provides a practical route to reliability gains on current superconducting hardware.
  arXiv  Detail & Related papers  (2025-03-13T09:42:03Z)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• Application-Aware Benchmarking on NISQ Hardware using Expectation Value Fidelities [0.0]
  We present a low-cost protocol for benchmarking applications on generic quantum hardware in the circuit model.<n>We consider the specific example of simulating a kicked-Ising model on superconducting hardware, showing our benchmark to be more accurate than predictions which use the gate error data.
  arXiv  Detail & Related papers  (2024-10-02T12:57:18Z)
• Robust ultra-shallow shadows [0.251657752676152]
  We present a robust shadow estimation protocol for wide classes of low-depth measurement circuits.<n>For weakly-correlated local noise, the measurement channel has an efficient matrix-product representation.<n>We show how to estimate this directly from experimental data using tensor-network tools.
  arXiv  Detail & Related papers  (2024-05-09T18:00:09Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Witnessing entanglement in trapped-ion quantum error correction under realistic noise [41.94295877935867]
  Quantum Error Correction (QEC) exploits redundancy by encoding logical information into multiple physical qubits. We present a detailed microscopic error model to estimate the average gate infidelity of two-qubit light-shift gates used in trapped-ion platforms. We then apply this realistic error model to quantify the multipartite entanglement generated by circuits that act as QEC building blocks.
  arXiv  Detail & Related papers  (2022-12-14T20:00:36Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.