Gottesman Kitaev Preskill codes gain a dynamical formalism

Researchers Jonathan Pelletier and Baptiste Royer of Université de Sherbrooke have developed a dynamical formalism for Gottesman-Kitaev-Preskill (GKP) codes, extending quantum error correction techniques from qubits to continuous-variable systems. The work introduces dynamical GKP codes by combining continuous-variable lattice encodings with time-dependent measurement dynamics, a method previously limited to qubit systems.

This advancement uses scaled symplectic lattices to generalize GKP codes and adapts established qubit-code machinery for continuous variables, demonstrated with a two-mode square-hexagonal Floquet GKP code that achieves reduced measurement weight while combining the logical gates of existing codes. These results extend an important qubit-code tool to continuous-variable systems and identify a new bridge between discrete stabilizer measurements and continuous homodyne detection.

Scaled Symplectic Lattices Generalize GKP Subsystem Codes

Scaled symplectic lattices now enable the construction of subsystem GKP codes, extending tools previously limited to qubit systems to the realm of continuous-variable quantum computing. This generalization allows researchers to adapt established methods, including those for determining code ancestry, detecting errors and identifying benign errors, to GKP codes, a promising approach for encoding qubits in the continuous phase space of oscillators. The framework establishes a method for efficiently computing the syndrome and distance of a dynamical GKP code using a persistent stabilizer lattice and a bounded inference window.

Specifically, researchers demonstrated that a subset of scaled GKP codes can be understood as subsystem GKP codes, a construction that differs from traditional qudit subsystem codes described by gauge groups. This equivalence allows for the definition of bare, dressed and gauge lattices analogous to those used in qubit systems, providing a unified approach to code construction and analysis.

Irrational symplectic overlap, a phenomenon unique to continuous-variable systems, simplifies to destructive homodyne detection when applied to a single-mode system. This simplification arises from the ability to approximate measurements with small deviations, such as measuring (p/q + ε)λ instead of (p/q)λ, provided that the deviation ε is sufficiently small relative to the signal λ and the measurement precision Δ. The researchers found that if qε|λ| ≤ Δ, then both measurements are approximately equivalent, allowing for practical implementation of complex measurement schemes.

Continuous-Variable Lattice Encoding Mirrors Qubit Stabilizer Structure

This construction builds on the observation that GKP codes, built from discrete lattices within continuous phase space, inherently mirror the algebraic structure of their qubit counterparts. A key challenge in extending dynamical codes to GKP systems lies in the nature of measurement outcomes and lattice behavior; powers of translation operators, unlike their qubit equivalents, are not always trivial stabilizers. This combination offers a potentially easier path towards implementing the full single-qubit Clifford group, a critical step in universal quantum computation.

Two-Mode Square-Hexagonal Floquet GKP Code Reduces Measurement Weight

This improvement stems from the code’s design, which uses the strengths of both square and hexagonal GKP codes within a single framework, simultaneously combining their respective sets of logical gates. The resulting architecture promises a potentially simpler route to implementing the complete single-qubit Clifford group, a foundational set of operations for universal quantum computation. Researchers adapted established techniques from dynamical qubit codes, specifically, the ancestry, detector and benign-error machinery, to the continuous-variable realm of GKP codes.

This adaptation allows for efficient computation of error syndromes, essential for identifying and correcting quantum errors during computation. The square-hexagonal code is a concrete illustration of how these tools can be applied in practice, demonstrating the framework’s versatility. “Using a dynamical GKP code reduces the length of the measurements and should, in theory, improve the fidelity of individual measurement,” the researchers state, highlighting the potential for increased accuracy in quantum operations.

Dynamical GKP Codes Bridge Qubit and Bosonic Error Correction

A key advantage of GKP codes lies in their potential for hardware efficiency. A single, well-protected oscillator can outperform numerous physical qubits. Researchers have now extended the capabilities of these codes by developing a dynamical formalism, previously exclusive to qubit systems, to describe sequences of measurements.

This advancement allows for the calculation of both the update rules and the distance of a given measurement sequence, achieved through generalization of GKP codes to subsystem GKP codes using scaled symplectic lattices. “Besides advantageous stabilizer measurements, dynamical codes naturally describe the code switching mechanism, which is an important tool to combine interesting sets of logical gates,” the authors write, highlighting the potential for improved control and manipulation of quantum information.

Ancestry, Detector, and Benign-Error Machinery Adapted for GKP Codes

