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

Limitations of local update recovery in stabilizer-GKP codes: a quantum optimal transport approach

Robert König, Cambyse Rouzé

Published Sep 28, 2023• 2 citations
arXivHTMLPDF

Abstract

Local update recovery seeks to maintain quantum information by applying local correction maps alternating with and compensating for the action of noise. Motivated by recent constructions based on quantum LDPC codes in the finite-dimensional setting, we establish an analytic upper bound on the fault-tolerance threshold for concatenated GKP-stabilizer codes with local update recovery. Our bound applies to noise channels that are tensor products of one-mode beamsplitters with arbitrary environment states, capturing, in particular, photon loss occurring independently in each mode. It shows that for loss rates above a threshold given explicitly as a function of the locality of the recovery maps, encoded information is lost at an exponential rate. This extends an early result by Razborov from discrete to continuous variable (CV) quantum systems. To prove our result, we study a metric on bosonic states akin to the Wasserstein distance between two CV density functions, which we call the bosonic Wasserstein distance. It can be thought of as a CV extension of a quantum Wasserstein distance of order 1 recently introduced by De Palma et al. in the context of qudit systems, in the sense that it captures the notion of locality in a CV setting. We establish several basic properties, including a relation to the trace distance and diameter bounds for states with finite average photon number. We then study its contraction properties under quantum channels, including tensorization, locality and strict contraction under beamsplitter-type noise channels. Due to the simplicity of its formulation, and the established wide applicability of its finite-dimensional counterpart, we believe that the bosonic Wasserstein distance will become a versatile tool in the study of CV quantum systems.

DOI
10.48550/arxiv.2309.16241

Related papers

Performance and structure of single-mode bosonic codes

Victor V. Albert, Kyungjoo Noh, Kasper Duivenvoorden +9 more

The early Gottesman, Kitaev, and Preskill (GKP) proposal for encoding a qubit in an oscillator has recently been followed by cat- and binomial-code proposals. Numerically optimized codes have also been proposed, and we introduce codes of this type here. These codes have yet to be compared using the same error model; we provide such a comparison by determining the entanglement fidelity of all codes with respect to the bosonic pure-loss channel (i.e., photon loss) after the optimal recovery operation. We then compare achievable communication rates of the combined encoding-error-recovery channel by calculating the channel's hashing bound for each code. Cat and binomial codes perform similarly, with binomial codes outperforming cat codes at small loss rates. Despite not being designed to protect against the pure-loss channel, GKP codes significantly outperform all other codes for most values of the loss rate. We show that the performance of GKP and some binomial codes increases monotonically with increasing average photon number of the codes. In order to corroborate our numerical evidence of the cat-binomial-GKP order of performance occurring at small loss rates, we analytically evaluate the quantum error-correction conditions of those codes. For GKP codes, we find an essential singularity in the entanglement fidelity in the limit of vanishing loss rate. In addition to comparing the codes, we draw parallels between binomial codes and discrete-variable systems. First, we characterize one- and two-mode binomial as well as multiqubit permutation-invariant codes in terms of spin-coherent states. Such a characterization allows us to introduce check operators and error-correction procedures for binomial codes. Second, we introduce a generalization of spin-coherent states, extending our characterization to qudit binomial codes and yielding a multiqudit code.

arXiv:1708.05010•Physical Review A•Mar 30, 2018•325 citations

Stability of Quantum LDPC States under Local Pauli Noise

Tai-Hsuan Yang, Andrew D. Kim, Akash Vijay +1 more

Quantum low-density parity-check (qLDPC) codes have a canonical mixed state---the normalized projector onto the code space---that lies at the intersection of quantum error correction and quantum many-body physics, yet the stability of its information-theoretic structure under local noise remains poorly understood. Recent progress on mixed-state phases of matter has identified the spatial decay of conditional mutual information (CMI) $I(A:C|B)$ as a key diagnostic of such stability, analogous to the role of the spectral gap for quantum ground states. We prove that, for the normalized code-projector state of a $\mathbb{Z}_d$ qLDPC stabilizer code under local Pauli noise, the CMI across a buffer $B$ separating $A$ from $C$ decays exponentially with the width of $B$ in two complementary noise regimes independent of system size. At weak noise, this holds for full-system tripartitions, where correlations between the two sides require an error cluster to cross the buffer, an exponentially unlikely event. At strong noise, exponential decay holds whenever the buffer supports no logical operator, since correlations can persist only along rare chains of buffer qudits that remain informative. Under an additional space-uniformity assumption, we establish the robustness of Levin--Wen topological entropy. On finite-dimensional lattices of size $n$, the weak-noise bound further implies a constant-layer quasi-local Petz recovery channel of range $O(\poly(\log n)/\varepsilon)$ that recovers the noiseless state within trace-distance error $\varepsilon$. Both CMI bounds apply to general qLDPC interaction graphs, including geometries where such constant-depth quasi-local recovery need not exist. Thus, the exponential decay of the noise-induced CMI provides a general criterion for mixed-state phase stability.

