Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Replication package: Bosonic codes from compact phase spaces

Roberts, David, Aaron Slipper, Alireza Parhizkar, Victor V. Albert, Mohammad Hafezi

Published Aug 31, 2026• 0 citations
Publisher

Abstract

Replication package — code, Jupyter notebooks, and precomputed data — for "Bosonic codes from compact phase spaces" (D. Roberts, A. Slipper, A. Parhizkar, V. V. Albert, and M. Hafezi). The paper develops the correspondence between Gottesman–Kitaev–Preskill (GKP) codes and elliptic curves — established concurrently by Conrad, Burchards & Flammia [1] and the present authors [2] — and extends it, via geometric quantization, to bosonic quantum codes associated with algebraic curves of arbitrary genus. Following geometric quantization, a quantized phase space is a family of coherent states holomorphically parametrized by a complex manifold; this work realizes the phase spaces parametrized by a compact Riemann surface. Code states are then holomorphic sections of a line bundle over that surface (automorphic forms), and the code dimension is fixed by Riemann–Roch — recovering GKP codes when the surface is an elliptic curve (genus 1) and yielding a new class of hyperbolic CV quantum codes at genus greater than or equal to 2. The package also numerically illustrates the central no-go result: an amenability dichotomy under which arbitrarily accurate approximate code words exist at genus one but not at any higher genus. The genus-two Bolza surface — the most symmetric genus-two curve — serves as the explicit worked example throughout, and is what the numerics compute. For that example the package: constructs the k=2 code space, verifies the Veronese factorization Y^2 = XZ that generates the full tower of code spaces, and renders the Husimi Q-functions of the code basis (main-text Fig. 2); builds the Poincaré theta series spanning the code space and studies their convergence; verifies the weight-2 canonical gate representation — V_R, V_U in the main text, ρ(R), ρ(U) in the notebooks — for the automorphism group Aut(C) = GL(2, F_3), symbolically and numerically; derives the circuit-QED conditional two-mode-squeezing Hamiltonian via a lab-frame dispersive Schrieffer–Wolff reduction; simulates the conditional-kick stabilization dynamics (main-text Fig. 3) and diagonalizes the stabilizer Hamiltonian to exhibit a spectral gap, a genus-two instance of the amenability dichotomy. Every computational figure in the main text and Supplemental Material is regenerated; the two non-computational schematics (main-text Fig. 1 and the SM circuit diagram) are illustrations, not code output. See README.md for the full file-to-figure map. [1] https://arxiv.org/abs/2407.03270 (2024)[2] https://github.com/droberts01/higher-genus-gkp (2024)

DOI
10.5281/zenodo.20585487

Related papers

Bosonic codes from compact phase spaces

David Roberts, Aaron Slipper, Alireza Parhizkar +2 more

We present the algebraic structure of bosonic quantum error-correcting codes on genus-two Riemann surfaces. We explicitly construct the code words as automorphic forms and analytically generate the full tower of code spaces at all weights. We prove a fundamental no-go theorem: for any genus greater than one, the stabilizer group is non-amenable, forcing a strictly positive spectral gap in the stabilizer Hamiltonian. Consequently, no normalizable quantum state can satisfy all stabilizer conditions. This sharply contrasts with standard Gottesman-Kitaev-Preskill (GKP) codes, where the amenability of the stabilizer group $\mathbb{Z}^2$ permits approximate code words with arbitrary precision.

quant-pharXiv:2608.31156•Sep 1, 2026•0 citations

Complex abelian varieties and quantum error correction: a mathematical framework for GKP codes

Maxence Mayrand, Baptiste Royer

We study a class of quantum error-correcting codes through the geometry of complex abelian varieties. These codes, introduced by Gottesman--Kitaev--Preskill, are built from symplectically integral lattices and therefore naturally define polarized complex abelian varieties. We give a precise mathematical formulation of this relationship and extend it to a dictionary between the main structures of GKP code theory and classical objects in the theory of abelian varieties. For instance, under this dictionary, the finite-dimensional code space becomes the space of theta functions $H^0(X, L)$, logical Pauli gates arise from the theta group, passive logical Clifford gates correspond to automorphisms of the polarized abelian variety, and concatenation with stabilizer codes corresponds to isogeny. We also prove several key results that give precise mathematical formulations of statements about these codes that often appear in heuristic form in the physics literature. In particular, we prove that the encoding is asymptotically isometric, that every logical Clifford gate is realized by a Gaussian unitary, and that, for noise of small variance, the failure probability is governed to first order by the shortest nontrivial displacement in the kernel of the polarization isogeny, a systolic invariant of the underlying polarization. This leads naturally to optimization problems on the moduli space of polarized abelian varieties.

