Lattices, Gates, and Curves: GKP codes as a Rosetta stone
Jonathan Conrad, Ansgar G. Burchards, Steven T. Flammia

TL;DR
This paper reveals a deep connection between GKP quantum error-correcting codes, symplectic automorphisms, and algebraic curves, providing a topological and geometric framework for understanding fault tolerance and Clifford gates.
Contribution
It introduces a topological interpretation of GKP codes via surface mapping class groups and links their structure to algebraic curves and moduli spaces, offering new insights into fault tolerance.
Findings
GKP Clifford gates as symplectic automorphisms
Identification of GKP code space with elliptic curve moduli space
Construction of a universal GKP code family for fault tolerance
Abstract
Gottesman-Kitaev-Preskill (GKP) codes are a promising candidate for implementing fault tolerant quantum computation in quantum harmonic oscillator systems such as superconducting resonators, optical photons and trapped ions, and in recent years theoretical and experimental evidence for their utility has steadily grown. It is known that logical Clifford operations on GKP codes can be implemented fault tolerantly using only Gaussian operations, and several theoretical investigations have illuminated their general structure. In this work, we explain how GKP Clifford gates arise as symplectic automorphisms of the corresponding GKP lattice and show how they are identified with the mapping class group of suitable genus surfaces. This correspondence introduces a topological interpretation of fault tolerance for GKP codes and motivates the connection between GKP codes (lattices), their…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · Algorithms and Data Compression
