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

Exploring the quantum capacity of a Gaussian random-displacement channel using Gottesman-Kitaev-Preskill codes and maximum-likelihood decoding

Mao Lin, Kyungjoo Noh

Published May 27, 2025• 3 citations
arXivHTMLPDF

Abstract

Determining the quantum capacity of a noisy quantum channel is an important problem in the field of quantum communication theory. In this work, we consider the Gaussian random-displacement channel ${\mathcal{N}}_{\ensuremath{\sigma}}$, a type of bosonic Gaussian channels relevant in various bosonic quantum information processing systems. In particular, we attempt to make progress on the problem of determining the quantum capacity of a Gaussian random-displacement channel by analyzing the error-correction performance of several families of multimode Gottesman-Kitaev-Preskill (GKP) codes. In doing so we analyze the surface-square GKP codes using an efficient and exact maximum-likelihood decoder (MLD) up to a large code distance of $d=39$. We find that the error threshold of the surface-square GKP code is remarkably close to $\ensuremath{\sigma}=1/\sqrt{e}\ensuremath{\simeq}0.6065$ at which the best-known lower bound of the quantum capacity of ${\mathcal{N}}_{\ensuremath{\sigma}}$ vanishes. We also analyze the performance of color-hexagonal GKP codes up to a code distance of $d=13$ using a tensor-network decoder serving as an approximate MLD. By focusing on multimode GKP codes that encode just one logical qubit over multiple bosonic modes, we show that GKP codes can achieve nonzero quantum state transmission rates for a Gaussian random-displacement channel ${\mathcal{N}}_{\ensuremath{\sigma}}$ at larger values of $\ensuremath{\sigma}$ than previously demonstrated. Thus, our work reduces the gap between the quantum communication theoretic bounds and the performance of explicit bosonic quantum error-correcting codes in regards to the quantum capacity of a Gaussian random-displacement channel.

DOI
10.1103/physreva.111.052445

Related papers

Quantum error correction with the toric Gottesman-Kitaev-Preskill code

Christophe Vuillot, Hamed Asasi, Yang Wang +2 more

We examine the performance of the single-mode Gottesman-Kitaev-Preskill (GKP) code and its concatenation with the toric code for a noise model of Gaussian shifts, or displacement errors. We show how one can optimize the tracking of errors in repeated noisy error correction for the GKP code. We do this by examining the maximum-likelihood problem for this setting and its mapping onto a 1D Euclidean path-integral modeling a particle in a random cosine potential. We demonstrate the efficiency of a minimum-energy decoding strategy as a proxy for the path integral evaluation. In the second part of this paper, we analyze and numerically assess the concatenation of the GKP code with the toric code. When toric code measurements and GKP error correction measurements are perfect, we find that by using GKP error information the toric code threshold improves from $10%$ to $14%$. When only the GKP error correction measurements are perfect we observe a threshold at $6%$. In the more realistic setting when all error information is noisy, we show how to represent the maximum likelihood decoding problem for the toric-GKP code as a 3D compact QED model in the presence of a quenched random gauge field, an extension of the random-plaquette gauge model for the toric code. We present a decoder for this problem which shows the existence of a noise threshold at shift-error standard deviation ${\ensuremath{\sigma}}_{0}\ensuremath{\approx}0.243$ for toric code measurements, data errors and GKP ancilla errors. If the errors only come from having imperfect GKP states, then this corresponds to states with just four photons or more. Our last result is a no-go result for linear oscillator codes, encoding oscillators into oscillators. For the Gaussian displacement error model, we prove that encoding corresponds to squeezing the shift errors. This shows that linear oscillator codes are useless for quantum information protection against Gaussian shift errors.

arXiv:1810.00047•Physical Review A•Mar 26, 2019•149 citations

Quantum Capacity Bounds of Gaussian Thermal Loss Channels and Achievable Rates With Gottesman-Kitaev-Preskill Codes

Kyungjoo Noh, Victor V. Albert, Liang Jiang

