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

Entanglement-assisted continuous-variable concatenated codes for encoding qubits or oscillators

Nihar Ranjan Dash, Sanjoy Dutta, R. Srikanth, Subhashish Banerjee

quant-phSubmitted Jun 8, 2026• Announced Jun 9, 2026• 0 citations
arXivHTMLPDF

Abstract

Entanglement-assisted (EA) stabilizer codes enhance the rate of error correction in relation to codes with no pre-shared entanglement. Meanwhile, bosonic error-correcting codes, such as the Gottesman-Kitaev-Preskill (GKP) code, can be concatenated with qubit stabilizer codes to significantly reduce the logical failure probability of those stabilizer codes. First, we combine the above two concepts to propose an EA version of the qubit-into-oscillators concatenated code that chains an EA-stabilizer (outer) code with a GKP (inner) code. As an example we present a three-qubit EA-repetition concatenated with a GKP code. Second, we propose an EA version of the non-Gaussian oscillator-into-oscillators concatenated code that chains a GKP (outer) code with an EA-stabilizer (inner) code. As an example we present a GKP code concatenated with a three-qubit EA repetition code that uses two maximally entangled modes (emodes) and suppresses the variances of both position and momentum quadrature errors of a data mode. Furthermore, we generalize the latter example to a family of GKP code concatenated with a $n$-qubit EA repetition code that uses ${n-1}$ emodes and suppresses the variances of both position and momentum quadrature errors of a data mode by a factor ${1/n}$.

Comments
10 pages, 5 figures

Related papers

Qubit-oscillator concatenated codes: decoding formalism & code comparison

Yijia Xu, Yixu Wang, En-Jui Kuo +1 more

Concatenating bosonic error-correcting codes with qubit codes can substantially boost the error-correcting power of the original qubit codes. It is not clear how to concatenate optimally, given there are several bosonic codes and concatenation schemes to choose from, including the recently discovered GKP-stabilizer codes [Phys. Rev. Lett. 125, 080503 (2020)}] that allow protection of a logical bosonic mode from fluctuations of the mode's conjugate variables. We develop efficient maximum-likelihood decoders for and analyze the performance of three different concatenations of codes taken from the following set: qubit stabilizer codes, analog/Gaussian stabilizer codes, GKP codes, and GKP-stabilizer codes. We benchmark decoder performance against additive Gaussian white noise, corroborating our numerics with analytical calculations. We observe that the concatenation involving GKP-stabilizer codes outperforms the more conventional concatenation of a qubit stabilizer code with a GKP code in some cases. We also propose a GKP-stabilizer code that suppresses fluctuations in both conjugate variables without extra quadrature squeezing, and formulate qudit versions of GKP-stabilizer codes.

arXiv:2209.04573•Sep 10, 2022•0 citations

Concatenation of the Gottesman-Kitaev-Preskill code with the XZZX surface code

Jiaxuan Zhang, Yu-Chun Wu, Guo‐Ping Guo

Bosonic codes provide an alternative option for quantum error correction. An important category of bosonic codes called the Gottesman-Kitaev-Preskill (GKP) code has aroused much interest recently. Theoretically, the error correction ability of the GKP code is limited since it can only correct small shift errors in position and momentum quadratures. A natural approach to promote the GKP error correction for large-scale, fault-tolerant quantum computation is concatenating encoded GKP states with a stabilizer code. The performance of the XZZX surface-GKP code, i.e., the single-mode GKP code concatenated with the XZZX surface code is investigated in this paper under two different noise models. Firstly, in the code-capacity noise model, the asymmetric rectangular GKP code with parameter $\ensuremath{\lambda}$ is introduced. Using the minimum weight perfect matching decoder combined with the continuous-variable GKP information, the optimal threshold of the XZZX-surface GKP code reaches $\ensuremath{\sigma}\ensuremath{\approx}0.67$ when $\ensuremath{\lambda}=2.1$, compared with the threshold $\ensuremath{\sigma}\ensuremath{\approx}0.60$ of the standard surface-GKP code. Secondly, we analyze the shift errors of two-qubit gates in the actual implementation and build the full circuit-level noise model. By setting the appropriate bias parameters, the logical error rate is reduced by several times in some cases. These results indicate the XZZX surface-GKP codes are more suitable for asymmetric concatenation under the general noise models. We also estimate the overhead of the XZZX-surface GKP code which uses about 291 GKP states with the noise parameter 18.5 dB ($\ensuremath{\kappa}/g\ensuremath{\approx}0.71%$) to encode a logical qubit with the error rate $2.53\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}7}$, compared with the qubit-based surface code using 3041 qubits to achieve almost the same logical error rate.

arXiv:2207.04383•Physical Review A•Jun 9, 2023•16 citations

