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:2103.05007

Autonomous quantum error correction and quantum computation

José Lebreuilly, Kyungjoo Noh, Chiao-Hsuan Wang, S. M. Girvin, Liang Jiang

Published Mar 8, 2021• 29 citations
arXivHTMLPDF

Abstract

In this work, we present a general theoretical framework for the study of autonomously corrected quantum devices. First, we identify a necessary and sufficient revised version of the Knill-Laflamme conditions for the existence of an engineered Lindbladian providing protection against at most $c$ consecutive errors of natural dissipation, giving rise to an effective logical decoherence rate suppressed to order $c$. Moreover, we demonstrate that such engineered dissipation can be combined with generalized realizations of error-transparent Hamiltonians (ETH) in order to perform a quantum computation in the logical space while maintaining the same degree of suppression of decoherence. Finally, we introduce a formalism predicting with precision the emergent dynamics in the logical code space resulting from the interplay of natural, engineered dissipations sources and the generalized ETH.

DOI
10.48550/arxiv.2103.05007

Related papers

Implementation-independent sufficient condition of the Knill-Laflamme type for the autonomous protection of logical qudits by strong engineered dissipation

Jae-Mo Lihm, Kyungjoo Noh, Uwe R. Fischer

Autonomous quantum error correction utilizes the engineered coupling of a quantum system to a dissipative ancilla to protect quantum logical states from decoherence. We show that the Knill-Laflamme condition, stating that the environmental error operators should act trivially on a subspace, which then becomes the code subspace, is sufficient for logical qudits to be protected against Markovian noise. It is proven that the error caused by the total Lindbladian evolution in the code subspace can be suppressed up to very long times in the limit of large engineered dissipation, by explicitly deriving how the error scales with both time and engineered dissipation strength. To demonstrate the potential of our approach for applications, we implement our general theory with binomial codes, a class of bosonic error-correcting codes, and outline how they can be implemented in a fully autonomous manner to protect against photon loss in a microwave cavity.

arXiv:1711.02999•Physical Review A•Jul 16, 2018•45 citations

Bounds on Autonomous Quantum Error Correction

Oles Shtanko, Yu-Jie Liu, Simon Lieu +2 more

Autonomous quantum memories are a way to passively protect quantum information using engineered dissipation that creates an “always-on'' decoder. We analyze Markovian autonomous decoders that can be implemented with a wide range of qubit and bosonic error-correcting codes, and derive several upper bounds and a lower bound on the logical error rate in terms of correction and noise rates. These bounds suggest that, in general, there is always a correction rate, possibly size-dependent, above which autonomous memories exhibit arbitrarily long coherence times. For any given autonomous memory, size dependence of this correction rate is difficult to rule out: we point to common scenarios where autonomous decoders that stochastically implement active error correction must operate at rates that grow with code size. For codes with a threshold, we show that it is possible to achieve faster-than-polynomial decay of the logical error rate with code size by using superlogarithmic scaling of the correction rate. We illustrate our results with several examples. One example is an exactly solvable global dissipative toric code model that can achieve an effective logical error rate that decreases exponentially with the linear lattice size, provided that the recovery rate grows proportionally with the linear lattice size.

arXiv:2308.16233•Quantum•Jul 22, 2025•13 citations

Autonomous Quantum Error Correction of Spin-Oscillator Hybrid Qubits

Sungjoo Cho, Ju-yeon Gyhm, Hyukjoon Kwon +1 more

We propose a novel measurement-free scheme for stabilizing a spin-oscillator hybrid qubit via autonomous quantum error correction. The engineered Lindbladian renders the code space into an attractive steady-state subspace, realized by coupling the storage mode to a rapidly cooled bath through a controlled beam-splitter and spin-dependent displacement interactions. The continuous variable-discrete variable hybrid approach to autonomous quantum error correction preserves the hardware efficiency of conventional dissipation engineering while simplifying the required system-bath coupling. The construction is compatible with simple logical gates and leverages primitives already demonstrated in experimental platforms, such as trapped-ion systems, suggesting a practical route to hardware-efficient, noise-biased logical qubits without repeated syndrome measurements and feedforward.

quant-pharXiv:2604.11145•Apr 14, 2026•1 citation

Approximate Autonomous Quantum Error Correction with Reinforcement Learning

Ye‐Xiong Zeng, Zheng-Yang Zhou, Enrico Rinaldi +2 more

