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:1901.05358 · Physical Review A

Phase-engineered bosonic quantum codes

Linshu Li, Dylan J. Young, Victor V. Albert, Kyungjoo Noh, Chang‐Ling Zou, Liang Jiang

Published Jun 29, 2021• 14 citations
arXivHTMLPDF

Abstract

Continuous-variable systems protected by bosonic quantum codes have emerged as a promising platform for quantum information. To date, the design of code words has centered on optimizing the state occupation in the relevant basis to generate the distance needed for error correction. Here, we show tuning the phase degree of freedom in the design of code words can affect, and potentially enhance, the protection against Markovian errors that involve excitation exchange with the environment. As illustrations, we first consider phase engineering bosonic codes with uniform spacing in the Fock basis that correct excitation loss with a Kerr unitary and show that these modified codes feature destructive interference between error code words and, with an adapted ``two-level'' recovery, the error protection is significantly enhanced. We then study protection against energy decay with the presence of mode nonlinearities and analyze the role of phase for optimal code designs. We extend the principle of phase engineering to bosonic codes defined in other bases and multiqubit codes, demonstrating its broad applicability in quantum error correction.

DOI
10.1103/physreva.103.062427

Related papers

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•51 citations

Generalized Kerr-Cat Qubit Codes

Alonso Viladomat, Shahram Dehdashti, Amin Kargarian +2 more

We present a systematic study of Schrödinger cat codes constructed from Kerr-type coherent states, including displaced Kerr coherent states and Barut--Girardello Kerr coherent states, each admitting two distinct families determined by the sign of the Kerr nonlinearity. By tuning the Kerr parameter and coherent-state amplitude, these states interpolate between $\mathfrak{su}(2)$, $\mathfrak{su}(1,1)$ coherent states, providing a unified and versatile foundation for this type of bosonic quantum error correction. Unlike standard two-component Schrödinger cat codes, where a single photon-loss event induces an uncorrectable bit-flip, the nonlinear phase-space structure of Kerr cat states enables simultaneous detection and correction of both photon-loss and dephasing errors within a unified recovery framework, with optimal recovery operations determined via convex optimization. We demonstrate that Kerr cat encodings significantly outperform conventional cat codes under combined loss and dephasing noise, and that judicious parameter optimization can suppress both error channels to a level that reduces the overhead of additional error correction layers. We further show that Kerr-deformed coherent-state manifolds under engineered two-photon driving emerge as effective steady states of driven-dissipative dynamics, with single-photon decoherence strongly suppressed and leakage outside the protected manifold appearing only as higher-order corrections in the deformation strength. Our extended formalism identifies generalized Kerr Schrödinger cat codes as promising candidates for fault-tolerant bosonic quantum computation in experimental platforms such as nonlinear photonics.

quant-pharXiv:2606.14901•Jun 16, 2026•0 citations

General Approach to Error Detection of Bosonic Codes via Phase Estimation

Yuan-De Jin, Shi-Yu Zhang, Ulrik L. Andersen +1 more

We present a general approach to error detection of bosonic quantum error-correction codes via an adaptive quantum phase estimation algorithm assisted by a single ancilla qubit. The approach is applicable to a broad class of bosonic codes whose error syndromes are described by symmetry or stabilizer operators, including the rotation-symmetric codes and Gottesman-Kitaev-Preskill (GKP) codes. The detection precision scales inversely with the total evolution time and thus reaches the Heisenberg limit. We numerically demonstrate the approach for several examples, such as detecting bosonic excitation loss errors in high-order cat or binomial codes and displacement errors in finite-energy GKP codes. We also extend the approach to efficiently generate arbitrary Fock states. Our schemes are feasible in present-day experiments.

arXiv:2507.03999•Physical Review Letters•Sep 10, 2025•1 citation

Error Analysis of Bosonic Codes

Stefanus Tanuarta

Quantum computers have been shown to be able to perform computations that are thus far thought to be infeasible through classical computation. This is achieved by taking advantage of certain properties and phenomena unique to quantum systems. Unfortunately, engineering particular quantum systems that are useful for computation is difficult and there is still a long road towards building a robust, large-scale quantum computer. A key approach to building quantum computers that are robust to noise is the development of Quantum Error Correcting codes. In recent years, there have been a surge of progress in the development and realisation of bosonic codes, which are quantum error correcting codes that encode quantum information into the infinite-dimensional Hilbert space of an oscillator. Due to its large Hilbert space, bosonic codes are able to protect quantum information using a single, or a few physical systems. This thesis will take two different but complementary approaches to the development of bosonic codes and bosonic code qubits. The first will be a numerical study of errors affecting bosonic codes within a fault-tolerant system. Specifically, we introduce the concatenated Bacon-Shor rotation-symmetric bosonic code and evaluate the entanglement fidelity of a teleportation based error correction scheme against pure loss errors. In the second approach, we study the recently proposed gyrator qubit by Rymarz et al., which realises a bosonic code known as the Gottesman-Kitaev-Preskill (GKP) code in its low energy eigenspace. We support this study with a Wentzel-Kramers-Brillouin (WKB) analysis of the Zak transformed Hamiltonian of the qubit. This allows us to derive the low-energy spectrum and eigenstates of the qubit and derive matrix elements corresponding to transitions between qubit states when the system is weakly coupled to a thermal environment.

