Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Entropy

Information-Theoretic Framework for Quantum State Purification and Error Correction via Symmetric Subspace Projection

Jiaqi Tang, Zhaohui Liao, Mujiangshan Wang

Published Jun 24, 2026• 0 citations
Publisher

Abstract

The severe susceptibility of qubits to environmental noise remains the primary obstacle to practical quantum computing. To overcome this, we introduce a purification-assisted quantum error-correction (QEC) framework that embeds a symmetric subspace projection module between the encoding and physical layers. Acting as an information-theoretic noise-entropy filter, it compresses von Neumann entropy before encoding. Under depolarizing noise, a three-copy scheme elevates the surface-code threshold from 1.1% to a 2.0% noiseless bound (~1.6% at circuit level). Our iterative purification-assisted error-correction (IPEC) algorithm dynamically modulates purification depth via syndrome feedback, delivering a 46-fold logical error reduction for surface codes (d = 7) at a 1.0% physical error rate.

DOI
10.3390/e28070726

Related papers

Investigating Quantum Error Mitigation Strategies in Small-Scale Surface Codes: A Study of Depolarizing Noise Thresholds

Syed Shamikh Iqbal

The issue of error-prone quantum information obstructs the progress of quantum computing, notwithstanding its capacity to transform complex problem-solving. This study examines the impact of depolarizing noise on a 5-qubit, distance-2 surface code, representing a fundamental quantum error correcting (QEC) frame- work. The primary objective is to identify a breakeven error rate beneath which error correction remains effective. We assess logical error rates through simu- lation across different noise levels, identifying a crucial breakeven threshold at around a 10% error rate. Below this level, the surface code exhibits proficient mistake detection; but, beyond this point, the effectiveness of repair diminishes significantly. We examine quantum error mitigation (QEM) techniques such as syndrome amplification and post-selection to evaluate their efficacy in minimiz- ing errors within the threshold range. We also noted spatial connections in error patterns, suggesting possible pathways for focused mistake correction. These find- ings elucidate the functioning of quantum error correction (QEC) in small-scale codes and underscore the necessity for noise-aware QEC techniques in scalable quantum systems.

Journal of Propulsion Technology•Jan 9, 2025•0 citations

Purification and correction of quantum channels by commutation-derived quantum filters

Sowmitra Das, Jinzhao Sun, Michael Hanks +2 more

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.

arXiv:2407.20173•Jul 29, 2024•7 citations

Quantum Error Correction: Surface And Topological Codes

N Raji

Quantum error correction (QEC) represents a critical enabler for fault-tolerant quantum computing, protecting fragile quantum states from decoherence and operational errors. This paper provides a comprehensive analysis of leading quantum error correction schemes, focusing on surface codes and topological codes within the context of Noisy Intermediate-Scale Quantum (NISQ) era processors. We examine the theoretical foundations of stabilizer codes, compare surface code implementations with code distances ranging from d=3 to d=17, and analyze topological codes including toric codes and color codes. Our investigation encompasses syndrome extraction circuits, logical qubit encoding strategies, and threshold analysis for contemporary quantum hardware platforms. Performance metrics reveal that surface codes achieve error thresholds of approximately 1% with realistic noise models, while topological codes offer architectural advantages for specific qubit connectivity constraints. We discuss implementation challenges on current NISQ processors including IBM Quantum, Google Sycamore, and IonQ systems, addressing qubit overhead, gate fidelity requirements, and decoding algorithms. This analysis provides insights for selecting appropriate error correction schemes based on application requirements and hardware capabilities.

•Mar 12, 2026•0 citations

Quantum Error Correction by Purification

Jonathan Raghoonanan, Tim Byrnes

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.

•Mar 30, 2026•0 citations

Improved Decoding of Circuit Noise and Fragile Boundaries of Tailored Surface Codes

Oscar Higgott, Thomas C. Bohdanowicz, Aleksander Kubica +2 more

Realizing the full potential of quantum computation requires quantum error correction (QEC), with most recent breakthrough demonstrations of QEC using the surface code.QEC codes use multiple noisy physical qubits to encode information in fewer logical qubits, enabling the identification of errors through a decoding process.This process increases the logical fidelity (or accuracy) making the computation more reliable.However, most fast (efficient run-time) decoders neglect important noise characteristics, thereby reducing their accuracy.In this work, we introduce decoders that are both fast and accurate, and can be used with a wide class of QEC codes including the surface code.Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC.Using the surface code threshold as a performance metric, we observe a threshold at 0.94% error probability for our decoders, outperforming the 0.82% threshold for a standard minimum-weight perfect matching decoder.We also test our belief-matching decoders in a theoretical case study of codes tailored to a biased noise model.We find that the decoders lead to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.Surprisingly, in the wellbelow-threshold regime, the rectangular surface code becomes more resource efficient than the tailored surface code due to a previously unnoticed phenomenon that we call "fragile boundaries."Our decoders outperform all other fast decoders in terms of threshold and accuracy, enabling better results in current quantum-error-correction experiments and opening up new areas for theoretical case studies.

arXiv:2203.04948•Physical Review X•Jul 19, 2023•129 citations

Experimental Quantum Error Correction below the Surface Code Threshold via All-Microwave Leakage Suppression

Tan He, W. W. Lin, Rui Wang +97 more