quant-pharXiv:2610.22357•Oct 16, 2026•1 citation

Equivalence of approximate Gottesman-Kitaev-Preskill codes

Takaya Matsuura, Hayata Yamasaki, Masato Koashi

The Gottesman-Kitaev-Preskill (gkp) quantum error-correcting code attracts much attention in continuous variable (CV) quantum computation and CV quantum communication due to the simplicity of error-correcting routines and the high tolerance against Gaussian errors. Since the gkp code state should be regarded as a limit of physically meaningful approximate ones, various approximations have been developed until today, but explicit relations among them are still unclear. In this paper, we rigorously prove the equivalence of these approximate gkp codes with an explicit correspondence of the parameters. We also propose a standard form of the approximate code states in the position representation, which enables us to derive closed-form expressions for the Wigner function, inner products, and the average photon number in terms of the theta functions. Our results serve as fundamental tools for further analyses of fault-tolerant quantum computation and channel coding using approximate gkp codes.

arXiv:1910.08301•Physical Review A•Sep 15, 2020•79 citations

Probabilistic Error Cancellation for Single-Mode Gottesman-Kitaev-Preskill Codes

Victoria Wadewitz, Alessandro Ciani

In order to solve practical problems on a quantum computer, it is necessary to use fault-tolerant quantum error correction schemes to overcome noise: the errors arising from imperfections in physical components. The Gottesman-Kitaev-Preskill (GKP) code aims at achieving this in a hardware efficient manner by encoding finite-dimensional logical subspaces in the Hilbert space of one or more continuous variable modes. In near term implementations, however, it is not feasible to eliminate errors entirely, so it is natural to also employ alternative error mitigation techniques together with error correction. In this work, we study a quantum error mitigation method known as probabilistic error cancellation in the context of the GKP code. We compare Steane-type and teleportation-based GKP error correction, and calculate the sampling overheads associated with the technique for square and hexagonal GKP codes. We employ the stabilizer subsystem decomposition for GKP codes to obtain an effective logical channel for noisy operations that is used to express the ideal one of a target logical unitary. We consider noise from finite squeezing on the data and the two ancilla modes, needed for error correction, and examine the relationship between the sampling overhead and the noise for different decoding methods. Our results are calculated for single- and two-qubit GKP Clifford gates and one round of error correction, and show the nontrivial combination of error correction and mitigation in continuous variable codes.

quant-pharXiv:2609.17095•Sep 16, 2026•0 citations

Stabilizer Subsystem Decompositions for Single- and Multimode Gottesman-Kitaev-Preskill Codes

Mackenzie H. Shaw, Andrew C. Doherty, Arne L. Grimsmo

The Gottesman-Kitaev-Preskill (GKP) error-correcting code encodes a finite-dimensional logical space in one or more bosonic modes, and has recently been demonstrated in trapped ions and superconducting microwave cavities. In this work we introduce a new subsystem decomposition for GKP codes that we call the stabilizer subsystem decomposition, analogous to the usual approach to quantum stabilizer codes. The decomposition has the defining property that a partial trace over the nonlogical stabilizer subsystem is equivalent to an ideal decoding of the logical state, distinguishing it from previous GKP subsystem decompositions. We describe how to decompose arbitrary states across the subsystem decomposition using a set of transformations that move between the decompositions of different GKP codes. Besides providing a convenient theoretical view on GKP codes, such a decomposition is also of practical use. We use the stabilizer subsystem decomposition to efficiently simulate noise acting on single-mode GKP codes, and in contrast to more conventional Fock basis simulations, we are able to consider essentially arbitrarily large photon numbers for realistic noise channels, such as loss and dephasing. Published by the American Physical Society 2024

arXiv:2210.14919•PRX Quantum•Feb 23, 2024•30 citations

Loss-Tolerant Quantum Communication via Bosonic-GKP-Parity-Encoding

S. Nibedita Swain, Timothy C. Ralph

