Achievable rates for concatenated square Gottesman-Kitaev-Preskill codes
arXiv:2505.10499 · doi:10.1103/56vj-z7h1
Abstract
The Gottesman-Kitaev-Preskill (GKP) codes are known to achieve optimal rates under displacement noise and pure loss channels, which establishes theoretical foundations for its optimality. However, such optimal rates are only known to be achieved at a discrete set of noise strength with the current self-dual symplectic lattice construction. In this work, we develop a new coding strategy using concatenated continuous variable - discrete variable encodings to go beyond past results and establish GKP's optimal rate over all noise strengths. In particular, for displacement noise, the rate is obtained through a constructive approach by concatenating GKP codes with a quantum polar code and analog decoding. For pure loss channel, we prove the existence of capacity-achieving GKP codes through a random coding approach. These results highlight the capability of concatenation-based GKP codes and provides new methods for constructing good GKP lattices.
14+15 pages, 6+4 figures
References in corpus (16)
- The Quantum Internet
- Towards a global quantum network
- Analog quantum error correction with encoding a qubit into an oscillator
- Degradability of Bosonic Gaussian channels
- New lower bounds on the non-zero capacity of Pauli Channels
- Quantum Error Correction of Qudits Beyond Break-even
- Encoding qubits in multimode grid states
- Finite Rate QLDPC-GKP Coding Scheme that Surpasses the CSS Hamming Bound
- Quantum capacity and codes for the bosonic loss-dephasing channel
- Quantum capacities of transducers
- Stabilizer subsystem decompositions for single- and multi-mode Gottesman-Kitaev-Preskill codes
- Quantum error correction with higher Gottesman-Kitaev-Preskill codes: minimal measurements and linear optics
- The Zak transform: a framework for quantum computation with the Gottesman-Kitaev-Preskill code
- Analysis of loss correction with the Gottesman-Kitaev-Preskill code
- Good Gottesman-Kitaev-Preskill codes from the NTRU cryptosystem
- The qudit Pauli group: non-commuting pairs, non-commuting sets, and structure theorems