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

Finite-energy GKP-QPC architectures for photonic quantum memories and repeaters

Kaustav Chatterjee, Ulrik Lund Andersen

quant-phSubmitted Aug 16, 2026• Announced Aug 18, 2026• 0 citations
arXivHTMLPDF

Abstract

Photonic quantum networks require error-correction architectures that remain useful with finite-energy bosonic states, pure-loss fiber transmission, and explicit resource accounting. In this light, we study a concatenated architecture in which each physical rail is a finitely squeezed Gottesman--Kitaev--Preskill (GKP) qubit transmitted through a pure-loss fiber segment, corrected by teleportation-based GKP error correction with finitely squeezed ancillae, and decoded by an outer quantum parity code (QPC). The GKP layer converts continuous homodyne syndromes into effective rail-level Pauli marginals, while the QPC layer suppresses the residual qubit-level errors. For the concatenated code family considered here, we find a finite-squeezing threshold of $5.06\,\mathrm{dB}$ at zero propagation loss. In the memory setting, the QPC layer lowers the squeezing at which repeated error correction becomes beneficial from $6.7\,\mathrm{dB}$ for bare GKP correction to $5.2\,\mathrm{dB}$ for QPC$(3,3)$ and $4.3\,\mathrm{dB}$ for QPC$(5,5)$, and improves the average-fidelity ratio by up to $75$--$90\%$ in the relevant intermediate-noise regime. In the repeater setting, avoiding pre-amplification gives larger secret-key fractions at moderate squeezing, but also produces an optimal squeezing because highly squeezed GKP peaks become sensitive to loss-induced inward displacement. Resource-normalized rates show that QPC concatenation can exceed the repeaterless PLOB benchmark by orders of magnitude and extend the communication reach, at short repeater spacing, to distances of order $10^4$km with $14$dB squeezing. However, QPC concatenation becomes detrimental when each elementary hop is too lossy. These results provide quantitative design rules for finite-squeezing GKP--QPC quantum memories and repeaters.

Comments
15 pages, 12 figures

Related papers

All-optical quantum memory using bosonic quantum error correction codes

Kaustav Chatterjee, Niklas Budinger, Kian Latifi Yaghin +2 more

Reliable quantum memory is essential for scalable quantum networks and fault-tolerant photonic quantum computing. We present a quantitative analysis of an all-optical quantum memory architecture in which a Gottesman-Kitaev-Preskill (GKP) encoded qubit is stored in a fibre loop and periodically stabilized using teleportation-based error correction. By modelling fibre propagation as a pure-loss channel and representing each correction round as an effective logical map acting on the Bloch vector, we obtain a compact description of the full multi-round memory channel. We show that syndrome decoder optimization plays a crucial role in the experimentally relevant finite-squeezing regime. The optimal decoder deviates from standard square-grid GKP decoder in both tile-size and tile-shape, leading to significant improved logical performance. Using this optimized decoding strategy, we identify a squeezing-dependent optimal spacing between correction nodes that maximizes the memory lifetime. Remarkably, this optimal segment length is largely independent of the desired storage time, providing a simple and practical design rule for fibre-loop quantum memory. We further find a squeezing threshold of approximately 6.7 dB below which intermediate error correction becomes counterproductive, while above threshold the achievable storage time increases approximately exponentially with squeezing. For example, at 17 dB squeezing, storage times exceeding 400 ms can be achieved with logical infidelity below 1%. These results establish clear performance benchmarks and reveal the fundamental trade-off between photon loss, squeezing, and correction frequency in continuous-variable architectures. Our findings provide actionable design principles for near-term photonic quantum memory and clarify the path toward scalable all-optical fault-tolerant quantum storage.

quant-pharXiv:2603.21721•Mar 24, 2026•1 citation

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

All-optical long-distance quantum communication with Gottesman-Kitaev-Preskill qubits

Kosuke Fukui, Rafael N. Alexander, Peter van Loock

Quantum repeaters are a promising platform for realizing long-distance quantum communication and thus could form the backbone of a secure quantum internet, a scalable quantum network, or a distributed quantum computer. Repeater protocols that encode information in single- or multiphoton states are limited by transmission losses and the cost of implementing entangling gates or Bell measurements. In this work, we consider implementing a quantum repeater protocol using Gottesman-Kitaev-Preskill (GKP) qubits. These qubits are natural elements for quantum repeater protocols, because they allow for deterministic Gaussian entangling operations and Bell measurements, which can be implemented at room temperature. The GKP encoding is also capable of correcting small displacement errors. At the cost of additional Gaussian noise, photon loss can be converted into a random displacement error channel by applying a phase-insensitive amplifier. Here we show that a similar conversion can be achieved in two-way repeater protocols by using phase-sensitive amplification applied in the postprocessing of the measurement data, resulting in less overall Gaussian noise per (sufficiently short) repeater segment. We also investigate concatenating the GKP code with higher-level qubit codes while leveraging analog syndrome data, postselection, and path-selection techniques to boost the rate of communication. We compute the secure key rates and find that GKP repeaters can achieve a comparative performance relative to methods based on photonic qubits while using orders-of-magnitude fewer qubits.

