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

arXiv:2603.25774

Catalytic Quantum Error Correction: Theory, Efficient Catalyst Preparation, and Numerical Benchmarks

Hikaru Wakaura, Taiki Tanimae

quant-phSubmitted Mar 26, 2026• Announced Mar 27, 2026• 0 citations• Revised May 8, 2026 (v5)
v1 · Mar 26, 2026v2 · Mar 31, 2026v3 · Apr 6, 2026v4 · Apr 13, 2026v5 · May 8, 2026v6 · Jul 31, 2026
arXivHTMLPDF

Abstract

Quantum computers promise transformative speedups, but environmental noise destroys their fragile states. Conventional quantum error correction (QEC) encodes information redundantly across physical qubits, yet fails above a threshold of about $1\%$ and incurs polynomial qubit overhead. A recent theorem [Shiraishi2024] from the resource theory of coherence shows that catalytic covariant operations amplify coherence at an unbounded rate, but this result has never been cast as an operational protocol. The challenge is to turn an asymptotic theorem into a recovery scheme that works at any noise strength with realistic resources. Here we show that catalytic coherence amplification can be cast as an error-correction primitive, Catalytic Quantum Error Correction (CQEC), which recovers a known target state from noisy copies without any error \emph{magnitude} threshold whenever the target's coherent modes are preserved. Whereas existing QEC degrades above its threshold, CQEC maintains $F > 0.999$ across 200~configurations spanning $d = 4$--$64$, and the impractical $n^{*} \sim d^{4} e^{2γ}$ copy requirement is reduced by nine orders of magnitude via a three-stage pipeline combining CPMG dynamical decoupling, Clifford twirling, and recursive swap-test purification, yielding $F_\mathrm{cat} > 0.96$ from only eight noisy copies. These results turn an abstract resource-theoretic statement into a concrete tool complementary to stabilizer- and purification-based QEC. By replacing a quantitative threshold with a qualitative condition on the support of coherence, CQEC enables ancillary modules within surface-coded processors to be repaired far beyond the conventional threshold; an open-source package reproducing all results in $\sim$30\,s accompanies this work (arXiv:2603.25774, https://github.com/deeptell-inc/cqec).

Related papers

Blind Catalytic Quantum Error Correction: Target-State Estimation and Fidelity Recovery Without A Priori Knowledge

Hikaru Wakaura

Catalytic quantum error correction (CQEC) amplifies residual coherence with a reusable catalyst, giving threshold-free recovery whenever the target coherent modes survive in the noisy state; its original protocol, however, requires complete knowledge of the ideal target, which fails for variational and iterative algorithms whose output is unknown to the correction module. Here we show that this requirement can be removed by estimating the target from the noisy output alone, in a two-stage protocol we call blind CQEC. At the density-matrix level studied here the recovery map is the mode-inclusion-restricted projection of the estimate, so recovery fidelity obeys F_rec >= 1 - 2||rho_est - rho_target||_1 - 2 Delta_mode: the design of blind CQEC reduces to a classical estimation problem under a recovery ceiling set by mode survival. We benchmark five estimation strategies across three noise channels, four quantum algorithms (d = 4-64), Haar-random states, and mixed targets, assuming oracle access to the noisy density matrix. With exactly calibrated noise, channel inversion coincides with the oracle and both are capped by the mode-survival ceiling (F_rec = 0.77 at d = 64 with the 10^-10 mode threshold); noise-model-free coherence maximization matches the ceiling to within 1.5% at d <= 16; the choice between them is set by calibration accuracy, with the dephasing rate exponentially dominant. Unlike error-mitigation methods, blind CQEC returns the state itself rather than corrected expectation values. A noisy-VQE demonstration for H2 yields a 3.4x energy-error reduction. These results chart the estimator design space for blind, threshold-free recovery and identify the two open problems, an operational measurement model and a circuit-level catalytic map, that remain before deployment.

quant-pharXiv:2604.11857•Apr 14, 2026•0 citations

Demonstrating Noise-adapted Quantum Error Correction With Break-Even Performance

Vismay Joshi, Anubhab Rudra, Sourav Dutta +2 more