Quantum Error Correction with the GKP Code and Concatenation with Stabilizer Codes

Yan Wang

Gottesman, Kitaev and Preskill have proposed a scheme to encode a qubit in a harmonic oscillator, which is called the GKP code. It is designed to be resistant to small shift errors contained in momentum and position quadratures. Thus there's some intrinsic fault tolerance of the GKP code. In this thesis,we propose a method to utilize all the information contained in the continuous shifts, not just simply map a GKP-encoded qubit to a normal qubit. This method enables us to do maximum-likelihood decisions and thus increase fault-tolerance of the GKP code. This thesis shows that the continuous nature of the GKP code is quite useful for quantum error correction.

arXiv:1908.00147•Jul 31, 2019•20 citations

New Entanglement-Assisted Codes and Mathematical Structures in Quantum Error Correction

Serge Adonsou

Quantum information processing promises exponential advantages for certain computational and communication tasks, but practical quantum devices are inherently vulnerable to decoherence and operational imperfections. This thesis develops new algebraic and analytical tools for quantum error correction (QEC) aimed at unifying entanglement-assisted coding theory with operator-algebra frameworks, while also providing mathematically rigorous insights for continuous-variable photonic implementations. First, we introduce the framework of entanglement-assisted operator algebra quantum error correction (EA-OAQEC), extending entanglement-assisted QEC in an operator-algebra context. Built on a stabilizer-based formalism, EA-OAQEC unifies and generalizes subspace, subsystem, and hybrid classical-quantum entanglement-assisted codes. We establish a master error-correction theorem, define a generalized distance notion, and develop constructive techniques including gauge fixing, clean-qubit transformations, and entanglement-assisted gauge-fixing procedures. Second, we study general logical operators: unitaries that preserve a stabilizer codespace beyond the traditional Pauli normalizer. We derive explicit structure theorems for the centralizer and normalizer in the full unitary setting and show how normalizer transformations can be parameterized via classical bit matrix multiply complement (BMMC) permutations. Finally, motivated by photonic quantum computing, we analyze finite-rank compressions of the continuous position and momentum operators relevant to Gottesman-Kitaev-Preskill (GKP) codes. We prove that the spectra of these compressions are governed by the roots of classical Hermite polynomials and connect the compressed operators to physically realizable approximations of displacement operations and finite-energy GKP states.

•Sep 1, 2026•0 citations

Bounds on concatenated entanglement-assisted quantum error-correcting codes

Nihar Ranjan Dash, Sanjoy Dutta, R. Srikanth +1 more

Code concatenation combines two or more component codes to design larger codes with greater noise resilience. Introducing entanglement assistance to concatenated codes provides a further advantage in terms of improved error rates and beating certain bounds on codes that would otherwise be unbeatable. First, we derive the general expression for the shared entanglement of a concatenated code and show that the number of ebits can depend on the order of concatenating the component entanglement-assisted quantum error-correcting codes (EAQECCs). We further construct families of pairs of EAQECCs such that the number of ebits of the resultant of concatenating the two codes in a given pair is order independent. Second, we derive conditions on code distance under which nonmaximal-entanglement EAQECCs obtained from a classical quaternary Griesmer or Plotkin code saturate the entanglement-assisted (EA) Griesmer or linear EA Plotkin bound, respectively, extending the known result for maximal-entanglement EAQECCs. Furthermore, we present several families of such nonmaximal-entanglement EAQECCs. Third, we derive an EA version of the quantum Griesmer-Rains bound on the number of correctable errors for EAQECCs. Finally, we present families of pairs of EAQECCs such that the violation of the EA Hamming bound by the resultant of concatenating the two codes in a given pair is order dependent.

arXiv:2412.16082•Physical Review A•Nov 10, 2025•1 citation

A Concatenated Dual Displacement Code for Continuous-Variable Quantum Error Correction

Fucheng Guo, Frank Mueller, Yuan Liu

The continuous-variable (CV) Gaussian no-go theorem fundamentally limits the suppression of Gaussian displacement errors using only Gaussian gates and states. Prior studies have employed Gottesman-Kitaev-Preskill (GKP) states as ancillary qumodes to suppress small Gaussian displacement errors, but when the displacement magnitude becomes large, lattice-crossing events arise beyond the correctable range of the GKP state. To address this issue, we concatenate a Gaussian-noise-suppression circuit with an outer analog Steane code that corrects such occasional lattice-crossing events as well as other abrupt displacement errors. Unlike conventional concatenation, which primarily aims to reduce logical error rates, the Steane-GKP duality in encoding provides complementary protection against both large and small displacement errors, enabling CV error correction within the continuous encoding space and contrasting with earlier approaches that concatenate GKP states with repetition codes for discrete qubit or qudit encodings. Analytical results show that, under infinite squeezing, the concatenated code suppresses the variance of Gaussian displacement errors across all qumodes by up to 50 percent while enabling unbiased correction of lattice-crossing events, with a success probability determined by the ratio between the residual Gaussian error standard deviation and the lattice-crossing magnitude. Even with finite squeezing, the proposed architecture continues to provide Gaussian-error suppression together with lattice-crossing correction, and the presence of the outer analog Steane code relaxes the squeezing requirement of the inner GKP states, indicating near-term experimental feasibility. This work establishes a viable route toward fault-tolerant continuous-variable quantum computation and provides new insight into the design of concatenated CV error-correcting architectures.