Quantum repeaters constitute a promising platform for enabling long-distance quantum communication and may ultimately serve as the backbone of a secure quantum internet, a scalable quantum network, or a distributed quantum computer. An efficient approach to encoding qubits within an error correcting code is provided by bosonic codes, in which even a single oscillator mode can function as a sufficiently large physical system. In this work, we initially investigate the bosonic Gottesman Kitaev Preskill (GKP) code as a promising platform for loss correcting quantum repeaters, compatible with room temperature implementation, and analyse how loss and other noise sources propagate through the circuit using Heisenberg evolution. We analyse three quantum repeater protocols in which transmission loss is suppressed at the cost of logical errors, identifying a relay-like teleamplifier as the optimal scheme. This enables long distance quantum communication via densely packed nodes without higher-level encoding, and we evaluate the resulting secure key rates exploiting analog syndrome information. Furthermore, we propose a concatenated Bell-state measurement (CBSM) scheme with a modified parity encoding based on GKP qubits, CV measurement with teleamplifier and a clipping method that corrects transmission loss without introducing logical errors. This significantly enhances the possible secure key distance. We find that GKP based repeaters can achieve performance comparable to approaches relying on photonic qubits, while requiring orders of magnitude fewer qubits. Our parity encoded GKP repeater protocol achieves a substantially higher secret key rate than existing GKP based repeater schemes while maintaining a comparable resource overhead.