The promise of quantum computing is closer to reality today than ever before, thanks to rapid progress in the development of quantum hardware. Even as qubit lifetimes and gate fidelities continue to improve, realizing robust, fault-tolerant quantum computers is contingent upon the successful implementation of quantum error correction (QEC). Conventional QEC schemes have rather high resource overheads and low threshold requirements, making them challenging to implement on present day hardware. Here, we use a recently developed noise-adapted 3-qubit QEC scheme to demonstrate break-even performance against native amplitude-damping (AD) noise on IBM quantum hardware. We use variational quantum circuits to construct hardware-efficient encoding and decoding circuits. This scheme is probabilistic due to the non-unitary nature of the recovery operators, which are implemented via the block-encoding technique. We demonstrate logical qubit lifetimes exceeding those of the physical qubits by performing multiple rounds of QEC. To further protect the qubits from dephasing due to crosstalk, we incorporate dynamical decoupling into our noise-adapted QEC scheme in a seamless fashion. To account for the post-selection overhead, we define a measure of gain, that allows for faithful performance benchmarking of the protocol. Our analysis suggests that the performance of our protocol is limited primarily by the measurement readout fidelity, and is bound to improve with successive generations of quantum processors.

quant-pharXiv:2603.04564•Mar 6, 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

QEC-C II: Robust Control under Correlated Decoherence

Ethan Arthur Caspian

Quantum error correction (QEC) faces a significant challenge in realistic noisy intermediate-scale quantum (NISQ) devices: correlated decoherence. Building upon the foundational QEC-C protocol, we introduce QEC-C II, a scalable framework that delivers robust fault tolerance against spatially and temporally correlated noise. By integrating decoherence-free subspace (DFS) principles and correlation-aware adaptive feedback, QEC-C II achieves exponential error suppression in simulation under correlated noise models, with fewer physical qubits than typical topological baselines for the same target error in our benchmarks. The protocol leverages an enhanced scaling law, β(n) = 0.788 e 0.360n , and efficiently suppresses noise with minimal computational overhead. We validate QEC-C II on 28-qubit GHZ states, extend it to 56-qubit subspaces, and conduct 84-qubit stress-test simulations under correlated noise models. The results demonstrate sustained fidelities exceeding 99.99 % in simulations under realistic dephasing, amplitude-damping, burst-error, and correlated decoherence scenarios, with rapid convergence (typically ≤ 2 iterations in our simulations). QEC-C II significantly reduces both resource and control complexity, simplifying hardware integration and improving performance with increasing system size. This work provides a practical pathway toward resource-efficient fault tolerance in quantum processors operating in real-world correlated environments.

•Jan 1, 2025•0 citations

Quantum Codes for Generalized Amplitude-damping Noise

Sourav Dutta, Anubhab Rudra, Manav Seksaria +2 more

Quantum error correcting (QEC) plays a crucial role in protecting quantum information against decoherence and enabling scalable, reliable quantum computing. One of the most realistic and ubiquitous sources of noise affecting quantum hardware today is generalized amplitude-damping (GAD) noise. Conventional, deterministic QEC codes struggle to correct for GAD noise because of their inherent structure, leading to fidelity losses that scale linearly with the damping strength. In this work, we introduce the framework of probabilistic approximate quantum error correction (PAQEC), that combines the flexibility of approximate QEC with the potential of post-selected recovery, enabling high-fidelity, resource-efficient error correction. We construct a five-qubit permutation-invariant code that, under probabilistic recovery, achieves a fidelity loss quadratic in the damping strength, thus outperforming existing QEC codes. Formulating PAQEC as an optimization problem, we present a numerical technique based on Charnes-Cooper and semidefinite programming to identify the optimal recovery map for any PAQEC code. Our results establish PAQEC as a powerful tool for developing resource-efficient, high-fidelity quantum codes tailored to realistic noise, with promising implications for near-term quantum devices and future fault-tolerant architectures.

quant-pharXiv:2609.15924•Sep 15, 2026•0 citations

Noise-adapted recovery circuits for quantum error correction

Debjyoti Biswas, Gaurav M. Vaidya, Prabha Mandayam

