Zlatko K. Minev

Preprint · 2026

Measure Now, Mitigate Later: Virtual Error Cancellation for Logical Quantum Circuits

Oles Shtanko, Saswata Roy, Shashwat Kumar, Zlatko Minev

An error-corrected circuit already records information about its errors in its syndromes. Virtual error cancellation uses only that record, in classical post-processing, to remove the bias left by residual logical errors: no separate noise-characterization experiments and no change to the circuit, at the price of extra sampling. In numerical simulations of a distance-7 rotated surface code, a dual-decoder version can reach more than three orders of magnitude of suppression relative to the decoded logical error rate, in an experimentally achievable setting.

Scope. Numerical study (simulations of a distance-7 surface code); a hardware demonstration is future work.

Figure 1. An error-corrected circuit runs unmodified and stores its syndrome record (a). After the run, the record…
Figure 1. An error-corrected circuit runs unmodified and stores its syndrome record (a). After the run, the record alone is used to learn the noise (b), compare an offline decoder against the real-time one (c), and reweight shots so the residual logical bias cancels (d), at a sampling cost that grows far more slowly than probabilistic error cancellation (e).
Abstract

Early fault-tolerant quantum algorithms are a key step in scalable quantum computing, but are ultimately constrained by residual, uncorrectable logical errors. Logical quantum error mitigation can eliminate this bias, however its standard requirements include prior noise characterization, more complex experiments, and substantial sampling overhead. Although no mitigation technique can simultaneously overcome all three constraints, we demonstrate that the first two---noise learning and need for modified circuits---can be completely bypassed for logical circuits by leveraging only syndrome records. Specifically, we introduce virtual error cancellation: a method that, unlike previous bias-free approaches, operates entirely in classical post-processing on universal quantum circuits. We develop and numerically test end-to-end protocols that reduce the sampling overhead beyond fundamental limitations of existing syndrome-aware mitigation techniques, including syndrome-based postselection. In particular, we propose a scheme that pairs the low-latency decoder used in the experiment with a high-complexity decoder run in post-processing. In numerical simulations of a distance-7 rotated surface code, we show that our full-stack dual-decoder algorithm exhibits an error that diminishes as the number of samples increases, capable of reaching more than three orders of magnitude of suppression compared to the decoded logical error rate in an experimentally achievable setting. These results establish syndrome records as a resource for correcting universal computational estimates after quantum execution.

The conversation

The explainer posts I wrote about this paper, in order.