•Jan 1, 2025•0 citations

Protecting bosonic codes from ancilla-induced errors with continuous-variable flags

Thomas Décultot, Ronan Gautier, Mazyar Mirrahimi

Bosonic quantum error correction represents a route towards significant hardware overhead reduction for fault-tolerant quantum computation. However, controlling quantum harmonic oscillators that encode the quantum information comes with its own challenges. In many platforms such as superconducting circuits and trapped ions, the bosonic degree of freedom is controlled by an ancillary qubit whose decay during a qubit-oscillator gate propagates to the oscillator as a continuous error. Such errors generally lie beyond the scope of errors that the bosonic code is capable of correcting. We introduce the continuous-variable flag: an auxiliary oscillator coupled to the ancilla whose phase-space position encodes the continuous error corrupting the storage mode. After the gate, a heterodyne measurement of the flag estimates this continuous-variable error and a subsequent feedback control undoes it up to a bosonic code stabilizer. The scheme requires no new ingredients, as the flag is driven by the same dispersive coupling, displacements and rotations that implement the gates it is supposed to protect. We construct sequences protecting conditional rotations to all orders in ancilla decay with one flag, and conditional displacements to first order with one flag and to all orders with two. Simulations with realistic circuit-QED parameters predict more than three orders of magnitude fewer logical errors for the parity measurement of a four-component cat code, and a finite-energy GKP logical lifetime near its noiseless-ancilla bound. By discretizing continuous-variable errors, the flags introduced in this work are a useful tool for any hybrid oscillator-qubit processor, and open the route towards fault-tolerant simulation and computation with bosonic modes.

quant-pharXiv:2610.07139•Oct 7, 2026•0 citations

Error Correction Properties of Covariant Bosonic Encodings

Frederic St-Amand, Jean-Philippe Burelle, Baptiste Royer

Bosonic codes offer a promising approach towards hardware-efficient fault tolerance, with many leading examples such as the cat-code and the GKP code organized by an underlying symmetry. We build on a representation-theoretic framework of quantum error correction to formalize the construction and analysis of multimode symmetric bosonic codes, focusing on finite groups. Here, a physical, logical representation and an initial seed state together define the codewords via a covariant encoding. A central observation is that QEC matrices can be viewed as morphisms of group representations, so that Schur's lemma forces entire irreducible representations blocks to vanish. We recover several known single- and two-mode bosonic codes and build and analyze the error protection capabilities of three codes based on finite subgroups of SU(2). We analyze the impact of reducibility of the logical representation and optimize the seed state using the near-optimal fidelity.