arXiv:2011.14876•Physical Review Research•Aug 5, 2021•83 citations

High-Rate and Resource-Efficient All-Photonic Quantum Repeater Architectures with 9 km Repeater Spacing

Ryosuke Shiina, Kenneth Goodenough, Nathan Arnold +1 more

Quantum communication between two distant parties will serve as a cornerstone of the future quantum internet. However, generating enough entangled Bell pairs over long distances is a critical bottleneck. Although photons are ideal carriers of quantum information, overcoming photon loss and the exponential attenuation of signals remains a major challenge. We propose an all-photonic quantum repeater architecture that enables quantum communication over 1,000 km with an equidistant repeater spacing of 9 km. This repeater spacing is enabled by elementary entangled Bell pairs protected through the concatenation of continuous-variable and discrete-variable quantum error correction codes, namely, the bosonic Gottesman-Kitaev-Preskill (GKP) code and the [[7,1,3]] Steane code, whose combination yields a synergistic improvement in robustness against photon loss. This architecture incorporates a new ranking criterion and a multi-reflection mirror-based optical cavity as a free-space photonic memory module, which we model in terms of its length and mirror-reflection efficiency. Additionally, we propose two heuristic construction methods for the elementary entangled Bell pairs. One method introduces up to two-qubit correlated errors within each logical qubit but requires a large number of GKP qubits, while the other allows up to three-qubit correlated errors within each logical qubit but requires fewer GKP qubits. To more accurately capture realistic physical conditions during photonic resource preparation, we include switching-induced imperfections in our simulations, in addition to other standard optical imperfections. In the presence of these imperfections, our realization requires only a few thousand GKP qubits per repeater station per protocol run, a resource requirement significantly smaller than the corresponding resource requirements of prior third-generation all-photonic repeater proposals.

quant-pharXiv:2606.25314•Jun 25, 2026•0 citations

Long-distance quantum secure direct communication with Gottesman-Kitaev-Preskill qubits

Meng-Dong Zhu, Jia‐Wei Ying, Qi Zhang +4 more

The Gottesman-Kitaev-Preskill (GKP) code possesses a lattice periodic structure that enables the effective correction of small displacement errors induced by noise in phase space, which is indispensable for quantum computation. The GKP code was also used to construct a long-distance entanglement channel in quantum repeaters and distribute random keys in quantum key distribution (QKD). Using GKP encoding, we propose a quantum secure direct communication (QSDC) protocol that not only transmits the secret message directly, but also helps protect the safety of communication personnel. The exponential attenuation loss of photons can be overcome by the third-generation quantum repeater. Numerical simulation results demonstrate that secure transmission distance exceeding 1000 km is achievable with a 23 dB squeezing level. Furthermore, we establish a cost-based optimization framework to characterize the trade-off among secure communication distance, secrecy capacity, and repeater resources, enabling optimized repeater deployment and providing a systematic design strategy for scalable quantum repeater architectures. The results demonstrate the potential of combining GKP error correction for long-distance QSDC and quantum networks.

