The extreme sensitivity of qubits to environmental noise constitutes the central bottleneck impeding the practical deployment of near-term quantum computing. Quantum error correction suppresses physical errors by encoding logical qubits into redundant physical qubits, yet its corrective gain deteriorates sharply when physical error rates approach the fault-tolerant threshold. This paper proposes a purification-assisted quantum error correction framework that systematically embeds a purification preprocessing module between the encoding layer and the physical layer, founded on the permutation symmetry of multiple noisy state copies. From an information-theoretic perspective, this framework treats the purification process as an entropy reduction mechanism that filters noise entropy from quantum states, concentrating quantum information into lower-entropy subspaces and achieving entropy suppression before downstream error correction processing. By projecting the joint state of identical copies onto the symmetric subspace, the module achieves noise entropy filtering, thereby concentrating quantum information and exponentially compressing the effective physical error rate before it enters the error-correcting code, establishing a compound exponential logical error rate suppression mechanism under ideal assumptions. Analytical derivations under depolarizing noise yield closed-form expressions for the purification fidelity and the enhanced equivalent fault-tolerant threshold, demonstrating that purification with three copies elevates the surface code threshold from approximately 1.1% to approximately 2.0%. Building on this framework, an Iterative Purification-assisted Error Correction (IPEC) algorithm is designed, which dynamically adjusts the purification depth via real-time syndrome feedback to achieve an adaptive balance between fidelity gain and resource consumption. Monte Carlo simulations under both independent depolarizing noise and circuit-level noise models validate the theoretical predictions: the IPEC algorithm reduces the logical error rate by approximately 46-fold at code distance 7 with a physical error rate of 1.0%, achieves an approximately 8-fold improvement on quantum LDPC codes, and maintains robust performance in non-stationary noise environments through its adaptive mechanism. From an entropy-theoretic perspective, the proposed framework constitutes an entropy management mechanism for quantum computation, in which the purification process compresses state entropy at the input stage and error correction maintains the low-entropy condition during computation, together forming a closed-loop entropy flow control system.
The extreme sensitivity of qubits to environmental noise constitutes the central bottleneck impeding the practical deployment of near-term quantum computing. Quantum error correction suppresses physical errors by encoding logical qubits into redundant physical qubits, yet its corrective gain deteriorates sharply when physical error rates approach the fault-tolerant threshold. This paper proposes a purification-assisted quantum error correction framework that systematically embeds a purification preprocessing module between the encoding layer and the physical layer, founded on the permutation symmetry of multiple noisy state copies. From an information-theoretic perspective, this framework treats the purification process as an entropy reduction mechanism that filters noise entropy from quantum states, concentrating quantum information into lower-entropy subspaces and achieving entropy suppression before downstream error correction processing. By projecting the joint state of identical copies onto the symmetric subspace, the module achieves noise entropy filtering, thereby concentrating quantum information and exponentially compressing the effective physical error rate before it enters the error-correcting code, establishing a compound exponential logical error rate suppression mechanism under ideal assumptions. Analytical derivations under depolarizing noise yield closed-form expressions for the purification fidelity and the enhanced equivalent fault-tolerant threshold, demonstrating that purification with three copies elevates the surface code threshold from approximately 1.1% to approximately 2.0%. Building on this framework, an Iterative Purification-assisted Error Correction (IPEC) algorithm is designed, which dynamically adjusts the purification depth via real-time syndrome feedback to achieve an adaptive balance between fidelity gain and resource consumption. Monte Carlo simulations under both independent depolarizing noise and circuit-level noise models validate the theoretical predictions: the IPEC algorithm reduces the logical error rate by approximately 46-fold at code distance 7 with a physical error rate of 1.0%, achieves an approximately 8-fold improvement on quantum LDPC codes, and maintains robust performance in non-stationary noise environments through its adaptive mechanism. From an entropy-theoretic perspective, the proposed framework constitutes an entropy management mechanism for quantum computation, in which the purification process compresses state entropy at the input stage and error correction maintains the low-entropy condition during computation, together forming a closed-loop entropy flow control system.
Abstract We present a general-purpose quantum error correction primitive based on state purification via the SWAP test, which we refer to as purification quantum error correction (PQEC). This method operates on N noisy copies, requires minimally O(Mlog 2 N) data qubits to process the M-qubit inputs. In a similar way to standard QEC, the purification steps may be interleaved within a quantum algorithm to suppress the logical error rate. No postselection is performed and no knowledge of the state is required. We analyze its performance under a variety of error channels and find that PQEC is highly effective at boosting fidelity and reducing logical error rates, particularly for the depolarizing channel. Error thresholds for the local depolarizing channel are found to be 75% for any register size. For local dephasing, the error threshold is reduced to 50% but may be boosted using twirling.
We present a general framework for applying linear quantum error mitigation (QEM) techniques directly to physical qubits within a logical qubit to suppress logical errors. By exploiting the linearity of quantum error correction (QEC), we demonstrate that any linear QEM method$\unicode{x2014}$including probabilistic error cancellation (PEC), zero-noise extrapolation (ZNE), and symmetry verification$\unicode{x2014}$can be integrated into the physical layer without requiring modifications to the subsequent QEC decoder. Applying this framework to memory experiments using PEC, we analytically prove and numerically verify that the leading-order contribution to the logical error can be removed, increasing the effective code distance by 2. Our simulations on repetition and rotated surface codes show that a distance-3 code with physical-level PEC achieves logical error rates lower than or similar to a distance-5 unmitigated code while using 40% and 64% fewer qubits, respectively. These results establish physical-level QEM as a widely compatible and resource-efficient strategy for enhancing logical performance in early fault-tolerant architectures.
Quantum thermodynamics and quantum information theory are often developed as neighboring subjects: the former studies energy, heat, work, irreversibility, and fluctuations in quantum systems, while the latter studies the representation, transmission, manipulation, and protection of information in quantum states. For fault-tolerant quantum technologies, however, the separation is artificial. A quantum memory or processor is an open, controlled, and dissipative information-processing system whose logical degrees of freedom are maintained against noise by repeated syndrome extraction, feedback, dissipation, and reset. This article develops a unifying framework in which quantum error correction (QEC) is interpreted as the stabilization of an emergent informational order in a driven nonequilibrium quantum system. The framework is organized around five common mathematical structures: density operators and quantum channels; relative entropy and nonequilibrium free energy; Gorini–Kossakowski–Lindblad–Sudarshan (GKLS) dynamics and entropy production; code subspaces, syndromes, and recovery channels; and Liouvillian spectral structure, metastability, and criticality. We show how active QEC can be viewed as an entropy-pumping cycle that transfers noise-generated uncertainty from protected degrees of freedom into syndrome and controller degrees of freedom, whose reuse requires thermodynamic reset. Continuous and autonomous QEC are formulated as competition between natural noise and engineered dissipative generators, yielding stationary or periodic nonequilibrium states with nonvanishing microscopic currents even when logical observables are approximately stationary. Complexity is introduced from the outset through multiscale organization, predictive coarse-graining, information dynamics, and spectral separation; these concepts distinguish structured persistence from entropy reduction alone. At the level of a conceptual synthesis, this perspective relates model-specific fault-tolerance thresholds to critical phenomena, logical subspaces with slow emergent manifolds, syndrome decoding with stochastic inference, and engineered dissipation with self-organization. We finally propose a thermodynamic-complexity description of QEC in terms of logical error rate, entropy-production rate, Liouvillian gap, information flow, and control power. The resulting framework provides a common language for quantum thermodynamics, nonequilibrium statistical mechanics, complexity science, and quantum information and identifies concrete questions for thermodynamically efficient fault-tolerant quantum architectures.
Quantum state purification is the functionality that, given multiple copies of an unknown state, outputs a state with increased purity. This will be an essential building block for near- and middle-term quantum ecosystems before the availability of full fault tolerance, where one may want to suppress errors not only in expectation values but also in quantum states. We propose an effective state purification gadget with a moderate quantum overhead by projecting M noisy quantum inputs to their symmetric subspace defined by a set of projectors forming a symmetric subgroup with order M. Our method, applied in every short evolution over M redundant copies of noisy states, can suppress both coherent and stochastic errors by a factor of 1/M, respectively. This reduces the circuit implementation cost M times smaller than the state projection to the full symmetric subspace proposed by Barenco et al. more than two decades ago. We also show that our gadget purifies the depolarised inputs with probability p to asymptotically O(p2) with an optimal choice of M when p is small. The sampling cost scales O(p−1) for small p, which is also shown to be asymptotically optimal. Our method provides flexible choices of state purification depending on the hardware restrictions before fully fault-tolerant computation is available.
Recent constructions of quantum low-density parity-check (QLDPC) codes provide optimal scaling of the number of logical qubits and the minimum distance in terms of the code length, thereby opening the door to fault-tolerant quantum systems with minimal resource overhead. However, the hardware path from nearest-neighbor-connection-based topological codes to long-range-interaction-demanding QLDPC codes is likely a challenging one. Given the practical difficulty in building a monolithic architecture for quantum systems, such as computers, based on optimal QLDPC codes, it is worth considering a distributed implementation of such codes over a network of interconnected medium-sized quantum processors. In such a setting, all syndrome measurements and logical operations must be performed through the use of high-fidelity shared entangled states between the processing nodes. Since probabilistic many-to-1 distillation schemes for purifying entanglement are inefficient, we investigate quantum error correction based entanglement purification in this work. Specifically, we employ QLDPC codes to distill GHZ states, as the resulting high-fidelity logical GHZ states can interact directly with the code used to perform distributed quantum computing (DQC), e.g. for fault-tolerant Steane syndrome extraction. This protocol is applicable beyond the application of DQC since entanglement distribution and purification is a quintessential task of any quantum network. We use the min-sum algorithm (MSA) based iterative decoder with a sequential schedule for distilling 3 -qubit GHZ states using a rate 0.118 family of lifted product QLDPC codes and obtain an input fidelity threshold of ≈0.7974 under i.i.d. single-qubit depolarizing noise. This represents the best threshold for a yield of 0.118 for any GHZ purification protocol. Our results apply to larger size GHZ states as well, where we extend our technical result about a measurement property of 3 -qubit GHZ states to construct a scalable GHZ purification protocol.
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.