This construction relies on tracing measurement outcomes to previous rounds via ancestry, and classifying undetectable errors using benign error generators, concepts previously confined to qubit systems. Implementing these concepts for GKP codes required overcoming differences in the finite nature of qubit stabilizer groups, where every Pauli operator squares to the identity, a property not directly transferable to continuous variables. A corresponding notion of subsystem distance, mirroring that of qudit subsystem codes, was derived to quantify the error resilience of these dynamical GKP codes.

Explicit update rules were then established for the stabilizer lattice, phase vector and logical representatives following each round of translation measurement, forming the basis for a general method to compute the syndrome and distance. The syndrome, denoted as s_t, represents the phase contribution from a spacetime error E and is calculated as the sum of alternating bilinear forms, over each round j.

Undetectable errors, analogous to qubit codes, are those for which the syndrome s_t is zero modulo two. The resulting code design offers a potentially more streamlined path to achieving efficient quantum information processing, building on established techniques and opening new avenues for exploring continuous-variable quantum systems.

Homodyne Detection Emerges from Irrational Symplectic Overlap Measurements

This finding extends tools from qubit error correction to continuous-variable systems, specifically Gottesman-Kitaev-Preskill (GKP) codes, and establishes a precise connection between lattice-based frameworks and native bosonic hardware measurements. The work demonstrates that relaxing the requirement for rational symplectic products between successive measurements allows for efficient classical simulation in certain scenarios. The team’s investigation into these measurements revealed a surprising equivalence. Irrational symplectic product measurements can be understood as homodyne detection, a standard technique in continuous-variable quantum information processing.

This connection is particularly significant because it bridges the gap between the discrete nature of lattice-based GKP codes and the continuous measurements inherent in bosonic systems, potentially streamlining implementation. The researchers illustrate this with the periodic square-hexagonal GKP code, a design that combines the advantages of both square and hexagonal codes, resulting in reduced measurement weight and a more comprehensive set of logical gates.

Both the combined gate sets and the reduction in measurement lengths mirror similar advancements in dynamical qubit codes, suggesting a shared underlying structure and potential for cross-pollination of techniques. “Both the combination of gate sets and reduced measurement lengths are direct dynamical GKP equivalents of the combination of gate set and reduced weight measurements of the dynamical qubit codes,” the authors write, highlighting the parallel development of error correction strategies in both qubit and continuous-variable systems. By establishing this link, the work opens avenues for adapting established qubit-code tools to the continuous-variable realm, potentially accelerating the development of robust and efficient quantum information processing.

GKP Codes Partially Correct Oscillator Loss, A Key Advantage

GKP codes address a primary weakness inherent in systems employing harmonic oscillators, loss, by not only protecting quantum information but also partially correcting the error itself, a capability demonstrated in superconducting circuits, trapped ions and optical systems. This generalization allows for the description of gauge degrees of freedom revealed through specific measurement sequences, information not captured by static codes alone. The two-mode square-hexagonal (SH) Floquet GKP code offers distinct advantages over both its square and hexagonal predecessors, combining the logical gate sets of each while achieving reduced measurement weight.

“The first advantage is that using the SH code enables us to use the gate set of both the square and hexagonal codes,” the authors write, highlighting a potentially more streamlined path to implementing the full single-qubit Clifford group. This combination of reduced measurement weight and expanded gate sets represents an advancement in continuous-variable quantum computing.

Dynamical Codes Offer Low-Weight Measurements for Bosonic Systems

The framework details how stabilizer group modifications directly correspond to changes in the underlying lattice structure, meaning that transitions between measurement rounds are described by static GKP codes with evolving stabilizer lattices. This dynamic approach facilitates combining sets of logical gates, a key advantage for hardware implementation, as code switching between specific static GKP codes enables a complete and high-fidelity set of logical gates.

Code Switching Combines Logical Gates in GKP Quantum Error Correction

Scaled symplectic lattices enable a method for determining the reliability of dynamical GKP codes. The framework details how this distance is calculated across all code switching steps, providing an important metric for assessing the code’s resilience against errors. This functionality mirrors the advantages dynamical qubit codes provide for qubit-based hardware, suggesting a parallel path toward robust quantum computation. Determining the distance of a dynamical GKP code involves two key steps: identifying all undetectable errors and then assigning those errors to a logical class.

More like this

Quantum AlgorithmsFixed operator order beats adaptive screening

Quantum PhysicsLocal feedback controls correlations between distant quantum spins

Quantum Error CorrectionNVIDIA’s Alice & Bob decodes cat-qubit errors on GPUs with NVQLink

Quantum Error CorrectionIBM’s Starling chip could need ten times fewer qubits for error correction