Probabilistic Error Cancellation (PEC) aims to improve the accuracy of expectation values for observables. This is accomplished using the probabilistic insertion of recovery gates, which correspond to the inverse of errors. However, the inserted recovery gates also induce errors. Thus, it is difficult to obtain accurate expectation values with PEC since the estimator of PEC has a bias due to noise induced by recovery gates. To address this challenge, we propose an improved version of PEC that considers the noise resulting from gate insertion, called Feed-Forward PEC (FFPEC). FFPEC provides an unbiased estimator of expectation values by cancelling out the noise induced by recovery gates. We demonstrate that FFPEC yields more accurate expectation values compared to the conventional PEC method through analytical evaluations. Numerical experiments are used to evaluate analytical results.
Probabilistic error cancellation (PEC) is a leading quantum error mitigation method that provides an unbiased estimate, although it is known to have a large sampling overhead. In this work, we propose a new method to perform PEC, which results in a lower sampling cost than the standard way. It works by decomposing the inverse channel of each gate or each circuit layer into the identity part and the non-identity part and reorganizing the full circuit as different powers of the inverse generator. The ideal circuit becomes a linear combination of noisy circuits with different weights where shots are deterministically allocated to each circuit based on its weight. This naturally sets the achievable bias given a finite amount of shots. As the number of shots is increased, smaller bias terms can be gradually resolved and become bias-free in the limit of sufficient shots. We show the saving both analytically and numerically over the standard PEC and identify situations where it can outperform heuristic approach, such as zero-noise extrapolation, due to the well-controlled bias. We also demonstrated this method experimentally and found excellent agreement between the mitigated and the ideal values.
In this article, we investigate the stability of probabilistic error cancellation (PEC) outcomes in the presence of nonstationary noise, which is an obstacle to achieving accurate observable estimates. Leveraging Bayesian methods, we design a strategy to enhance PEC stability and accuracy. Our experiments using a five-qubit implementation of the Bernstein–Vazirani algorithm and conducted on the ibm_kolkata device reveal a 42% improvement in accuracy and a 60% enhancement in stability compared to nonadaptive PEC. These results underscore the importance of adaptive estimation processes to effectively address nonstationary noise, vital for advancing PEC utility.
We propose a general framework for quantum error mitigation that combines and generalizes two techniques: probabilistic error cancellation (PEC) and zero-noise extrapolation (ZNE). Similar to PEC, the proposed method represents ideal operations as linear combinations of noisy operations that are implementable on hardware. However, instead of assuming a fixed level of hardware noise, we extend the set of implementable operations by noise scaling. By construction, this method encompasses both PEC and ZNE as particular cases and allows us to investigate a larger set of hybrid techniques. For example, gate extrapolation can be used to implement PEC without requiring knowledge of the device's noise model, e.g., avoiding gate-set tomography. Alternatively, probabilistic error reduction can be used to estimate expectation values at intermediate virtual noise strengths (below the hardware level), leading to partially mitigated results at a lower sampling cost. Moreover, multiple results obtained with different noise-reduction factors can be further postprocessed with ZNE to better approximate the zero-noise limit.
Probabilistic error cancellation (PEC) is unbiased but suffers exponential sampling overhead set by noise-weighted circuit volume, whereas quantum error-detecting codes (QEDCs) remove many physical faults by stabilizer post-selection but leave an undetectable logical residue. We exploit this complementarity by using post-selection to map physical noise to a weaker accepted logical channel, and then applying PEC only to the residual channel. The resulting feedback-free QED+PEC scheme interleaves Clifford logical blocks, stabilizer measurements, post-selection, and probabilistic cancellation on accepted trajectories, without real-time decoding or active recovery. A key complication is that post-selection correlates accepted fault branches through stabilizer-commutation constraints, so the sparse Pauli-Lindblad factorization underlying bare PEC no longer applies directly. We therefore construct the inverse channel perturbatively: for fixed order
K, only accepted fault branches up to order
K are retained, reducing preprocessing from
2m branches to
O(mK) per block. The order-
K protocol cancels the normalized post-selected channel through degree
K, leaving a per-block error
O(WK+1) that accumulates at most linearly. For logical GHZ-state preparation with the
[[n,n−2,2]] Iceberg code under circuit-level depolarizing noise and ideal stabilizer measurements, first-order QED+PEC reaches
n=200 physical qubits and lowers sampling overhead by three to four orders of magnitude relative to standard PEC while maintaining
F≃0.956. Syndrome-noise tests show that readout-only flips mainly increase post-selection cost, whereas noisy GHZ-assisted global stabilizer extraction can remove the advantage. This identifies a discrete-Zeno trade-off: cheap detection reshapes the effective channel PEC must invert, rather than simply adding overhead.
Probabilistic error cancellation (PEC) is a technique that generates error-mitigated estimates of expectation values from ensembles of quantum circuits. In this work we extend the application of PEC from unitary-only circuits to dynamic circuits with midcircuit measurements and classically controlled (feedforward) Clifford operations. Our approach extends the sparse Pauli-Lindblad noise model from characterizing gates to characterizing target channels containing midcircuit measurements and feedforward while accounting for nonlocal measurement crosstalk in superconducting processors. Our mitigation and monitoring experiments provide a holistic view for the performance of the protocols developed in this work. These capabilities will be a crucial tool in the exploration of near-term dynamic circuit applications.
We show that combining quantum error detection (QED) with probabilistic error cancellation (PEC) gives more accurate and lower-variance estimates than PEC alone, provided that the symmetry measurements required for QED are carefully chosen. Because noisy symmetry measurements can negate the benefits of the PEC+QED approach, we cast the selection of measurement configurations as a classical optimization problem that systematically suppresses the impact of noise. Applying optimized PEC+QED to GHZ-state output distributions and to simulating the time-dynamics of a generalized superfast encoded Fermi-Hubbard model, we find consistent improvements over PEC. For GHZ states, the optimization over symmetry measurement configurations is essential for achieving an advantage. For the Fermi-Hubbard model, PEC+QED improves observable estimation on a
2×2 lattice and for larger systems the mitigation overheads can be reduced by measuring only subsets of stabilizers. Our results demonstrate the importance of circuit-specific tailoring of QEM techniques and that fault-tolerant design principles may already provide value for near-term devices.