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

• URL: http://arxiv.org/abs/2603.25774v2
• Date: Tue, 31 Mar 2026 07:51:23 GMT
• Title: Catalytic Quantum Error Correction: Theory, Efficient Catalyst Preparation, and Numerical Benchmarks
• Abstract summary: CQEC recovers a known target state from noisy copies without an error emphmagnitude threshold.<n>CQEC succeeds whenever the coherent modes satisfy $mathcalC(_0) subseteq mathcalC(_mathrmnoisy)$, regardless of noise strength.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce Catalytic Quantum Error Correction (CQEC), a state recovery protocol exploiting catalytic covariant transformations. CQEC recovers a known target state from noisy copies without an error \emph{magnitude} threshold: recovery succeeds whenever the coherent modes satisfy $\mathcal{C}(ρ_0) \subseteq \mathcal{C}(ρ_\mathrm{noisy})$, regardless of noise strength. The main practical bottleneck -- catalyst preparation requiring $n^* \sim d^4 e^{2γ}$ copies -- is resolved by a three-stage pipeline combining CPMG dynamical decoupling, Clifford twirling, and the recursive swap test, achieving $F_\mathrm{cat} > 0.96$ with only 8~copies ($10^9$-fold reduction). Numerical validation across four quantum algorithms ($d = 4$--$64$), a cryptographic protocol, and three noise models confirms $F > 0.999$ in the asymptotic limit across 200~configurations.

Related papers

• Experimental validation of a compact fault-tolerant architecture for trapped ions [0.0]
  We introduce and experimentally validate an architecture based on the $[[20,2,6]]$ $C_4$-Helix code.<n>We perform repeated quantum error correction with an error of $4.6+6.2_-2.6times10-5$ per logical qubit per QEC cycle.<n>Circuit-level simulations indicate that improvements in physical fidelity bring the same architecture into the $10-6$-$10-8$ logical-error regime.
  arXiv  Detail & Related papers  (2026-09-02T22:21:23Z)
• Quantum Speedups for Stochastic Optimization with Heavy-Tailed Noise [49.730496294398726]
  We develop a novel quantum mean estimator for heavy-tailed random variables.<n>We derive stronger lower bounds for tail index>4/3$, showing that a nontrivial dependence on a dimension is unavoidable.<n>For a convex objective function, we propose a quantum projected gradient descent method.
  arXiv  Detail & Related papers  (2026-07-28T09:29:37Z)
• Quantum-classical crossover in fault-tolerant quantum dynamics simulation [56.198154828333685]
  We introduce a scalable fault-tolerant framework that combines coherent observable estimation with a space-time-efficient implementation of non-Clifford rotations.<n>A benchmark against state-of-the-art tensor-network and variational Monte Carlo algorithms reveals a concrete crossover for mixed-field Ising dynamics.
  arXiv  Detail & Related papers  (2026-07-17T16:54:25Z)
• Blind Catalytic Quantum Error Correction: Target-State Estimation and Fidelity Recovery Without \ extit{A Priori} Knowledge [0.0]
  We introduce emphblind CQEC, which estimates the target from the noisy output alone before catalytic recovery.<n>Five estimation strategies are benchmarked across three noise models.
  arXiv  Detail & Related papers  (2026-04-13T08:27:08Z)
• Covariant quantum error correction in a three-layer quantum brain model: computational analysis of layer-specific coherence dynamics [0.0]
  We evaluate approximate covariant quantum error correction (CQEC) across two radical-pair proteins.<n>CQEC maintains coherence of 0.83 (95% CI [0.76, 0.79); versus 0.12 without tunneling, $times6.96.9 improvement.<n>A $T sensitivity analysis confirms: at $T = 26$ms, CQEC-protected coherence remains 0.69.
  arXiv  Detail & Related papers  (2026-03-31T11:47:00Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Enhancing Kerr-Cat Qubit Coherence with Controlled Dissipation [64.05054054401175]
  Kerr-cat qubit (KCQ) is a bosonic quantum processor.<n>KCQs are experimentally compatible with on-chip architectures and high-fidelity operations.<n>We present direct evidence that the bit-flip time in a KCQ is limited by leakage out of the qubit manifold.
  arXiv  Detail & Related papers  (2025-11-02T17:58:36Z)
• Topological control of quantum speed limits [55.2480439325792]
  We show that even if the quantum state is completely dispersionless, QFI in this state remains momentum-resolved.<n>We find bounds on quantum speed limit which scales as $sqrt|C|$ in a (dispersionless) topological phase.
  arXiv  Detail & Related papers  (2025-07-21T18:00:07Z)
• Coupled cluster method tailored by quantum selected configuration interaction [0.0]
  We present a hybrid quantum-classical scheme that tailors coupled-cluster (CC) theory with a quantum-selected configuration interaction (QSCI) wave function.<n>QSCI provides a scalable, shot-efficient approach to reconstructing the many-electron state prepared on quantum hardware.
  arXiv  Detail & Related papers  (2025-06-20T11:07:26Z)
• Reducing T Gates with Unitary Synthesis [0.41873449350124814]
  This work presents a novel FT synthesis algorithm that directly synthesizes arbitrary single-qubit unitaries.<n>By leveraging tensor network-based search, our approach enables native $U3$ synthesis, reducing the $T$ count, Clifford gate count, and approximation error.
  arXiv  Detail & Related papers  (2025-03-20T04:53:54Z)
• Approximate quantum error correcting codes from conformal field theory [0.0]
  We consider generic 1+1D CFT codes under extensive local dephasing channels. We show that a CFT code with continuous symmetry saturates a bound on the recovery fidelity for covariant codes.
  arXiv  Detail & Related papers  (2024-06-13T19:40:36Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Catalytic and asymptotic equivalence for quantum entanglement [44.99833362998488]
  Many-copy entanglement manipulation procedures allow for highly entangled pure states from noisy states.<n>We show that using an entangled catalyst cannot enhance the singlet distillation rate of a distillable quantum state.<n>Our findings provide a comprehensive understanding of the capabilities and limitations of both catalytic and state transformations of entangled states.
  arXiv  Detail & Related papers  (2023-05-05T12:57:59Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• A lower bound on the space overhead of fault-tolerant quantum computation [51.723084600243716]
  The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation. We prove an exponential upper bound on the maximal length of fault-tolerant quantum computation with amplitude noise.
  arXiv  Detail & Related papers  (2022-01-31T22:19:49Z)
• A Rate-Distortion Perspective on Quantum State Redistribution [3.683202928838613]
  We consider a rate-distortion version of the quantum state redistribution task, where the error of the decoded state is judged via an additive distortion measure.<n>We derive a single-letter formula for the rate-distortion function of compression schemes assisted by free entanglement.
  arXiv  Detail & Related papers  (2021-12-22T15:19:58Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Even more efficient quantum computations of chemistry through tensor hypercontraction [0.6234350105794442]
  We describe quantum circuits with only $widetildecal O(N)$ Toffoli complexity that block encode the spectra of quantum chemistry Hamiltonians in a basis of $N$ arbitrary orbitals. This is the lowest complexity that has been shown for quantum computations of chemistry within an arbitrary basis.
  arXiv  Detail & Related papers  (2020-11-06T18:03:29Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.