Autonomous quantum error correction (AQEC) protects logical qubits by engineered dissipation and thus circumvents the necessity of frequent, error-prone measurement-feedback loops. Bosonic code spaces, where single-photon loss represents the dominant source of error, are promising candidates for AQEC due to their flexibility and controllability. While existing proposals have demonstrated the in-principle feasibility of AQEC with bosonic code spaces, these schemes are typically based on the exact implementation of the Knill-Laflamme conditions and thus require the realization of Hamiltonian distances d≥2. Implementing such Hamiltonian distances requires multiple nonlinear interactions and control fields, rendering these schemes experimentally challenging. Here, we propose a bosonic code for approximate AQEC by relaxing the Knill-Laflamme conditions. Using reinforcement learning (RL), we identify the optimal bosonic set of code words (denoted here by RL code), which, surprisingly, is composed of the Fock states |2⟩ and |4⟩. As we show, the RL code, despite its approximate nature, successfully suppresses single-photon loss, reducing it to an effective dephasing process that well surpasses the break-even threshold. It may thus provide a valuable building block toward full error protection. The error-correcting Hamiltonian, which includes ancilla systems that emulate the engineered dissipation, is entirely based on the Hamiltonian distance d=1, significantly reducing model complexity. Single-qubit gates are implemented in the RL code with a maximum distance d_{g}=2.

arXiv:2212.11651•Physical Review Letters•Jul 31, 2023•57 citations

Autonomous quantum error correction and fault-tolerant quantum computation with squeezed cat qubits

Qian Xu, Guo Zheng, Yuxin Wang +3 more

Abstract We propose an autonomous quantum error correction scheme using squeezed cat (SC) code against excitation loss in continuous-variable systems. Through reservoir engineering, we show that a structured dissipation can stabilize a two-component SC while autonomously correcting the errors. The implementation of such dissipation only requires low-order nonlinear couplings among three bosonic modes or between a bosonic mode and a qutrit. While our proposed scheme is device independent, it is readily implementable with current experimental platforms such as superconducting circuits and trapped-ion systems. Compared to the stabilized cat, the stabilized SC has a much lower dominant error rate and a significantly enhanced noise bias. Furthermore, the bias-preserving operations for the SC have much lower error rates. In combination, the stabilized SC leads to substantially better logical performance when concatenating with an outer discrete-variable code. The surface-SC scheme achieves more than one order of magnitude increase in the threshold ratio between the loss rate κ 1 and the engineered dissipation rate κ 2 . Under a practical noise ratio κ 1 / κ 2 = 10 −3 , the repetition-SC scheme can reach a 10 −15 logical error rate even with a small mean excitation number of 4, which already suffices for practically useful quantum algorithms.

arXiv:2210.13406•npj Quantum Information•Aug 3, 2023•83 citations

Quantum Memory and Autonomous Computation in Two Dimensions

Gesa Dünnweber, Georgios Styliaris, Rahul Trivedi

Quantum error correction (QEC) normally requires active maintenance using measurements, classical processing and externally controlled correction schedules. Passive QEC, by contrast, was previously established only in unphysical spatial dimensions. Here, we give an explicit scheme for autonomous quantum error correction and computation in two dimensions, formulated as a dissipative quantum cellular automaton with a fixed, local and translation-invariant update rule. The construction uses hierarchical, self-simulating control elements based on ideas from the seminal classical results of Gács (1986, 1989) together with a measurement-free concatenated quantum code. We prove the existence of a nonzero noise threshold under a local noise model. Below this threshold, logical errors on encoded initial states are suppressed exponentially with increasing system size and the memory lifetime diverges in the thermodynamic limit. As an extension, we outline how this mechanism can also be implemented in continuous time by a time-independent, translation-invariant local Lindbladian. Quantum circuits can moreover be encoded in the automaton's initial state and executed fault-tolerantly with polylogarithmic overhead under the same circuit-independent rule. Our scheme thus realizes a self-correcting quantum computer capable of universal computation.