math.AGCross-listedarXiv:2605.28784•May 28, 2026•0 citations

Simulation code for "Holonomic quantum gates via continuous measurement in bosonic codes: GKP and cat states"

Todd A. Brun, Anirudh Lanka

This repository contains the numerical simulation code supporting the paper “Holonomic quantum gates via continuous measurement in bosonic codes: GKP and cat states” by Juan Garcia-Nila, Anirudh Lanka, and Todd A. Brun. The code implements measurement-based holonomic logical gates for four-component cat codes and Gottesman–Kitaev–Preskill (GKP) codes. It includes simulations of the logical gate trajectories, Wigner-function evolution, target-state fidelities, holonomy infidelities, and leakage under finite-strength continuous measurement. The associated paper develops explicit continuously monitored holonomic protocols for non-Clifford logical gates in bosonic codes. Time-dependent stabilizer measurements Zeno-confine the state to an evolving codespace, producing logical operations through geometric holonomies while retaining access to error-syndrome information. Associated preprint: https://arxiv.org/abs/2608.11369

•Aug 11, 2026•0 citations

Graded Quantum Codes

Tony Shaska

This work develops a geometric framework for constructing quantum error-correcting codes from weighted projective and orbifold structures, integrating algebraic geometry, divisor theory, and the CSS stabilizer formalism. Beginning with weighted projective spaces and their associated height and defect structures, the study builds classical AG-codes via evaluation on divisors adapted to orbifold singularities. These classical codes are lifted to quantum codes using self-orthogonality conditions and homological constructions, yielding a class of Quantum Weighted Algebraic Geometric (QWAG) codes. A central contribution is the formulation of a refined Singleton-type bound motivated by orbifold defect terms and effective genus corrections. While the classical quantum Singleton bound is recovered in the smooth case, the orbifold setting suggests additional geometric contributions that may adjust the theoretical distance bound. The refined bound is presented with partial justification under specific geometric hypotheses and framed as a conjectural extension in full generality. The monograph further provides explicit constructions, computational implementations in Sage/Python, and illustrative examples demonstrating how weighted geometry influences code parameters. This work establishes a structured bridge between orbifold geometry and quantum coding theory, outlining both concrete constructions and open problems for further mathematical development.

arXiv:2508.07542•Aug 11, 2025•0 citations

Code and datasets for "Shortcuts to adiabaticity with a quantum control field"

Emma C. King, Giovanna Morigi, Raphaël Menu

Shortcuts to adiabaticity with a quantum control field — Code & data========================================================== This repository contains a Jupyter notebook and supporting data files (csv) to reproduce the numerical results and figures in our manuscript (arXiv 2508.06304), which investigates adiabatic shortcuts mediated by a quantum control field.The code implements a Landau–Zener two-level system coupled to a spectator qubit, time evolution of the full system (LZ qubit + spectator) via QuTiP, parameter sweeps (parallelized with joblib), and plotting utilities for the manuscript figures. Related publication----------------------------This code is complementary to the preprint: https://arxiv.org/abs/2508.06304. Requirements---------------------The simulations were developed for and tested on Python 3.9+. Recommended packages and minimum versions: - Python >= 3.9- numpy >= 1.22- scipy >= 1.8- matplotlib >= 3.5- qutip >= 4.6 (install a recent stable qutip; some installations require `pip install qutip` or `conda` channels)- joblib >= 1.2- tqdm >= 4.60- pandas (optional, for CSV handling)- jupyterlab / notebook (for interactive use) Running the notebook (interactive) Open the notebook with JupyterLab or Jupyter Notebook. Execute cells sequentially in the order indicated by the notebook outline.The sections “Definitions” and “Figure imports and setup” must be executed before generating any data or figures, as they define all operators, and helper functions. The notebook is organized into separate sections for each figure of the manuscript, allowing you to re-run only the figure(s) of interest. Note: Figure 4 (Density plot) is configured to load precomputed data files to reduce computational cost. To reproduce Figure 4 without recomputing the full dataset, ensure the required .csv files are downloaded and located in the same directory as the notebook. To explore different parameter regimes: Modify the relevant parameter definitions (e.g., anneal_window, g, epsilon, omega_c, x0, x0_vals, q_vals). To include dissipation of the spectator (ancilla) qubit, set the parameter kappa> 0. For questions about reproducing the figures or about parameter choices used in the paper, contact the corresponding authors listed in the preprint. If you reuse this data/code, please cite the associated preprint and this code archive.