Implementing quantum error correction (QEC) protocols is a challenging task in today's era of noisy intermediate-scale quantum devices. We present quantum circuits for a universal, noise-adapted recovery map, often referred to as the Petz map, which is known to achieve close-to-optimal fidelity for arbitrary codes and noise channels. While two of our circuit constructions draw upon algebraic techniques such as isometric extension and block encoding, the third approach breaks down the recovery map into a sequence of two-outcome POVMs. In each of the three cases we improve upon the resource requirements that currently exist in the literature. Apart from Petz recovery circuits, we also present circuits that can directly estimate the fidelity between the encoded state and the recovered state. As a concrete example of our circuit constructions, we implement Petz recovery circuits corresponding to a four-qubit code that is tailor-made to correct for amplitude-damping noise. The efficacy of our noise-adapted recovery circuits is then demonstrated through ideal and noisy simulations on the IBM QasmSimulator. Published by the American Physical Society 2024

arXiv:2305.11093•Physical Review Research•Oct 15, 2024•10 citations
Quantum computers promise transformative speedups, but environmental noise destroys their fragile states. Conventional quantum error correction (QEC) encodes information redundantly across physical qubits, yet fails above a threshold of about 1%1\%1% and incurs polynomial qubit overhead. A recent theorem [Shiraishi2024] from the resource theory of coherence shows that catalytic covariant operations amplify coherence at an unbounded rate, but this result has never been cast as an operational protocol. The challenge is to turn an asymptotic theorem into a recovery scheme that works at any noise strength with realistic resources. Here we show that catalytic coherence amplification can be cast as an error-correction primitive, Catalytic Quantum Error Correction (CQEC), which recovers a known target state from noisy copies without any error \emph{magnitude} threshold whenever the target's coherent modes are preserved. Whereas existing QEC degrades above its threshold, CQEC maintains F>0.999F > 0.999F>0.999 across 200~configurations spanning d=4d = 4d=4--646464, and the impractical n∗∼d4e2γn^{*} \sim d^{4} e^{2γ}n∗∼d4e2γ copy requirement is reduced by nine orders of magnitude via a three-stage pipeline combining CPMG dynamical decoupling, Clifford twirling, and recursive swap-test purification, yielding Fcat>0.96F_\mathrm{cat} > 0.96Fcat​>0.96 from only eight noisy copies. These results turn an abstract resource-theoretic statement into a concrete tool complementary to stabilizer- and purification-based QEC. By replacing a quantitative threshold with a qualitative condition on the support of coherence, CQEC enables ancillary modules within surface-coded processors to be repaired far beyond the conventional threshold; an open-source package reproducing all results in ∼\sim∼30,s accompanies this work (arXiv:2603.25774, https://github.com/deeptell-inc/cqec).
Catalytic quantum error correction (CQEC) amplifies residual coherence with a reusable catalyst, giving threshold-free recovery whenever the target coherent modes survive in the noisy state; its original protocol, however, requires complete knowledge of the ideal target, which fails for variational and iterative algorithms whose output is unknown to the correction module. Here we show that this requirement can be removed by estimating the target from the noisy output alone, in a two-stage protocol we call blind CQEC. At the density-matrix level studied here the recovery map is the mode-inclusion-restricted projection of the estimate, so recovery fidelity obeys F_rec >= 1 - 2||rho_est - rho_target||_1 - 2 Delta_mode: the design of blind CQEC reduces to a classical estimation problem under a recovery ceiling set by mode survival. We benchmark five estimation strategies across three noise channels, four quantum algorithms (d = 4-64), Haar-random states, and mixed targets, assuming oracle access to the noisy density matrix. With exactly calibrated noise, channel inversion coincides with the oracle and both are capped by the mode-survival ceiling (F_rec = 0.77 at d = 64 with the 10^-10 mode threshold); noise-model-free coherence maximization matches the ceiling to within 1.5% at d <= 16; the choice between them is set by calibration accuracy, with the dephasing rate exponentially dominant. Unlike error-mitigation methods, blind CQEC returns the state itself rather than corrected expectation values. A noisy-VQE demonstration for H2 yields a 3.4x energy-error reduction. These results chart the estimator design space for blind, threshold-free recovery and identify the two open problems, an operational measurement model and a circuit-level catalytic map, that remain before deployment.
The promise of quantum computing is closer to reality today than ever before, thanks to rapid progress in the development of quantum hardware. Even as qubit lifetimes and gate fidelities continue to improve, realizing robust, fault-tolerant quantum computers is contingent upon the successful implementation of quantum error correction (QEC). Conventional QEC schemes have rather high resource overheads and low threshold requirements, making them challenging to implement on present day hardware. Here, we use a recently developed noise-adapted 3-qubit QEC scheme to demonstrate break-even performance against native amplitude-damping (AD) noise on IBM quantum hardware. We use variational quantum circuits to construct hardware-efficient encoding and decoding circuits. This scheme is probabilistic due to the non-unitary nature of the recovery operators, which are implemented via the block-encoding technique. We demonstrate logical qubit lifetimes exceeding those of the physical qubits by performing multiple rounds of QEC. To further protect the qubits from dephasing due to crosstalk, we incorporate dynamical decoupling into our noise-adapted QEC scheme in a seamless fashion. To account for the post-selection overhead, we define a measure of gain, that allows for faithful performance benchmarking of the protocol. Our analysis suggests that the performance of our protocol is limited primarily by the measurement readout fidelity, and is bound to improve with successive generations of quantum processors.
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.
Quantum error correction (QEC) faces a significant challenge in realistic noisy intermediate-scale quantum (NISQ) devices: correlated decoherence. Building upon the foundational QEC-C protocol, we introduce QEC-C II, a scalable framework that delivers robust fault tolerance against spatially and temporally correlated noise. By integrating decoherence-free subspace (DFS) principles and correlation-aware adaptive feedback, QEC-C II achieves exponential error suppression in simulation under correlated noise models, with fewer physical qubits than typical topological baselines for the same target error in our benchmarks. The protocol leverages an enhanced scaling law, β(n) = 0.788 e 0.360n , and efficiently suppresses noise with minimal computational overhead. We validate QEC-C II on 28-qubit GHZ states, extend it to 56-qubit subspaces, and conduct 84-qubit stress-test simulations under correlated noise models. The results demonstrate sustained fidelities exceeding 99.99 % in simulations under realistic dephasing, amplitude-damping, burst-error, and correlated decoherence scenarios, with rapid convergence (typically ≤ 2 iterations in our simulations). QEC-C II significantly reduces both resource and control complexity, simplifying hardware integration and improving performance with increasing system size. This work provides a practical pathway toward resource-efficient fault tolerance in quantum processors operating in real-world correlated environments.
Quantum error correcting (QEC) plays a crucial role in protecting quantum information against decoherence and enabling scalable, reliable quantum computing. One of the most realistic and ubiquitous sources of noise affecting quantum hardware today is generalized amplitude-damping (GAD) noise. Conventional, deterministic QEC codes struggle to correct for GAD noise because of their inherent structure, leading to fidelity losses that scale linearly with the damping strength. In this work, we introduce the framework of probabilistic approximate quantum error correction (PAQEC), that combines the flexibility of approximate QEC with the potential of post-selected recovery, enabling high-fidelity, resource-efficient error correction. We construct a five-qubit permutation-invariant code that, under probabilistic recovery, achieves a fidelity loss quadratic in the damping strength, thus outperforming existing QEC codes. Formulating PAQEC as an optimization problem, we present a numerical technique based on Charnes-Cooper and semidefinite programming to identify the optimal recovery map for any PAQEC code. Our results establish PAQEC as a powerful tool for developing resource-efficient, high-fidelity quantum codes tailored to realistic noise, with promising implications for near-term quantum devices and future fault-tolerant architectures.
Implementing quantum error correction (QEC) protocols is a challenging task in today's era of noisy intermediate-scale quantum devices. We present quantum circuits for a universal, noise-adapted recovery map, often referred to as the Petz map, which is known to achieve close-to-optimal fidelity for arbitrary codes and noise channels. While two of our circuit constructions draw upon algebraic techniques such as isometric extension and block encoding, the third approach breaks down the recovery map into a sequence of two-outcome POVMs. In each of the three cases we improve upon the resource requirements that currently exist in the literature. Apart from Petz recovery circuits, we also present circuits that can directly estimate the fidelity between the encoded state and the recovered state. As a concrete example of our circuit constructions, we implement Petz recovery circuits corresponding to a four-qubit code that is tailor-made to correct for amplitude-damping noise. The efficacy of our noise-adapted recovery circuits is then demonstrated through ideal and noisy simulations on the IBM QasmSimulator. Published by the American Physical Society 2024