Reducing errors is essential for reliable quantum computation. Quantum error mitigation (QEM) and quantum error correction (QEC) are two leading approaches for this task, each with challenges: QEM suffers from high sampling costs and cannot recover states, while QEC incurs large qubit and gate overheads. We combine ideas from both and introduce an information-theoretic device called a quantum filter that can purify or correct quantum channels. We present an explicit construction capable of correcting arbitrary noise in an n-qubit Clifford circuit using 2n ancillary qubits through a commutation-derived error-detection circuit. This scheme can also partially purify noise in non-Clifford gates such as T and CCZ. Unlike QEC, it achieves deterministic error reduction without encoding the input state. Under the assumption of clean ancillas, it overcomes the exponential sampling overhead in QEM using a single query to the channel. We also propose an ancilla-efficient Pauli filter that removes nearly all low-weight erroneous Pauli components in noisy Clifford circuits using only two ancillas. For local depolarizing noise, it achieves a quadratic reduction in average infidelity. Beyond existing QEM methods, our approach enables systematic error correction as the infidelity can be exponentially reduced with each added ancilla. Through numerical simulations under ancilla noise, we identify regimes where quantum filters outperform other techniques, demonstrating their effectiveness as a scalable error-reduction tool for quantum information processing.
Reducing errors is essential for reliable quantum computation. Quantum error mitigation (QEM) and quantum error correction (QEC) are two leading approaches for this task, each with challenges: QEM suffers from high sampling costs and cannot recover states, while QEC incurs large qubit and gate overheads. We combine ideas from both and introduce an information-theoretic device called a quantum filter that can purify or correct quantum channels. We present an explicit construction capable of correcting arbitrary noise in an n-qubit Clifford circuit using 2n ancillary qubits through a commutation-derived error-detection circuit. This scheme can also partially purify noise in non-Clifford gates such as T and CCZ. Unlike QEC, it achieves deterministic error reduction without encoding the input state. Under the assumption of clean ancillas, it overcomes the exponential sampling overhead in QEM using a single query to the channel. We also propose an ancilla-efficient Pauli filter that removes nearly all low-weight erroneous Pauli components in noisy Clifford circuits using only two ancillas. For local depolarizing noise, it achieves a quadratic reduction in average infidelity. Beyond existing QEM methods, our approach enables systematic error correction as the infidelity can be exponentially reduced with each added ancilla. Through numerical simulations under ancilla noise, we identify regimes where quantum filters outperform other techniques, demonstrating their effectiveness as a scalable error-reduction tool for quantum information processing.
Symmetry inherent in quantum states has been widely used to reduce the effect of noise in quantum error correction and a quantum error-mitigation technique known as symmetry verification. However, these symmetry-based techniques exploit symmetry in quantum rather than quantum , limiting their application to cases where the entire circuit shares the same symmetry. In this work, we propose symmetric channel verification (SCV), a channel purification protocol that leverages the symmetry inherent in quantum channels. By introducing different phases to each symmetric subspace and employing a quantum phase estimation-like circuit, SCV can detect and correct symmetry-breaking noise in quantum channels. We further propose a hardware-efficient implementation of SCV at the virtual level, which requires only a single-qubit ancilla and is robust against the noise in the ancilla qubit. Our protocol is applied to various Hamiltonian simulation circuits and phase estimation circuits, resulting in a significant reduction of errors. Furthermore, in setups where only Clifford unitaries can be used for noise purification, which is relevant in the early fault-tolerant regime, we show that SCV under Pauli symmetry represents the optimal purification method.
We propose a Clifford noise reduction (CliNR) scheme that provides a reduction of the logical error rate of Clifford circuit with lower overhead than error correction and without the exponential sampling overhead of error mitigation. CliNR implements Clifford circuits by splitting them into subcircuits that are performed using gate teleportation. A few random stabilizer measurements are used to detect errors in the resources states consumed by the gate teleportation. This can be seen as a teleported version of the coherent parity-check scheme [1-3], with offline fault-detection making it scalable. We prove that CliNR achieves a vanishing logical error rate for families of n-qubit Clifford circuits with size s such that nsp^{2} goes to 0, where p is the physical error rate, meaning that it reaches the regime ns=o(1/p^{2}), whereas the direct implementation is limited to s=o(1/p). Moreover, CliNR uses only 3n+1 qubits, 2s+o(s) gates and has zero rejection rate. This small overhead makes it more practical than quantum error correction in the near term and our numerical simulations show that CliNR provides a reduction of the logical error rate in relevant noise regimes.
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.
Quantum error correction physically removes errors from a quantum state, while quantum error mitigation improves observable estimates by processing noisy measurement data. We introduce \emph{purification quantum error suppression} (PQES), a hybrid approach that uses multiple noisy copies of an unknown state to combine these two ideas. The protocol uses SWAP tests to physically reduce errors by purification, while the full outcome record is used to combine all branches without postselection. In this way, PQES avoids the fixed-success-outcome requirement of standard SWAP-test purification while still accessing the power-purified state ρN. The SWAP identities allow purification steps to be interleaved with unitary circuit blocks, so errors can be suppressed during a computation rather than only at the final measurement. We provide both a parallel binary-tree implementation and a more compact register-recycled implementation using O(Mℓ) coherent data qubits for an M-qubit register and N=2ℓ input copies. We analyze the resulting error thresholds under representative noise models. For local depolarizing noise on the product-state family studied here, the threshold is pth=3/4 for any register size, while local dephasing of ∣+⟩⊗M has a threshold of pth=1/2. Local Clifford twirling can be used to convert dephasing into a depolarization channel and restore the higher threshold.
Quantum error mitigation (QEM) is critical for extracting reliable computations from noisy quantum processors, proving itself essential not only in the near term but also as a valuable supplement to fully fault-tolerant systems in the future. Despite the necessity, practical QEM deployment still confronts challenges, including the excessive cost of sampling quantum circuits and reliance on unrealistic assumptions such as gate-independent noise. In this paper, we propose Classical Noise Inversion (CNI), which shifts the QEM from sampling diverse quantum circuits to repeated single-circuit measurement, a drastic cost reduction given that the former incurs far heavier time overhead than the latter on realistic quantum hardware. We target general noise models and establish critical conditions for their classical tractability, under which CNI remains effective. For noise models that violate the condition, we propose partial CNI, which mitigates the classically tractable factor of noise via CNI and mitigates the other part via probabilistic error cancellation tailored to gate-dependent noise. To minimize the sampling overhead, we introduce noise compression, which groups noise components with equivalent effects on measurement outcomes, thereby attaining theoretically optimal error-mitigation overhead. The proposed protocols are particularly efficient for error-propagatable circuits, including adaptive universal quantum computing represented by Clifford+T fault-tolerant circuits, and generalized measurement represented by classical shadows. To demonstrate the practical merits of CNI, we integrate it with thrifty classical shadow, and use analysis and numerical simulations to show its advantages in both efficiency and accuracy over existing approaches.
Quantum error mitigation (QEM) is typically viewed as a suite of practical techniques for today's noisy intermediate-scale quantum devices, with limited relevance once fault-tolerant quantum computers become available. In this work, we challenge this conventional wisdom by showing that QEM can continue to provide substantial benefits in the era of quantum error correction (QEC), and in an even more efficient manner than it does on current devices. We introduce a framework for logical-level QEM that leverages soft information naturally produced by QEC decoders, requiring no additional data, hardware modifications, or runtime overhead beyond what QEC protocols already provide. Within this framework, we develop and analyze three logical-level QEM techniques: post-selection and runtime abort policies, probabilistic error cancellation, and zero-noise extrapolation. Our techniques reduce logical error rates by more than 100x while discarding fewer than 0.1% of shots; they also provide in situ characterization of logical channels for QEM protocols. As a proof of principle, we benchmark our approach using a surface-code architecture and two state-of-the-art decoders based on tensor-network contraction and minimum-weight perfect matching. We evaluate logical-level QEM on random Clifford circuits and molecular simulation algorithms and find that, compared to previous approaches relying on QEC only or QEC combined with QEM, we can achieve up to 87.4% spacetime overhead savings. Our results demonstrate that logical-level QEM with QEC decoder soft information can reliably improve logical performance, underscoring the efficiency and usefulness of QEM techniques for fault-tolerant quantum computers.