arXiv:2611.11822•Nov 9, 2026•0 citations

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•1 citation
Photonic quantum networks require error-correction architectures that remain useful with finite-energy bosonic states, pure-loss fiber transmission, and explicit resource accounting. In this light, we study a concatenated architecture in which each physical rail is a finitely squeezed Gottesman--Kitaev--Preskill (GKP) qubit transmitted through a pure-loss fiber segment, corrected by teleportation-based GKP error correction with finitely squeezed ancillae, and decoded by an outer quantum parity code (QPC). The GKP layer converts continuous homodyne syndromes into effective rail-level Pauli marginals, while the QPC layer suppresses the residual qubit-level errors. For the concatenated code family considered here, we find a finite-squeezing threshold of 5.06 dB5.06\,\mathrm{dB}5.06dB at zero propagation loss. In the memory setting, the QPC layer lowers the squeezing at which repeated error correction becomes beneficial from 6.7 dB6.7\,\mathrm{dB}6.7dB for bare GKP correction to 5.2 dB5.2\,\mathrm{dB}5.2dB for QPC(3,3)(3,3)(3,3) and 4.3 dB4.3\,\mathrm{dB}4.3dB for QPC(5,5)(5,5)(5,5), and improves the average-fidelity ratio by up to 757575--90%90\%90% in the relevant intermediate-noise regime. In the repeater setting, avoiding pre-amplification gives larger secret-key fractions at moderate squeezing, but also produces an optimal squeezing because highly squeezed GKP peaks become sensitive to loss-induced inward displacement. Resource-normalized rates show that QPC concatenation can exceed the repeaterless PLOB benchmark by orders of magnitude and extend the communication reach, at short repeater spacing, to distances of order 10410^4104km with 141414dB squeezing. However, QPC concatenation becomes detrimental when each elementary hop is too lossy. These results provide quantitative design rules for finite-squeezing GKP--QPC quantum memories and repeaters.
Reliable quantum memory is essential for scalable quantum networks and fault-tolerant photonic quantum computing. We present a quantitative analysis of an all-optical quantum memory architecture in which a Gottesman-Kitaev-Preskill (GKP) encoded qubit is stored in a fibre loop and periodically stabilized using teleportation-based error correction. By modelling fibre propagation as a pure-loss channel and representing each correction round as an effective logical map acting on the Bloch vector, we obtain a compact description of the full multi-round memory channel. We show that syndrome decoder optimization plays a crucial role in the experimentally relevant finite-squeezing regime. The optimal decoder deviates from standard square-grid GKP decoder in both tile-size and tile-shape, leading to significant improved logical performance. Using this optimized decoding strategy, we identify a squeezing-dependent optimal spacing between correction nodes that maximizes the memory lifetime. Remarkably, this optimal segment length is largely independent of the desired storage time, providing a simple and practical design rule for fibre-loop quantum memory. We further find a squeezing threshold of approximately 6.7 dB below which intermediate error correction becomes counterproductive, while above threshold the achievable storage time increases approximately exponentially with squeezing. For example, at 17 dB squeezing, storage times exceeding 400 ms can be achieved with logical infidelity below 1%. These results establish clear performance benchmarks and reveal the fundamental trade-off between photon loss, squeezing, and correction frequency in continuous-variable architectures. Our findings provide actionable design principles for near-term photonic quantum memory and clarify the path toward scalable all-optical fault-tolerant quantum storage.
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.
Quantum repeaters are a promising platform for realizing long-distance quantum communication and thus could form the backbone of a secure quantum internet, a scalable quantum network, or a distributed quantum computer. Repeater protocols that encode information in single- or multiphoton states are limited by transmission losses and the cost of implementing entangling gates or Bell measurements. In this work, we consider implementing a quantum repeater protocol using Gottesman-Kitaev-Preskill (GKP) qubits. These qubits are natural elements for quantum repeater protocols, because they allow for deterministic Gaussian entangling operations and Bell measurements, which can be implemented at room temperature. The GKP encoding is also capable of correcting small displacement errors. At the cost of additional Gaussian noise, photon loss can be converted into a random displacement error channel by applying a phase-insensitive amplifier. Here we show that a similar conversion can be achieved in two-way repeater protocols by using phase-sensitive amplification applied in the postprocessing of the measurement data, resulting in less overall Gaussian noise per (sufficiently short) repeater segment. We also investigate concatenating the GKP code with higher-level qubit codes while leveraging analog syndrome data, postselection, and path-selection techniques to boost the rate of communication. We compute the secure key rates and find that GKP repeaters can achieve a comparative performance relative to methods based on photonic qubits while using orders-of-magnitude fewer qubits.
Quantum communication between two distant parties will serve as a cornerstone of the future quantum internet. However, generating enough entangled Bell pairs over long distances is a critical bottleneck. Although photons are ideal carriers of quantum information, overcoming photon loss and the exponential attenuation of signals remains a major challenge. We propose an all-photonic quantum repeater architecture that enables quantum communication over 1,000 km with an equidistant repeater spacing of 9 km. This repeater spacing is enabled by elementary entangled Bell pairs protected through the concatenation of continuous-variable and discrete-variable quantum error correction codes, namely, the bosonic Gottesman-Kitaev-Preskill (GKP) code and the [[7,1,3]] Steane code, whose combination yields a synergistic improvement in robustness against photon loss. This architecture incorporates a new ranking criterion and a multi-reflection mirror-based optical cavity as a free-space photonic memory module, which we model in terms of its length and mirror-reflection efficiency. Additionally, we propose two heuristic construction methods for the elementary entangled Bell pairs. One method introduces up to two-qubit correlated errors within each logical qubit but requires a large number of GKP qubits, while the other allows up to three-qubit correlated errors within each logical qubit but requires fewer GKP qubits. To more accurately capture realistic physical conditions during photonic resource preparation, we include switching-induced imperfections in our simulations, in addition to other standard optical imperfections. In the presence of these imperfections, our realization requires only a few thousand GKP qubits per repeater station per protocol run, a resource requirement significantly smaller than the corresponding resource requirements of prior third-generation all-photonic repeater proposals.
The Gottesman-Kitaev-Preskill (GKP) code possesses a lattice periodic structure that enables the effective correction of small displacement errors induced by noise in phase space, which is indispensable for quantum computation. The GKP code was also used to construct a long-distance entanglement channel in quantum repeaters and distribute random keys in quantum key distribution (QKD). Using GKP encoding, we propose a quantum secure direct communication (QSDC) protocol that not only transmits the secret message directly, but also helps protect the safety of communication personnel. The exponential attenuation loss of photons can be overcome by the third-generation quantum repeater. Numerical simulation results demonstrate that secure transmission distance exceeding 1000 km is achievable with a 23 dB squeezing level. Furthermore, we establish a cost-based optimization framework to characterize the trade-off among secure communication distance, secrecy capacity, and repeater resources, enabling optimized repeater deployment and providing a systematic design strategy for scalable quantum repeater architectures. The results demonstrate the potential of combining GKP error correction for long-distance QSDC and quantum networks.
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.