quant-pharXiv:2604.09002•Apr 13, 2026•1 citation
Local update recovery seeks to maintain quantum information by applying local correction maps alternating with and compensating for the action of noise. Motivated by recent constructions based on quantum LDPC codes in the finite-dimensional setting, we establish an analytic upper bound on the fault-tolerance threshold for concatenated GKP-stabilizer codes with local update recovery. Our bound applies to noise channels that are tensor products of one-mode beamsplitters with arbitrary environment states, capturing, in particular, photon loss occurring independently in each mode. It shows that for loss rates above a threshold given explicitly as a function of the locality of the recovery maps, encoded information is lost at an exponential rate. This extends an early result by Razborov from discrete to continuous variable (CV) quantum systems. To prove our result, we study a metric on bosonic states akin to the Wasserstein distance between two CV density functions, which we call the bosonic Wasserstein distance. It can be thought of as a CV extension of a quantum Wasserstein distance of order 1 recently introduced by De Palma et al. in the context of qudit systems, in the sense that it captures the notion of locality in a CV setting. We establish several basic properties, including a relation to the trace distance and diameter bounds for states with finite average photon number. We then study its contraction properties under quantum channels, including tensorization, locality and strict contraction under beamsplitter-type noise channels. Due to the simplicity of its formulation, and the established wide applicability of its finite-dimensional counterpart, we believe that the bosonic Wasserstein distance will become a versatile tool in the study of CV quantum systems.
The early Gottesman, Kitaev, and Preskill (GKP) proposal for encoding a qubit in an oscillator has recently been followed by cat- and binomial-code proposals. Numerically optimized codes have also been proposed, and we introduce codes of this type here. These codes have yet to be compared using the same error model; we provide such a comparison by determining the entanglement fidelity of all codes with respect to the bosonic pure-loss channel (i.e., photon loss) after the optimal recovery operation. We then compare achievable communication rates of the combined encoding-error-recovery channel by calculating the channel's hashing bound for each code. Cat and binomial codes perform similarly, with binomial codes outperforming cat codes at small loss rates. Despite not being designed to protect against the pure-loss channel, GKP codes significantly outperform all other codes for most values of the loss rate. We show that the performance of GKP and some binomial codes increases monotonically with increasing average photon number of the codes. In order to corroborate our numerical evidence of the cat-binomial-GKP order of performance occurring at small loss rates, we analytically evaluate the quantum error-correction conditions of those codes. For GKP codes, we find an essential singularity in the entanglement fidelity in the limit of vanishing loss rate. In addition to comparing the codes, we draw parallels between binomial codes and discrete-variable systems. First, we characterize one- and two-mode binomial as well as multiqubit permutation-invariant codes in terms of spin-coherent states. Such a characterization allows us to introduce check operators and error-correction procedures for binomial codes. Second, we introduce a generalization of spin-coherent states, extending our characterization to qudit binomial codes and yielding a multiqudit code.
Quantum low-density parity-check (qLDPC) codes have a canonical mixed state---the normalized projector onto the code space---that lies at the intersection of quantum error correction and quantum many-body physics, yet the stability of its information-theoretic structure under local noise remains poorly understood. Recent progress on mixed-state phases of matter has identified the spatial decay of conditional mutual information (CMI) I(A:C∣B)I(A:C|B)I(A:C∣B) as a key diagnostic of such stability, analogous to the role of the spectral gap for quantum ground states. We prove that, for the normalized code-projector state of a Zd\mathbb{Z}_dZd​ qLDPC stabilizer code under local Pauli noise, the CMI across a buffer BBB separating AAA from CCC decays exponentially with the width of BBB in two complementary noise regimes independent of system size. At weak noise, this holds for full-system tripartitions, where correlations between the two sides require an error cluster to cross the buffer, an exponentially unlikely event. At strong noise, exponential decay holds whenever the buffer supports no logical operator, since correlations can persist only along rare chains of buffer qudits that remain informative. Under an additional space-uniformity assumption, we establish the robustness of Levin--Wen topological entropy. On finite-dimensional lattices of size nnn, the weak-noise bound further implies a constant-layer quasi-local Petz recovery channel of range $O(\poly(\log n)/\varepsilon)$ that recovers the noiseless state within trace-distance error ε\varepsilonε. Both CMI bounds apply to general qLDPC interaction graphs, including geometries where such constant-depth quasi-local recovery need not exist. Thus, the exponential decay of the noise-induced CMI provides a general criterion for mixed-state phase stability.
The Gottesman-Kitaev-Preskill (gkp) quantum error-correcting code attracts much attention in continuous variable (CV) quantum computation and CV quantum communication due to the simplicity of error-correcting routines and the high tolerance against Gaussian errors. Since the gkp code state should be regarded as a limit of physically meaningful approximate ones, various approximations have been developed until today, but explicit relations among them are still unclear. In this paper, we rigorously prove the equivalence of these approximate gkp codes with an explicit correspondence of the parameters. We also propose a standard form of the approximate code states in the position representation, which enables us to derive closed-form expressions for the Wigner function, inner products, and the average photon number in terms of the theta functions. Our results serve as fundamental tools for further analyses of fault-tolerant quantum computation and channel coding using approximate gkp codes.
In order to solve practical problems on a quantum computer, it is necessary to use fault-tolerant quantum error correction schemes to overcome noise: the errors arising from imperfections in physical components. The Gottesman-Kitaev-Preskill (GKP) code aims at achieving this in a hardware efficient manner by encoding finite-dimensional logical subspaces in the Hilbert space of one or more continuous variable modes. In near term implementations, however, it is not feasible to eliminate errors entirely, so it is natural to also employ alternative error mitigation techniques together with error correction. In this work, we study a quantum error mitigation method known as probabilistic error cancellation in the context of the GKP code. We compare Steane-type and teleportation-based GKP error correction, and calculate the sampling overheads associated with the technique for square and hexagonal GKP codes. We employ the stabilizer subsystem decomposition for GKP codes to obtain an effective logical channel for noisy operations that is used to express the ideal one of a target logical unitary. We consider noise from finite squeezing on the data and the two ancilla modes, needed for error correction, and examine the relationship between the sampling overhead and the noise for different decoding methods. Our results are calculated for single- and two-qubit GKP Clifford gates and one round of error correction, and show the nontrivial combination of error correction and mitigation in continuous variable codes.
The Gottesman-Kitaev-Preskill (GKP) error-correcting code encodes a finite-dimensional logical space in one or more bosonic modes, and has recently been demonstrated in trapped ions and superconducting microwave cavities. In this work we introduce a new subsystem decomposition for GKP codes that we call the stabilizer subsystem decomposition, analogous to the usual approach to quantum stabilizer codes. The decomposition has the defining property that a partial trace over the nonlogical stabilizer subsystem is equivalent to an ideal decoding of the logical state, distinguishing it from previous GKP subsystem decompositions. We describe how to decompose arbitrary states across the subsystem decomposition using a set of transformations that move between the decompositions of different GKP codes. Besides providing a convenient theoretical view on GKP codes, such a decomposition is also of practical use. We use the stabilizer subsystem decomposition to efficiently simulate noise acting on single-mode GKP codes, and in contrast to more conventional Fock basis simulations, we are able to consider essentially arbitrarily large photon numbers for realistic noise channels, such as loss and dephasing. Published by the American Physical Society 2024
Quantum repeaters constitute a promising platform for enabling long-distance quantum communication and may ultimately serve as the backbone of a secure quantum internet, a scalable quantum network, or a distributed quantum computer. An efficient approach to encoding qubits within an error correcting code is provided by bosonic codes, in which even a single oscillator mode can function as a sufficiently large physical system. In this work, we initially investigate the bosonic Gottesman Kitaev Preskill (GKP) code as a promising platform for loss correcting quantum repeaters, compatible with room temperature implementation, and analyse how loss and other noise sources propagate through the circuit using Heisenberg evolution. We analyse three quantum repeater protocols in which transmission loss is suppressed at the cost of logical errors, identifying a relay-like teleamplifier as the optimal scheme. This enables long distance quantum communication via densely packed nodes without higher-level encoding, and we evaluate the resulting secure key rates exploiting analog syndrome information. Furthermore, we propose a concatenated Bell-state measurement (CBSM) scheme with a modified parity encoding based on GKP qubits, CV measurement with teleamplifier and a clipping method that corrects transmission loss without introducing logical errors. This significantly enhances the possible secure key distance. We find that GKP based repeaters can achieve performance comparable to approaches relying on photonic qubits, while requiring orders of magnitude fewer qubits. Our parity encoded GKP repeater protocol achieves a substantially higher secret key rate than existing GKP based repeater schemes while maintaining a comparable resource overhead.