Searcharxiv⌕ Search

arXiv subjects

Ansgar G. Burchards

Publications and source records attributed to Ansgar G. Burchards.

5 recordsLinked to original sources

Lattices, Gates, and Curves: GKP codes as a Rosetta stone

We explain how GKP Clifford gates arise as symplectic automorphisms of the corresponding GKP lattice and show that, for scaled codes of type $D=dI_n$, their integral action agrees with the action of the mapping class group of a genus-$n$ surface on first homology. This correspondence introduces a topological interpretation of fault tolerance for GKP codes and motivates the connection between GKP codes (lattices), their Clifford gates, and algebraic curves, which we explore in depth. For a single-mode GKP code, we identify the space of oriented fixed-covolume lattice realizations with $S^3 - K$, the three sphere $S^3$ with a trefoil knot $K$ removed, and explain how logical degrees of freedom arise from the choice of a level structure on the corresponding curves. Specified Clifford implementations define loops in the space of lattices whose trefoil linking number is a topological invariant. Finally, we relate our observations to the idea of fiber bundle fault tolerance as proposed by Gottesman and Zhang for the GKP code, where logical Clifford and Pauli operations of the single-mode GKP code arise as the monodromy representation of a finite covering of the space of nonzero-distance GKP codes.

quant-ph↗

Designing fault-tolerant circuits using detector error models

Quantum error-correcting codes, such as subspace, subsystem, and Floquet codes, are typically constructed within the stabilizer formalism, which does not fully capture the idea of fault-tolerance needed for practical quantum computing applications. In this work, we explore the remarkably powerful formalism of detector error models, which fully captures fault-tolerance at the circuit level. We introduce the detector error model formalism in a pedagogical manner and provide several examples. Additionally, we apply the formalism to three different levels of abstraction in the engineering cycle of fault-tolerant circuit designs: finding robust syndrome extraction circuits, identifying efficient measurement schedules, and constructing fault-tolerant procedures. We enhance the surface code's resistance to measurement errors, devise short measurement schedules for color codes, and implement a more efficient fault-tolerant method for measuring logical operators.

quant-ph↗

Fiber Bundle Fault Tolerance of GKP Codes

We investigate multi-mode GKP (Gottesman--Kitaev--Preskill) quantum error-correcting codes from a geometric perspective. First, we construct their moduli space as a quotient of groups and exhibit it as a fiber bundle over the moduli space of symplectically integral lattices. We then establish the Gottesman--Zhang conjecture for logical GKP Clifford operations, showing that all such gates arise from parallel transport with respect to a flat connection on this space. Specifically, non-trivial Clifford operations correspond to topologically non-contractible paths on the space of GKP codes, while logical identity operations correspond to contractible paths.

quant-ph↗

Continuous-variable designs and design-based shadow tomography from random lattices

We investigate state designs for continuous-variable quantum systems using the aid of lattice-like quantum states. These are code states of Gottesman-Kitaev-Preskill (GKP) codes. We show that for an n-mode system, the set of all GKP states forms a rigged continuous-variable state 2-design. We use these lattice state designs to construct a continuous variable shadow tomography protocol, derive sample complexity bounds for both global- and local GKP shadows under reasonable physical assumptions, and provide the physical gadgets needed to implement this protocol.

quant-ph↗

Continuous-Variable Quantum MacWilliams Identities

We derive bounds on general quantum error correcting codes against the displacement noise channel. The bounds limit the distances attainable by codes and also apply in an approximate setting. Our main result is a quantum analogue of the classical Cohn-Elkies bound on sphere packing densities attainable in Euclidean space. We further derive a quantum version of Levenshtein's sphere packing bound and argue that Gottesman--Kitaev--Preskill (GKP) codes based on the $E_8$ and Leech lattices achieve optimal distances. The main technical tool is a continuous-variable version of the quantum MacWilliams identities, which we introduce. The identities relate a pair of weight distributions which can be obtained for any two trace-class operators. General properties of these weight distributions are discussed, along with several examples.

quant-ph↗