Quantum error correction (QEC) enables practical quantum computing by encoding logical qubits in many physical qubits, which can exponentially suppress the logical error rate with increasing code size provided that the physical error rate is below a critical threshold. However, the leakage of quantum information from the computational subspace presents a critical challenge to the development of scalable QEC, which creates long-lived, correlated errors that spread across space and time. Here, we demonstrate a quantum memory operating below the threshold by implementing an all-microwave leakage suppression architecture on a distance-7 surface code. We achieve a logical error suppression factor of Λ=1.40(6), definitively reversing the above-threshold scaling (Λ<1) caused by unmitigated leakage. This scheme integrates a hardware-efficient leakage reduction unit for data qubits with a fast, unconditional reset for ancilla qubits, suppressing the average leakage population after 40 cycles by a factor of 72 to 6.4(5)×10^{-4}. Our results demonstrate the viability of all-microwave control architectures for suppressing critical errors at scale, paving the way for more advanced quantum error correction implementations.

Physical Review Letters•Dec 22, 2025•22 citations
The severe susceptibility of qubits to environmental noise remains the primary obstacle to practical quantum computing. To overcome this, we introduce a purification-assisted quantum error-correction (QEC) framework that embeds a symmetric subspace projection module between the encoding and physical layers. Acting as an information-theoretic noise-entropy filter, it compresses von Neumann entropy before encoding. Under depolarizing noise, a three-copy scheme elevates the surface-code threshold from 1.1% to a 2.0% noiseless bound (~1.6% at circuit level). Our iterative purification-assisted error-correction (IPEC) algorithm dynamically modulates purification depth via syndrome feedback, delivering a 46-fold logical error reduction for surface codes (d = 7) at a 1.0% physical error rate.
The issue of error-prone quantum information obstructs the progress of quantum computing, notwithstanding its capacity to transform complex problem-solving. This study examines the impact of depolarizing noise on a 5-qubit, distance-2 surface code, representing a fundamental quantum error correcting (QEC) frame- work. The primary objective is to identify a breakeven error rate beneath which error correction remains effective. We assess logical error rates through simu- lation across different noise levels, identifying a crucial breakeven threshold at around a 10% error rate. Below this level, the surface code exhibits proficient mistake detection; but, beyond this point, the effectiveness of repair diminishes significantly. We examine quantum error mitigation (QEM) techniques such as syndrome amplification and post-selection to evaluate their efficacy in minimiz- ing errors within the threshold range. We also noted spatial connections in error patterns, suggesting possible pathways for focused mistake correction. These find- ings elucidate the functioning of quantum error correction (QEC) in small-scale codes and underscore the necessity for noise-aware QEC techniques in scalable quantum systems.
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.
Quantum error correction (QEC) represents a critical enabler for fault-tolerant quantum computing, protecting fragile quantum states from decoherence and operational errors. This paper provides a comprehensive analysis of leading quantum error correction schemes, focusing on surface codes and topological codes within the context of Noisy Intermediate-Scale Quantum (NISQ) era processors. We examine the theoretical foundations of stabilizer codes, compare surface code implementations with code distances ranging from d=3 to d=17, and analyze topological codes including toric codes and color codes. Our investigation encompasses syndrome extraction circuits, logical qubit encoding strategies, and threshold analysis for contemporary quantum hardware platforms. Performance metrics reveal that surface codes achieve error thresholds of approximately 1% with realistic noise models, while topological codes offer architectural advantages for specific qubit connectivity constraints. We discuss implementation challenges on current NISQ processors including IBM Quantum, Google Sycamore, and IonQ systems, addressing qubit overhead, gate fidelity requirements, and decoding algorithms. This analysis provides insights for selecting appropriate error correction schemes based on application requirements and hardware capabilities.
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.
Realizing the full potential of quantum computation requires quantum error correction (QEC), with most recent breakthrough demonstrations of QEC using the surface code.QEC codes use multiple noisy physical qubits to encode information in fewer logical qubits, enabling the identification of errors through a decoding process.This process increases the logical fidelity (or accuracy) making the computation more reliable.However, most fast (efficient run-time) decoders neglect important noise characteristics, thereby reducing their accuracy.In this work, we introduce decoders that are both fast and accurate, and can be used with a wide class of QEC codes including the surface code.Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC.Using the surface code threshold as a performance metric, we observe a threshold at 0.94% error probability for our decoders, outperforming the 0.82% threshold for a standard minimum-weight perfect matching decoder.We also test our belief-matching decoders in a theoretical case study of codes tailored to a biased noise model.We find that the decoders lead to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.Surprisingly, in the wellbelow-threshold regime, the rectangular surface code becomes more resource efficient than the tailored surface code due to a previously unnoticed phenomenon that we call "fragile boundaries."Our decoders outperform all other fast decoders in terms of threshold and accuracy, enabling better results in current quantum-error-correction experiments and opening up new areas for theoretical case studies.
Quantum error correction (QEC) enables practical quantum computing by encoding logical qubits in many physical qubits, which can exponentially suppress the logical error rate with increasing code size provided that the physical error rate is below a critical threshold. However, the leakage of quantum information from the computational subspace presents a critical challenge to the development of scalable QEC, which creates long-lived, correlated errors that spread across space and time. Here, we demonstrate a quantum memory operating below the threshold by implementing an all-microwave leakage suppression architecture on a distance-7 surface code. We achieve a logical error suppression factor of Λ=1.40(6), definitively reversing the above-threshold scaling (Λ<1) caused by unmitigated leakage. This scheme integrates a hardware-efficient leakage reduction unit for data qubits with a fast, unconditional reset for ancilla qubits, suppressing the average leakage population after 40 cycles by a factor of 72 to 6.4(5)×10^{-4}. Our results demonstrate the viability of all-microwave control architectures for suppressing critical errors at scale, paving the way for more advanced quantum error correction implementations.