Gaussian thermal loss channels are of particular importance to quantum communication theory since they model realistic optical communication channels. Except for special cases, the quantum capacity of Gaussian thermal loss channels is not yet quantified completely. In this paper, we provide improved upper bounds of the Gaussian thermal loss channel capacity, both in energy-constrained and unconstrained scenarios. We briefly review Gottesman-Kitaev-Preskill (GKP) codes and discuss their experimental implementation. We then prove, in the energy-unconstrained case, that a family of GKP codes achieves the quantum capacity of Gaussian thermal loss channels up to at most a constant gap from the improved upper bound. In the energy-constrained case, we formulate a biconvex encoding and decoding optimization problem to maximize entanglement fidelity. Then, we solve the biconvex optimization heuristically by an alternating semi-definite programming method and report that, starting from Haar random initial codes, our numerical optimization yields a hexagonal GKP code as an optimal encoding in a practically relevant regime.

arXiv:1801.07271•IEEE Transactions on Information Theory•Oct 5, 2018•162 citations

Analysis of loss correction with the Gottesman-Kitaev-Preskill code

Jacob Hastrup, Ulrik L. Andersen

The Gottesman-Kitaev-Preskill (GKP) code is a promising bosonic quantum error-correcting code, encoding logical qubits into a bosonic mode in such a way that many physically relevant noise types can be corrected effectively. A particularly relevant noise channel is the pure loss channel, which the GKP code is known to protect against. In particular, it is commonly pointed out that losses can be corrected by the GKP code by transforming the losses into random Gaussian displacements through a quantum-limited amplification channel. However, implementing such amplification in practice is not ideal and could easily introduce an additional overhead of noise from associated experimental imperfections. Here, we analyze the performance of teleportation-based GKP error correction against loss in the absence of an amplification channel. We show that amplification is not required to perform GKP error correction and that performing amplification actually worsens the performance for practically relevant parameter regimes.

arXiv:2112.01425•Physical Review A•Nov 15, 2023•21 citations

Quantum error correction with the color-Gottesman-Kitaev-Preskill code

Jiaxuan Zhang, Jian Zhao, Yu-Chun Wu +1 more

The Gottesman-Kitaev-Preskill (GKP) code is an important type of bosonic quantum error-correcting code. Since the GKP code only protects against small shift errors in $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{p}$ and $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{q}$ quadratures, it is necessary to concatenate the GKP code with a stabilizer code for the larger error correction. In this paper, we consider the concatenation of the single-mode GKP code with the two-dimensional (2D) color code (color-GKP code) on the square-octagon lattice. We use the Steane-type scheme with a maximum-likelihood estimation for GKP error correction and show its advantage for the concatenation. In our main paper, the minimum-weight perfect matching algorithm is applied to decode the color-GKP code. Complemented with the continuous-variable information from the GKP code, the threshold of the 2D color code is improved. If only data GKP qubits are noisy, the threshold reaches $\ensuremath{\sigma}\ensuremath{\approx}0.59(\overline{p}\ensuremath{\approx}13.3%)$ compared with $\overline{p}=10.2%$ of the normal 2D color code. If measurements are also noisy, we introduce the generalized restriction decoder on the three-dimensional space-time graph for decoding. The threshold reaches $\ensuremath{\sigma}\ensuremath{\approx}0.46$ when measurements in the GKP error correction are noiseless, and $\ensuremath{\sigma}\ensuremath{\approx}0.24$ when all measurements are noisy. Lastly, the good performance of the generalized restriction decoder is also shown on the normal 2D color code giving the threshold at $3.1%$ under the phenomenological error model.

arXiv:2112.14447•Physical Review A•Dec 20, 2021•18 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•20 citations

Multidimensional Bose quantum error correction based on neural network decoder

Haowen Wang, Yun-Jia Xue, Yingjie Qu +2 more

Abstract Boson quantum error correction is an important means to realize quantum error correction information processing. In this paper, we consider the connection of a single-mode Gottesman-Kitaev-Preskill (GKP) code with a two-dimensional (2D) surface (surface-GKP code) on a triangular quadrilateral lattice. On the one hand, we use a Steane-type scheme with maximum likelihood estimation for surface-GKP code error correction. On the other hand, the minimum-weight perfect matching (MWPM) algorithm is used to decode surface-GKP codes. In the case where only the data GKP qubits are noisy, the threshold reaches σ ≈ 0.5 ( $$\bar{p}\approx 12.3 \%$$ p ¯ ≈ 12.3 % ). If the measurement is also noisy, the threshold is reached σ ≈ 0.25 ( $$\bar{p}\approx 10.02 \%$$ p ¯ ≈ 10.02 % ). More importantly, we introduce a neural network decoder. When the measurements in GKP error correction are noise-free, the threshold reaches σ ≈ 0.78 ( $$\bar{p}\approx 15.12 \%$$ p ¯ ≈ 15.12 % ). The threshold reaches σ ≈ 0.34 ( $$\bar{p}\approx 11.37 \%$$ p ¯ ≈ 11.37 % ) when all measurements are noisy. Through the above optimization method, multi-party quantum error correction will achieve a better guarantee effect in fault-tolerant quantum computing.

