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

• URL: http://arxiv.org/abs/2604.09002v1
• Date: Fri, 10 Apr 2026 06:14:47 GMT
• Title: Loss-Tolerant Quantum Communication via Bosonic-GKP-Parity-Encoding
• Abstract summary: Quantum repeaters constitute a promising platform for enabling long distance quantum communication.<n>We focus on the bosonic Gottesman Kitaev Preskill (GKP) code as a natural candidate for loss correction based quantum repeaters.
• Score: 0.34376560669160394
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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, initially we focus on the bosonic Gottesman Kitaev Preskill (GKP) code as a natural candidate for loss correction based quantum repeaters, which can be implemented at room temperature. We demonstrate that transmission loss can be suppressed across three related protocols at the expense of the introduction of logical errors. The third protocol, where a relay-like teleamplifier is applied is optimal. This approach enables medium-distance quantum communication without requiring higher level encoding. We compute the resulting secure key rates while leveraging analog syndrome information. Furthermore, we propose a concatenated Bell state measurement (CBSM) scheme with a modified parity encoding based on GKP qubits, CV measurement and a clipping method that corrects transmission loss without introducing logical errors. This significantly enhances the possible transmission distance. We find that GKP based repeaters can achieve performance comparable to approaches relying on photonic qubits, while requiring orders of magnitude fewer qubits.

Related papers

• Error Correction of Beamsplitter-Generated Entangled GKP States [56.80803785296797]
  A promising bosonic code is the Gottesman-Kitaev-Preskill (GKP) code.<n>We generate entangled states of GKP qubits by interfering two qunaught states, which have a grid structure but carry no logical information, on a beamsplitter.<n>We generate all four Bell states with an average fidelity of 69%, and demonstrate an extension of the entangled state lifetime through the use of quantum error correction.
  arXiv  Detail & Related papers  (2026-05-08T17:01:19Z)
• Explicit decoders using fixed-point amplitude amplification based on QSVT [2.3020018305241337]
  We provide two decoders capable of recovering quantum information when the decoupling condition is satisfied.<n>These are applicable to both entanglement-assisted and non-assisted settings.<n>For any noisy channel, our decoders can be used to achieve a communication rate arbitrarily close to the quantum capacity.
  arXiv  Detail & Related papers  (2024-05-09T18:47:58Z)
• All-photonic GKP-qubit repeater using analog-information-assisted multiplexed entanglement ranking [2.2822295665974845]
  We propose a novel strategy of using the bosonic Gottesman-Kitaev-Preskill code in a two-way repeater architecture with multiplexing. GKP qubits easily admit deterministic two-qubit gates, hence allowing for multiplexing without the need for generating large cluster states. We show that long-distance quantum communication over more than 1000 km is possible even with less than 13 dB of GKP squeezing.
  arXiv  Detail & Related papers  (2023-03-27T05:44:49Z)
• Modular decoding: parallelizable real-time decoding for quantum computers [55.41644538483948]
  Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
  arXiv  Detail & Related papers  (2023-03-08T19:26:10Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Applying the Quantum Error-correcting Codes for Fault-tolerant Blind Quantum Computation [33.51070104730591]
  The Blind Quantum Computation (BQC) is a delegated protocol, which allows a client to rent a remote quantum server to implement desired quantum computations. We propose a fault-tolerant blind quantum computation protocol with quantum error-correcting codes to avoid the accumulation and propagation of qubit errors during the computing.
  arXiv  Detail & Related papers  (2023-01-05T08:52:55Z)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• All-Optical Long-Distance Quantum Communication with Gottesman-Kitaev-Preskill qubits [0.0]
  Quantum repeaters are a promising platform for realizing long-distance quantum communication. In this work, we consider implementing a quantum repeater protocol using Gottesman-Kitaev-Preskill qubits.
  arXiv  Detail & Related papers  (2020-11-30T15:14:34Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.