quant-pharXiv:2609.26660•Sep 23, 2026•0 citations
Continuous-variable systems protected by bosonic quantum codes have emerged as a promising platform for quantum information. To date, the design of code words has centered on optimizing the state occupation in the relevant basis to generate the distance needed for error correction. Here, we show tuning the phase degree of freedom in the design of code words can affect, and potentially enhance, the protection against Markovian errors that involve excitation exchange with the environment. As illustrations, we first consider phase engineering bosonic codes with uniform spacing in the Fock basis that correct excitation loss with a Kerr unitary and show that these modified codes feature destructive interference between error code words and, with an adapted ``two-level'' recovery, the error protection is significantly enhanced. We then study protection against energy decay with the presence of mode nonlinearities and analyze the role of phase for optimal code designs. We extend the principle of phase engineering to bosonic codes defined in other bases and multiqubit codes, demonstrating its broad applicability in quantum error correction.
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.
We present a systematic study of Schrödinger cat codes constructed from Kerr-type coherent states, including displaced Kerr coherent states and Barut--Girardello Kerr coherent states, each admitting two distinct families determined by the sign of the Kerr nonlinearity. By tuning the Kerr parameter and coherent-state amplitude, these states interpolate between su(2)\mathfrak{su}(2)su(2), su(1,1)\mathfrak{su}(1,1)su(1,1) coherent states, providing a unified and versatile foundation for this type of bosonic quantum error correction. Unlike standard two-component Schrödinger cat codes, where a single photon-loss event induces an uncorrectable bit-flip, the nonlinear phase-space structure of Kerr cat states enables simultaneous detection and correction of both photon-loss and dephasing errors within a unified recovery framework, with optimal recovery operations determined via convex optimization. We demonstrate that Kerr cat encodings significantly outperform conventional cat codes under combined loss and dephasing noise, and that judicious parameter optimization can suppress both error channels to a level that reduces the overhead of additional error correction layers. We further show that Kerr-deformed coherent-state manifolds under engineered two-photon driving emerge as effective steady states of driven-dissipative dynamics, with single-photon decoherence strongly suppressed and leakage outside the protected manifold appearing only as higher-order corrections in the deformation strength. Our extended formalism identifies generalized Kerr Schrödinger cat codes as promising candidates for fault-tolerant bosonic quantum computation in experimental platforms such as nonlinear photonics.
We present a general approach to error detection of bosonic quantum error-correction codes via an adaptive quantum phase estimation algorithm assisted by a single ancilla qubit. The approach is applicable to a broad class of bosonic codes whose error syndromes are described by symmetry or stabilizer operators, including the rotation-symmetric codes and Gottesman-Kitaev-Preskill (GKP) codes. The detection precision scales inversely with the total evolution time and thus reaches the Heisenberg limit. We numerically demonstrate the approach for several examples, such as detecting bosonic excitation loss errors in high-order cat or binomial codes and displacement errors in finite-energy GKP codes. We also extend the approach to efficiently generate arbitrary Fock states. Our schemes are feasible in present-day experiments.
Quantum computers have been shown to be able to perform computations that are thus far thought to be infeasible through classical computation. This is achieved by taking advantage of certain properties and phenomena unique to quantum systems. Unfortunately, engineering particular quantum systems that are useful for computation is difficult and there is still a long road towards building a robust, large-scale quantum computer. A key approach to building quantum computers that are robust to noise is the development of Quantum Error Correcting codes. In recent years, there have been a surge of progress in the development and realisation of bosonic codes, which are quantum error correcting codes that encode quantum information into the infinite-dimensional Hilbert space of an oscillator. Due to its large Hilbert space, bosonic codes are able to protect quantum information using a single, or a few physical systems. This thesis will take two different but complementary approaches to the development of bosonic codes and bosonic code qubits. The first will be a numerical study of errors affecting bosonic codes within a fault-tolerant system. Specifically, we introduce the concatenated Bacon-Shor rotation-symmetric bosonic code and evaluate the entanglement fidelity of a teleportation based error correction scheme against pure loss errors. In the second approach, we study the recently proposed gyrator qubit by Rymarz et al., which realises a bosonic code known as the Gottesman-Kitaev-Preskill (GKP) code in its low energy eigenspace. We support this study with a Wentzel-Kramers-Brillouin (WKB) analysis of the Zak transformed Hamiltonian of the qubit. This allows us to derive the low-energy spectrum and eigenstates of the qubit and derive matrix elements corresponding to transitions between qubit states when the system is weakly coupled to a thermal environment.
Bosonic quantum error correction represents a route towards significant hardware overhead reduction for fault-tolerant quantum computation. However, controlling quantum harmonic oscillators that encode the quantum information comes with its own challenges. In many platforms such as superconducting circuits and trapped ions, the bosonic degree of freedom is controlled by an ancillary qubit whose decay during a qubit-oscillator gate propagates to the oscillator as a continuous error. Such errors generally lie beyond the scope of errors that the bosonic code is capable of correcting. We introduce the continuous-variable flag: an auxiliary oscillator coupled to the ancilla whose phase-space position encodes the continuous error corrupting the storage mode. After the gate, a heterodyne measurement of the flag estimates this continuous-variable error and a subsequent feedback control undoes it up to a bosonic code stabilizer. The scheme requires no new ingredients, as the flag is driven by the same dispersive coupling, displacements and rotations that implement the gates it is supposed to protect. We construct sequences protecting conditional rotations to all orders in ancilla decay with one flag, and conditional displacements to first order with one flag and to all orders with two. Simulations with realistic circuit-QED parameters predict more than three orders of magnitude fewer logical errors for the parity measurement of a four-component cat code, and a finite-energy GKP logical lifetime near its noiseless-ancilla bound. By discretizing continuous-variable errors, the flags introduced in this work are a useful tool for any hybrid oscillator-qubit processor, and open the route towards fault-tolerant simulation and computation with bosonic modes.
Bosonic codes offer a promising approach towards hardware-efficient fault tolerance, with many leading examples such as the cat-code and the GKP code organized by an underlying symmetry. We build on a representation-theoretic framework of quantum error correction to formalize the construction and analysis of multimode symmetric bosonic codes, focusing on finite groups. Here, a physical, logical representation and an initial seed state together define the codewords via a covariant encoding. A central observation is that QEC matrices can be viewed as morphisms of group representations, so that Schur's lemma forces entire irreducible representations blocks to vanish. We recover several known single- and two-mode bosonic codes and build and analyze the error protection capabilities of three codes based on finite subgroups of SU(2). We analyze the impact of reducibility of the logical representation and optimize the seed state using the near-optimal fidelity.