quant-pharXiv:2512.00481•Physical Review Research•Dec 2, 2025•0 citations
Entanglement-assisted (EA) stabilizer codes enhance the rate of error correction in relation to codes with no pre-shared entanglement. Meanwhile, bosonic error-correcting codes, such as the Gottesman-Kitaev-Preskill (GKP) code, can be concatenated with qubit stabilizer codes to significantly reduce the logical failure probability of those stabilizer codes. First, we combine the above two concepts to propose an EA version of the qubit-into-oscillators concatenated code that chains an EA-stabilizer (outer) code with a GKP (inner) code. As an example we present a three-qubit EA-repetition concatenated with a GKP code. Second, we propose an EA version of the non-Gaussian oscillator-into-oscillators concatenated code that chains a GKP (outer) code with an EA-stabilizer (inner) code. As an example we present a GKP code concatenated with a three-qubit EA repetition code that uses two maximally entangled modes (emodes) and suppresses the variances of both position and momentum quadrature errors of a data mode. Furthermore, we generalize the latter example to a family of GKP code concatenated with a nnn-qubit EA repetition code that uses n−1{n-1}n−1 emodes and suppresses the variances of both position and momentum quadrature errors of a data mode by a factor 1/n{1/n}1/n.
Concatenating bosonic error-correcting codes with qubit codes can substantially boost the error-correcting power of the original qubit codes. It is not clear how to concatenate optimally, given there are several bosonic codes and concatenation schemes to choose from, including the recently discovered GKP-stabilizer codes [Phys. Rev. Lett. 125, 080503 (2020)}] that allow protection of a logical bosonic mode from fluctuations of the mode's conjugate variables. We develop efficient maximum-likelihood decoders for and analyze the performance of three different concatenations of codes taken from the following set: qubit stabilizer codes, analog/Gaussian stabilizer codes, GKP codes, and GKP-stabilizer codes. We benchmark decoder performance against additive Gaussian white noise, corroborating our numerics with analytical calculations. We observe that the concatenation involving GKP-stabilizer codes outperforms the more conventional concatenation of a qubit stabilizer code with a GKP code in some cases. We also propose a GKP-stabilizer code that suppresses fluctuations in both conjugate variables without extra quadrature squeezing, and formulate qudit versions of GKP-stabilizer codes.
Bosonic codes provide an alternative option for quantum error correction. An important category of bosonic codes called the Gottesman-Kitaev-Preskill (GKP) code has aroused much interest recently. Theoretically, the error correction ability of the GKP code is limited since it can only correct small shift errors in position and momentum quadratures. A natural approach to promote the GKP error correction for large-scale, fault-tolerant quantum computation is concatenating encoded GKP states with a stabilizer code. The performance of the XZZX surface-GKP code, i.e., the single-mode GKP code concatenated with the XZZX surface code is investigated in this paper under two different noise models. Firstly, in the code-capacity noise model, the asymmetric rectangular GKP code with parameter $\ensuremath{\lambda}$ is introduced. Using the minimum weight perfect matching decoder combined with the continuous-variable GKP information, the optimal threshold of the XZZX-surface GKP code reaches $\ensuremath{\sigma}\ensuremath{\approx}0.67$ when $\ensuremath{\lambda}=2.1$, compared with the threshold $\ensuremath{\sigma}\ensuremath{\approx}0.60$ of the standard surface-GKP code. Secondly, we analyze the shift errors of two-qubit gates in the actual implementation and build the full circuit-level noise model. By setting the appropriate bias parameters, the logical error rate is reduced by several times in some cases. These results indicate the XZZX surface-GKP codes are more suitable for asymmetric concatenation under the general noise models. We also estimate the overhead of the XZZX-surface GKP code which uses about 291 GKP states with the noise parameter 18.5 dB ($\ensuremath{\kappa}/g\ensuremath{\approx}0.71%$) to encode a logical qubit with the error rate $2.53\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}7}$, compared with the qubit-based surface code using 3041 qubits to achieve almost the same logical error rate.
Gottesman, Kitaev and Preskill have proposed a scheme to encode a qubit in a harmonic oscillator, which is called the GKP code. It is designed to be resistant to small shift errors contained in momentum and position quadratures. Thus there's some intrinsic fault tolerance of the GKP code. In this thesis,we propose a method to utilize all the information contained in the continuous shifts, not just simply map a GKP-encoded qubit to a normal qubit. This method enables us to do maximum-likelihood decisions and thus increase fault-tolerance of the GKP code. This thesis shows that the continuous nature of the GKP code is quite useful for quantum error correction.
Quantum information processing promises exponential advantages for certain computational and communication tasks, but practical quantum devices are inherently vulnerable to decoherence and operational imperfections. This thesis develops new algebraic and analytical tools for quantum error correction (QEC) aimed at unifying entanglement-assisted coding theory with operator-algebra frameworks, while also providing mathematically rigorous insights for continuous-variable photonic implementations. First, we introduce the framework of entanglement-assisted operator algebra quantum error correction (EA-OAQEC), extending entanglement-assisted QEC in an operator-algebra context. Built on a stabilizer-based formalism, EA-OAQEC unifies and generalizes subspace, subsystem, and hybrid classical-quantum entanglement-assisted codes. We establish a master error-correction theorem, define a generalized distance notion, and develop constructive techniques including gauge fixing, clean-qubit transformations, and entanglement-assisted gauge-fixing procedures. Second, we study general logical operators: unitaries that preserve a stabilizer codespace beyond the traditional Pauli normalizer. We derive explicit structure theorems for the centralizer and normalizer in the full unitary setting and show how normalizer transformations can be parameterized via classical bit matrix multiply complement (BMMC) permutations. Finally, motivated by photonic quantum computing, we analyze finite-rank compressions of the continuous position and momentum operators relevant to Gottesman-Kitaev-Preskill (GKP) codes. We prove that the spectra of these compressions are governed by the roots of classical Hermite polynomials and connect the compressed operators to physically realizable approximations of displacement operations and finite-energy GKP states.
Code concatenation combines two or more component codes to design larger codes with greater noise resilience. Introducing entanglement assistance to concatenated codes provides a further advantage in terms of improved error rates and beating certain bounds on codes that would otherwise be unbeatable. First, we derive the general expression for the shared entanglement of a concatenated code and show that the number of ebits can depend on the order of concatenating the component entanglement-assisted quantum error-correcting codes (EAQECCs). We further construct families of pairs of EAQECCs such that the number of ebits of the resultant of concatenating the two codes in a given pair is order independent. Second, we derive conditions on code distance under which nonmaximal-entanglement EAQECCs obtained from a classical quaternary Griesmer or Plotkin code saturate the entanglement-assisted (EA) Griesmer or linear EA Plotkin bound, respectively, extending the known result for maximal-entanglement EAQECCs. Furthermore, we present several families of such nonmaximal-entanglement EAQECCs. Third, we derive an EA version of the quantum Griesmer-Rains bound on the number of correctable errors for EAQECCs. Finally, we present families of pairs of EAQECCs such that the violation of the EA Hamming bound by the resultant of concatenating the two codes in a given pair is order dependent.
The continuous-variable (CV) Gaussian no-go theorem fundamentally limits the suppression of Gaussian displacement errors using only Gaussian gates and states. Prior studies have employed Gottesman-Kitaev-Preskill (GKP) states as ancillary qumodes to suppress small Gaussian displacement errors, but when the displacement magnitude becomes large, lattice-crossing events arise beyond the correctable range of the GKP state. To address this issue, we concatenate a Gaussian-noise-suppression circuit with an outer analog Steane code that corrects such occasional lattice-crossing events as well as other abrupt displacement errors. Unlike conventional concatenation, which primarily aims to reduce logical error rates, the Steane-GKP duality in encoding provides complementary protection against both large and small displacement errors, enabling CV error correction within the continuous encoding space and contrasting with earlier approaches that concatenate GKP states with repetition codes for discrete qubit or qudit encodings. Analytical results show that, under infinite squeezing, the concatenated code suppresses the variance of Gaussian displacement errors across all qumodes by up to 50 percent while enabling unbiased correction of lattice-crossing events, with a success probability determined by the ratio between the residual Gaussian error standard deviation and the lattice-crossing magnitude. Even with finite squeezing, the proposed architecture continues to provide Gaussian-error suppression together with lattice-crossing correction, and the presence of the outer analog Steane code relaxes the squeezing requirement of the inner GKP states, indicating near-term experimental feasibility. This work establishes a viable route toward fault-tolerant continuous-variable quantum computation and provides new insight into the design of concatenated CV error-correcting architectures.