Gottesman-Kitaev-Preskill codes: A lattice perspective

Abstract

We examine general Gottesman-Kitaev-Preskill (GKP) codes for continuous-variable quantum error correction, including concatenated GKP codes, through the lens of lattice theory, in order to better understand the structure of this class of stabilizer codes. We derive formal bounds on code parameters, show how different decoding strategies are precisely related, propose new ways to obtain GKP codes by means of glued lattices and the tensor product of lattices and point to natural resource savings that have remained hidden in recent approaches. We present general results that we illustrate through examples taken from different classes of codes, including scaled self-dual GKP codes and the concatenated surface-GKP code.

30 pages, 5 figures; Comments welcome!

References in corpus (6)

• Low-distance Surface Codes under Realistic Quantum Noise
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Quantum Error Correction with the Gottesman-Kitaev-Preskill Code
• Analog quantum error correction with encoding a qubit into an oscillator
• Low overhead fault-tolerant quantum error correction with the surface-GKP code
• Phase-space methods for representing, manipulating, and correcting Gottesman-Kitaev-Preskill qubits