•Feb 22, 2026•0 citations

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

Jonathan Conrad, Ansgar G. Burchards, Steven T. Flammia

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.

arXiv:2407.03270•Jul 3, 2024•1 citation
Replication package — code, Jupyter notebooks, and precomputed data — for "Bosonic codes from compact phase spaces" (D. Roberts, A. Slipper, A. Parhizkar, V. V. Albert, and M. Hafezi). The paper develops the correspondence between Gottesman–Kitaev–Preskill (GKP) codes and elliptic curves — established concurrently by Conrad, Burchards & Flammia [1] and the present authors [2] — and extends it, via geometric quantization, to bosonic quantum codes associated with algebraic curves of arbitrary genus. Following geometric quantization, a quantized phase space is a family of coherent states holomorphically parametrized by a complex manifold; this work realizes the phase spaces parametrized by a compact Riemann surface. Code states are then holomorphic sections of a line bundle over that surface (automorphic forms), and the code dimension is fixed by Riemann–Roch — recovering GKP codes when the surface is an elliptic curve (genus 1) and yielding a new class of hyperbolic CV quantum codes at genus greater than or equal to 2. The package also numerically illustrates the central no-go result: an amenability dichotomy under which arbitrarily accurate approximate code words exist at genus one but not at any higher genus. The genus-two Bolza surface — the most symmetric genus-two curve — serves as the explicit worked example throughout, and is what the numerics compute. For that example the package: constructs the k=2 code space, verifies the Veronese factorization Y^2 = XZ that generates the full tower of code spaces, and renders the Husimi Q-functions of the code basis (main-text Fig. 2); builds the Poincaré theta series spanning the code space and studies their convergence; verifies the weight-2 canonical gate representation — V_R, V_U in the main text, ρ(R), ρ(U) in the notebooks — for the automorphism group Aut(C) = GL(2, F_3), symbolically and numerically; derives the circuit-QED conditional two-mode-squeezing Hamiltonian via a lab-frame dispersive Schrieffer–Wolff reduction; simulates the conditional-kick stabilization dynamics (main-text Fig. 3) and diagonalizes the stabilizer Hamiltonian to exhibit a spectral gap, a genus-two instance of the amenability dichotomy. Every computational figure in the main text and Supplemental Material is regenerated; the two non-computational schematics (main-text Fig. 1 and the SM circuit diagram) are illustrations, not code output. See README.md for the full file-to-figure map. [1] https://arxiv.org/abs/2407.03270 (2024)[2] https://github.com/droberts01/higher-genus-gkp (2024)
We present the algebraic structure of bosonic quantum error-correcting codes on genus-two Riemann surfaces. We explicitly construct the code words as automorphic forms and analytically generate the full tower of code spaces at all weights. We prove a fundamental no-go theorem: for any genus greater than one, the stabilizer group is non-amenable, forcing a strictly positive spectral gap in the stabilizer Hamiltonian. Consequently, no normalizable quantum state can satisfy all stabilizer conditions. This sharply contrasts with standard Gottesman-Kitaev-Preskill (GKP) codes, where the amenability of the stabilizer group Z2\mathbb{Z}^2Z2 permits approximate code words with arbitrary precision.
We study a class of quantum error-correcting codes through the geometry of complex abelian varieties. These codes, introduced by Gottesman--Kitaev--Preskill, are built from symplectically integral lattices and therefore naturally define polarized complex abelian varieties. We give a precise mathematical formulation of this relationship and extend it to a dictionary between the main structures of GKP code theory and classical objects in the theory of abelian varieties. For instance, under this dictionary, the finite-dimensional code space becomes the space of theta functions H0(X,L)H^0(X, L)H0(X,L), logical Pauli gates arise from the theta group, passive logical Clifford gates correspond to automorphisms of the polarized abelian variety, and concatenation with stabilizer codes corresponds to isogeny. We also prove several key results that give precise mathematical formulations of statements about these codes that often appear in heuristic form in the physics literature. In particular, we prove that the encoding is asymptotically isometric, that every logical Clifford gate is realized by a Gaussian unitary, and that, for noise of small variance, the failure probability is governed to first order by the shortest nontrivial displacement in the kernel of the polarization isogeny, a systolic invariant of the underlying polarization. This leads naturally to optimization problems on the moduli space of polarized abelian varieties.
This repository contains the numerical simulation code supporting the paper “Holonomic quantum gates via continuous measurement in bosonic codes: GKP and cat states” by Juan Garcia-Nila, Anirudh Lanka, and Todd A. Brun. The code implements measurement-based holonomic logical gates for four-component cat codes and Gottesman–Kitaev–Preskill (GKP) codes. It includes simulations of the logical gate trajectories, Wigner-function evolution, target-state fidelities, holonomy infidelities, and leakage under finite-strength continuous measurement. The associated paper develops explicit continuously monitored holonomic protocols for non-Clifford logical gates in bosonic codes. Time-dependent stabilizer measurements Zeno-confine the state to an evolving codespace, producing logical operations through geometric holonomies while retaining access to error-syndrome information. Associated preprint: https://arxiv.org/abs/2608.11369
This work develops a geometric framework for constructing quantum error-correcting codes from weighted projective and orbifold structures, integrating algebraic geometry, divisor theory, and the CSS stabilizer formalism. Beginning with weighted projective spaces and their associated height and defect structures, the study builds classical AG-codes via evaluation on divisors adapted to orbifold singularities. These classical codes are lifted to quantum codes using self-orthogonality conditions and homological constructions, yielding a class of Quantum Weighted Algebraic Geometric (QWAG) codes. A central contribution is the formulation of a refined Singleton-type bound motivated by orbifold defect terms and effective genus corrections. While the classical quantum Singleton bound is recovered in the smooth case, the orbifold setting suggests additional geometric contributions that may adjust the theoretical distance bound. The refined bound is presented with partial justification under specific geometric hypotheses and framed as a conjectural extension in full generality. The monograph further provides explicit constructions, computational implementations in Sage/Python, and illustrative examples demonstrating how weighted geometry influences code parameters. This work establishes a structured bridge between orbifold geometry and quantum coding theory, outlining both concrete constructions and open problems for further mathematical development.
Shortcuts to adiabaticity with a quantum control field — Code & data========================================================== This repository contains a Jupyter notebook and supporting data files (csv) to reproduce the numerical results and figures in our manuscript (arXiv 2508.06304), which investigates adiabatic shortcuts mediated by a quantum control field.The code implements a Landau–Zener two-level system coupled to a spectator qubit, time evolution of the full system (LZ qubit + spectator) via QuTiP, parameter sweeps (parallelized with joblib), and plotting utilities for the manuscript figures. Related publication----------------------------This code is complementary to the preprint: https://arxiv.org/abs/2508.06304. Requirements---------------------The simulations were developed for and tested on Python 3.9+. Recommended packages and minimum versions: - Python >= 3.9- numpy >= 1.22- scipy >= 1.8- matplotlib >= 3.5- qutip >= 4.6 (install a recent stable qutip; some installations require `pip install qutip` or `conda` channels)- joblib >= 1.2- tqdm >= 4.60- pandas (optional, for CSV handling)- jupyterlab / notebook (for interactive use) Running the notebook (interactive) Open the notebook with JupyterLab or Jupyter Notebook. Execute cells sequentially in the order indicated by the notebook outline.The sections “Definitions” and “Figure imports and setup” must be executed before generating any data or figures, as they define all operators, and helper functions. The notebook is organized into separate sections for each figure of the manuscript, allowing you to re-run only the figure(s) of interest. Note: Figure 4 (Density plot) is configured to load precomputed data files to reduce computational cost. To reproduce Figure 4 without recomputing the full dataset, ensure the required .csv files are downloaded and located in the same directory as the notebook. To explore different parameter regimes: Modify the relevant parameter definitions (e.g., anneal_window, g, epsilon, omega_c, x0, x0_vals, q_vals). To include dissipation of the spectator (ancilla) qubit, set the parameter kappa> 0. For questions about reproducing the figures or about parameter choices used in the paper, contact the corresponding authors listed in the preprint. If you reuse this data/code, please cite the associated preprint and this code archive.
We explain how GKP Clifford gates arise as symplectic automorphisms of the corresponding GKP lattice and show that, for scaled codes of type D=dInD=dI_nD=dIn​, their integral action agrees with the action of the mapping class group of a genus-nnn 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 S3−KS^3 - KS3−K, the three sphere S3S^3S3 with a trefoil knot KKK 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.