npj Quantum Information•Nov 18, 2022•29 citations
Determining the quantum capacity of a noisy quantum channel is an important problem in the field of quantum communication theory. In this work, we consider the Gaussian random-displacement channel N\ensuremathσ{\mathcal{N}}_{\ensuremath{\sigma}}N\ensuremathσ​, a type of bosonic Gaussian channels relevant in various bosonic quantum information processing systems. In particular, we attempt to make progress on the problem of determining the quantum capacity of a Gaussian random-displacement channel by analyzing the error-correction performance of several families of multimode Gottesman-Kitaev-Preskill (GKP) codes. In doing so we analyze the surface-square GKP codes using an efficient and exact maximum-likelihood decoder (MLD) up to a large code distance of d=39d=39d=39. We find that the error threshold of the surface-square GKP code is remarkably close to \ensuremathσ=1/e\ensuremath≃0.6065\ensuremath{\sigma}=1/\sqrt{e}\ensuremath{\simeq}0.6065\ensuremathσ=1/e​\ensuremath≃0.6065 at which the best-known lower bound of the quantum capacity of N\ensuremathσ{\mathcal{N}}_{\ensuremath{\sigma}}N\ensuremathσ​ vanishes. We also analyze the performance of color-hexagonal GKP codes up to a code distance of d=13d=13d=13 using a tensor-network decoder serving as an approximate MLD. By focusing on multimode GKP codes that encode just one logical qubit over multiple bosonic modes, we show that GKP codes can achieve nonzero quantum state transmission rates for a Gaussian random-displacement channel N\ensuremathσ{\mathcal{N}}_{\ensuremath{\sigma}}N\ensuremathσ​ at larger values of \ensuremathσ\ensuremath{\sigma}\ensuremathσ than previously demonstrated. Thus, our work reduces the gap between the quantum communication theoretic bounds and the performance of explicit bosonic quantum error-correcting codes in regards to the quantum capacity of a Gaussian random-displacement channel.
We examine the performance of the single-mode Gottesman-Kitaev-Preskill (GKP) code and its concatenation with the toric code for a noise model of Gaussian shifts, or displacement errors. We show how one can optimize the tracking of errors in repeated noisy error correction for the GKP code. We do this by examining the maximum-likelihood problem for this setting and its mapping onto a 1D Euclidean path-integral modeling a particle in a random cosine potential. We demonstrate the efficiency of a minimum-energy decoding strategy as a proxy for the path integral evaluation. In the second part of this paper, we analyze and numerically assess the concatenation of the GKP code with the toric code. When toric code measurements and GKP error correction measurements are perfect, we find that by using GKP error information the toric code threshold improves from 1010%10 to 1414%14. When only the GKP error correction measurements are perfect we observe a threshold at 66%6. In the more realistic setting when all error information is noisy, we show how to represent the maximum likelihood decoding problem for the toric-GKP code as a 3D compact QED model in the presence of a quenched random gauge field, an extension of the random-plaquette gauge model for the toric code. We present a decoder for this problem which shows the existence of a noise threshold at shift-error standard deviation ${\ensuremath{\sigma}}_{0}\ensuremath{\approx}0.243$ for toric code measurements, data errors and GKP ancilla errors. If the errors only come from having imperfect GKP states, then this corresponds to states with just four photons or more. Our last result is a no-go result for linear oscillator codes, encoding oscillators into oscillators. For the Gaussian displacement error model, we prove that encoding corresponds to squeezing the shift errors. This shows that linear oscillator codes are useless for quantum information protection against Gaussian shift errors.
Gaussian thermal loss channels are of particular importance to quantum communication theory since they model realistic optical communication channels. Except for special cases, the quantum capacity of Gaussian thermal loss channels is not yet quantified completely. In this paper, we provide improved upper bounds of the Gaussian thermal loss channel capacity, both in energy-constrained and unconstrained scenarios. We briefly review Gottesman-Kitaev-Preskill (GKP) codes and discuss their experimental implementation. We then prove, in the energy-unconstrained case, that a family of GKP codes achieves the quantum capacity of Gaussian thermal loss channels up to at most a constant gap from the improved upper bound. In the energy-constrained case, we formulate a biconvex encoding and decoding optimization problem to maximize entanglement fidelity. Then, we solve the biconvex optimization heuristically by an alternating semi-definite programming method and report that, starting from Haar random initial codes, our numerical optimization yields a hexagonal GKP code as an optimal encoding in a practically relevant regime.
The Gottesman-Kitaev-Preskill (GKP) code is a promising bosonic quantum error-correcting code, encoding logical qubits into a bosonic mode in such a way that many physically relevant noise types can be corrected effectively. A particularly relevant noise channel is the pure loss channel, which the GKP code is known to protect against. In particular, it is commonly pointed out that losses can be corrected by the GKP code by transforming the losses into random Gaussian displacements through a quantum-limited amplification channel. However, implementing such amplification in practice is not ideal and could easily introduce an additional overhead of noise from associated experimental imperfections. Here, we analyze the performance of teleportation-based GKP error correction against loss in the absence of an amplification channel. We show that amplification is not required to perform GKP error correction and that performing amplification actually worsens the performance for practically relevant parameter regimes.
The Gottesman-Kitaev-Preskill (GKP) code is an important type of bosonic quantum error-correcting code. Since the GKP code only protects against small shift errors in $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{p}$ and $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{q}$ quadratures, it is necessary to concatenate the GKP code with a stabilizer code for the larger error correction. In this paper, we consider the concatenation of the single-mode GKP code with the two-dimensional (2D) color code (color-GKP code) on the square-octagon lattice. We use the Steane-type scheme with a maximum-likelihood estimation for GKP error correction and show its advantage for the concatenation. In our main paper, the minimum-weight perfect matching algorithm is applied to decode the color-GKP code. Complemented with the continuous-variable information from the GKP code, the threshold of the 2D color code is improved. If only data GKP qubits are noisy, the threshold reaches $\ensuremath{\sigma}\ensuremath{\approx}0.59(\overline{p}\ensuremath{\approx}13.3%)$ compared with p‾=10.2\overline{p}=10.2%p​=10.2 of the normal 2D color code. If measurements are also noisy, we introduce the generalized restriction decoder on the three-dimensional space-time graph for decoding. The threshold reaches $\ensuremath{\sigma}\ensuremath{\approx}0.46$ when measurements in the GKP error correction are noiseless, and $\ensuremath{\sigma}\ensuremath{\approx}0.24$ when all measurements are noisy. Lastly, the good performance of the generalized restriction decoder is also shown on the normal 2D color code giving the threshold at 3.13.1%3.1 under the phenomenological error model.
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.
Abstract Boson quantum error correction is an important means to realize quantum error correction information processing. In this paper, we consider the connection of a single-mode Gottesman-Kitaev-Preskill (GKP) code with a two-dimensional (2D) surface (surface-GKP code) on a triangular quadrilateral lattice. On the one hand, we use a Steane-type scheme with maximum likelihood estimation for surface-GKP code error correction. On the other hand, the minimum-weight perfect matching (MWPM) algorithm is used to decode surface-GKP codes. In the case where only the data GKP qubits are noisy, the threshold reaches σ ≈ 0.5 ( pˉ≈12.3%\bar{p}\approx 12.3 \%pˉ​≈12.3% p ¯ ≈ 12.3 % ). If the measurement is also noisy, the threshold is reached σ ≈ 0.25 ( pˉ≈10.02%\bar{p}\approx 10.02 \%pˉ​≈10.02% p ¯ ≈ 10.02 % ). More importantly, we introduce a neural network decoder. When the measurements in GKP error correction are noise-free, the threshold reaches σ ≈ 0.78 ( pˉ≈15.12%\bar{p}\approx 15.12 \%pˉ​≈15.12% p ¯ ≈ 15.12 % ). The threshold reaches σ ≈ 0.34 ( pˉ≈11.37%\bar{p}\approx 11.37 \%pˉ​≈11.37% p ¯ ≈ 11.37 % ) when all measurements are noisy. Through the above optimization method, multi-party quantum error correction will achieve a better guarantee effect in fault-tolerant quantum computing.