quant-pharXiv:2601.20818•Jan 29, 2026•10 citations
In this work, we present a general theoretical framework for the study of autonomously corrected quantum devices. First, we identify a necessary and sufficient revised version of the Knill-Laflamme conditions for the existence of an engineered Lindbladian providing protection against at most ccc consecutive errors of natural dissipation, giving rise to an effective logical decoherence rate suppressed to order ccc. Moreover, we demonstrate that such engineered dissipation can be combined with generalized realizations of error-transparent Hamiltonians (ETH) in order to perform a quantum computation in the logical space while maintaining the same degree of suppression of decoherence. Finally, we introduce a formalism predicting with precision the emergent dynamics in the logical code space resulting from the interplay of natural, engineered dissipations sources and the generalized ETH.
Autonomous quantum error correction utilizes the engineered coupling of a quantum system to a dissipative ancilla to protect quantum logical states from decoherence. We show that the Knill-Laflamme condition, stating that the environmental error operators should act trivially on a subspace, which then becomes the code subspace, is sufficient for logical qudits to be protected against Markovian noise. It is proven that the error caused by the total Lindbladian evolution in the code subspace can be suppressed up to very long times in the limit of large engineered dissipation, by explicitly deriving how the error scales with both time and engineered dissipation strength. To demonstrate the potential of our approach for applications, we implement our general theory with binomial codes, a class of bosonic error-correcting codes, and outline how they can be implemented in a fully autonomous manner to protect against photon loss in a microwave cavity.
Autonomous quantum memories are a way to passively protect quantum information using engineered dissipation that creates an “always-on'' decoder. We analyze Markovian autonomous decoders that can be implemented with a wide range of qubit and bosonic error-correcting codes, and derive several upper bounds and a lower bound on the logical error rate in terms of correction and noise rates. These bounds suggest that, in general, there is always a correction rate, possibly size-dependent, above which autonomous memories exhibit arbitrarily long coherence times. For any given autonomous memory, size dependence of this correction rate is difficult to rule out: we point to common scenarios where autonomous decoders that stochastically implement active error correction must operate at rates that grow with code size. For codes with a threshold, we show that it is possible to achieve faster-than-polynomial decay of the logical error rate with code size by using superlogarithmic scaling of the correction rate. We illustrate our results with several examples. One example is an exactly solvable global dissipative toric code model that can achieve an effective logical error rate that decreases exponentially with the linear lattice size, provided that the recovery rate grows proportionally with the linear lattice size.
We propose a novel measurement-free scheme for stabilizing a spin-oscillator hybrid qubit via autonomous quantum error correction. The engineered Lindbladian renders the code space into an attractive steady-state subspace, realized by coupling the storage mode to a rapidly cooled bath through a controlled beam-splitter and spin-dependent displacement interactions. The continuous variable-discrete variable hybrid approach to autonomous quantum error correction preserves the hardware efficiency of conventional dissipation engineering while simplifying the required system-bath coupling. The construction is compatible with simple logical gates and leverages primitives already demonstrated in experimental platforms, such as trapped-ion systems, suggesting a practical route to hardware-efficient, noise-biased logical qubits without repeated syndrome measurements and feedforward.
Autonomous quantum error correction (AQEC) protects logical qubits by engineered dissipation and thus circumvents the necessity of frequent, error-prone measurement-feedback loops. Bosonic code spaces, where single-photon loss represents the dominant source of error, are promising candidates for AQEC due to their flexibility and controllability. While existing proposals have demonstrated the in-principle feasibility of AQEC with bosonic code spaces, these schemes are typically based on the exact implementation of the Knill-Laflamme conditions and thus require the realization of Hamiltonian distances d≥2. Implementing such Hamiltonian distances requires multiple nonlinear interactions and control fields, rendering these schemes experimentally challenging. Here, we propose a bosonic code for approximate AQEC by relaxing the Knill-Laflamme conditions. Using reinforcement learning (RL), we identify the optimal bosonic set of code words (denoted here by RL code), which, surprisingly, is composed of the Fock states |2⟩ and |4⟩. As we show, the RL code, despite its approximate nature, successfully suppresses single-photon loss, reducing it to an effective dephasing process that well surpasses the break-even threshold. It may thus provide a valuable building block toward full error protection. The error-correcting Hamiltonian, which includes ancilla systems that emulate the engineered dissipation, is entirely based on the Hamiltonian distance d=1, significantly reducing model complexity. Single-qubit gates are implemented in the RL code with a maximum distance d_{g}=2.
Abstract We propose an autonomous quantum error correction scheme using squeezed cat (SC) code against excitation loss in continuous-variable systems. Through reservoir engineering, we show that a structured dissipation can stabilize a two-component SC while autonomously correcting the errors. The implementation of such dissipation only requires low-order nonlinear couplings among three bosonic modes or between a bosonic mode and a qutrit. While our proposed scheme is device independent, it is readily implementable with current experimental platforms such as superconducting circuits and trapped-ion systems. Compared to the stabilized cat, the stabilized SC has a much lower dominant error rate and a significantly enhanced noise bias. Furthermore, the bias-preserving operations for the SC have much lower error rates. In combination, the stabilized SC leads to substantially better logical performance when concatenating with an outer discrete-variable code. The surface-SC scheme achieves more than one order of magnitude increase in the threshold ratio between the loss rate κ 1 and the engineered dissipation rate κ 2 . Under a practical noise ratio κ 1 / κ 2 = 10 −3 , the repetition-SC scheme can reach a 10 −15 logical error rate even with a small mean excitation number of 4, which already suffices for practically useful quantum algorithms.
Quantum error correction (QEC) normally requires active maintenance using measurements, classical processing and externally controlled correction schedules. Passive QEC, by contrast, was previously established only in unphysical spatial dimensions. Here, we give an explicit scheme for autonomous quantum error correction and computation in two dimensions, formulated as a dissipative quantum cellular automaton with a fixed, local and translation-invariant update rule. The construction uses hierarchical, self-simulating control elements based on ideas from the seminal classical results of Gács (1986, 1989) together with a measurement-free concatenated quantum code. We prove the existence of a nonzero noise threshold under a local noise model. Below this threshold, logical errors on encoded initial states are suppressed exponentially with increasing system size and the memory lifetime diverges in the thermodynamic limit. As an extension, we outline how this mechanism can also be implemented in continuous time by a time-independent, translation-invariant local Lindbladian. Quantum circuits can moreover be encoded in the automaton's initial state and executed fault-tolerantly with polylogarithmic overhead under the same circuit-independent rule. Our scheme thus realizes a self-correcting quantum computer capable of universal computation.