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

Simulation codes for holonomic quantum gates via continuous measurement in bosonic codes

Juan Garcia-Nila

Published Nov 13, 2026• 0 citations
Publisher

Abstract

Python simulation codes accompanying the manuscript "Holonomic quantum gates via continuous measurement in bosonic codes: GKP and cat states." The repository contains numerical implementations of holonomic logical gates for four-component cat and finite-energy GKP codes, including Wigner-function evolution, logical gate fidelities, process infidelities, and measurement-induced leakage calculations. The simulations use NumPy, SciPy, Matplotlib, and Strawberry Fields.

DOI
10.5281/zenodo.24193877

Related papers

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

Holonomic quantum gates via continuous measurement in bosonic codes: GKP and cat states

Juan Garcia-Nila, Anirudh Lanka, Todd A. Brun

We apply continuous measurement-based holonomic quantum computation (CMHQC) to bosonic quantum error-correcting codes and develop explicit protocols for both four-component cat codes and Gottesman-Kitaev-Preskill (GKP) codes. In this framework, a continuously monitored time-dependent codespace undergoes a closed trajectory on the Grassmannian manifold while Zeno confinement suppresses departures from the instantaneous code subspace. For cat codes, we construct a family of squeezed-cat trajectories whose projected Wilczek-Zee connection generates arbitrary logical Z rotations, including non-Clifford T-gates. For GKP codes, we introduce a translated-lattice trajectory that realizes the logical GKP T gate through a purely geometric holonomy. We derive the corresponding time-dependent projectors, analytically evaluate the projected connections, and show that the resulting holonomies reproduce the desired logical operations without Hamiltonian control. Furthermore, we analyze the error-correcting capabilities of the instantaneous codespaces by establishing dressed Knill-Laflamme conditions for the relevant bosonic error models and derive analytical estimates for leakage induced by finite-strength continuous measurements. Our results provide a concrete realization of measurement-induced holonomic control in experimentally relevant bosonic platforms and establish a full fault-tolerant logical gate implementation.

quant-pharXiv:2608.11369•Aug 13, 2026•1 citation

Holonomic quantum gates via continuous measurement in bosonic codes: GKP and cat states

Juan Garcia-Nila, Anirudh Lanka, Todd Brun

Abstract We apply continuous measurement-based holonomic quantum computation (CMHQC) \cite{Lanka2025,Lanka2026} to bosonic quantum error-correcting codes and develop explicit protocols for both four-component cat codes and Gottesman–Kitaev–Preskill (GKP) codes. In this framework, a continuously monitored time-dependent codespace undergoes a closed trajectory on the Grassmannian manifold while Zeno confinement suppresses departures from the instantaneous code subspace. For cat codes, we construct a family of squeezed-cat trajectories whose projected Wilczek–Zee connection generates arbitrary logical $Z_L$ rotations, including non-Clifford $T_L$-gates. For GKP codes, we introduce a translated-lattice trajectory that realizes the logical $T_\mathrm{GKP}$ gate through a purely geometric holonomy. We derive the corresponding time-dependent projectors, analytically evaluate the projected connections, and show that the resulting holonomies reproduce the desired logical operations without Hamiltonian control. Furthermore, we analyze the error-correcting capabilities of the instantaneous codespaces by establishing dressed Knill–Laflamme conditions for the relevant bosonic error models and derive analytical estimates for leakage induced by finite-strength continuous measurements. Our results provide a concrete realization of measurement-induced holonomic control in experimentally relevant bosonic platforms and establish a full fault-tolerant logical gate implementation.

•Sep 24, 2026•0 citations

Fast Simulation of Bosonic Qubits via Gaussian Functions in Phase Space

J. Eli Bourassa, Nicolás Quesada, Ilan Tzitrin +6 more

Bosonic qubits are a promising route to building fault-tolerant quantum computers on a variety of physical platforms.Studying the performance of bosonic qubits under realistic gates and measurements is challenging with existing analytical and numerical tools.We present a novel formalism for simulating classes of states that can be represented as linear combinations of Gaussian functions in phase space.This formalism allows us to analyze and simulate a wide class of non-Gaussian states, transformations, and measurements.We demonstrate how useful classes of bosonic qubits-Gottesman-Kitaev-Preskill (GKP), cat, and Fock states-can be simulated using this formalism, opening the door to investigating the behavior of bosonic qubits under Gaussian channels and measurements, non-Gaussian transformations such as those achieved via gate teleportation, and important non-Gaussian measurements such as threshold and photon-number detection.Our formalism enables simulating these situations with levels of accuracy that are not feasible with existing methods.Finally, we use a method informed by our formalism to simulate circuits critical to the study of fault-tolerant quantum computing with bosonic qubits but beyond the reach of existing techniques.Specifically, we examine how finite-energy GKP states transform under realistic qubit phase gates; interface with a continuous-variable cluster state; and transform under non-Clifford T gate teleportation using magic states.We implement our simulation method as a part of the open-source Strawberry Fields PYTHON library.

arXiv:2103.05530•PRX Quantum•Oct 22, 2021•47 citations

Reliable Quantum Certification of Bosonic Code Preparations

WU Ya

Bosonic fault tolerant quantum computing requires preparations of Bosonic code states like cat states and GKP states with high fidelity and reliable quantum certification of these states. Although many proposals on preparing these states have been developed, few investigation has been done on how to reliably certify these experimental states. In this paper, we develop approaches to certify whether a continuous-variable state falls inside a certain Bosonic qubit code space by detecting a witness using Gaussian measurements. Our results can be applied to certification of various cat codes including two-component cat states, four-component cat states, and squeezed two-component cat states as well as Gottesman-Kitaev-Preskill codes. Then we further apply our approach to certify resource states in continuous-variable universal fault tolerant measurement-based quantum computing and quantum outputs of instantaneous quantum polynomial circuits, which can be used to show quantum supremacy. The sample complexity of our approach is efficient in terms of number of modes, so significantly reducing overhead compared to quantum state tomography in certification of many-mode quantum states.

arXiv:2211.16777•Nov 30, 2022•1 citation

Q-Loop-Enabled Deterministic Coherence Management for Portable Quantum Sensors

Caspian, Ethan A.

This repository contains the simulation and analysis code accompanying the manuscript “Q-Loop-Enabled Deterministic Coherence Management for Portable Quantum Sensors”. It provides a fully reproducible Python/NumPy/QuTiP workflow to evaluate Q-Loop, a continuous phase-modulation protocol for coherence protection in NV-centre magnetometers and related qubit sensors operating under “robotic” composite noise.The code computes filter functions (|F(\omega,\tau)|^2) and decoherence functionals (\chi(\tau)) for free evolution, Q-Loop, and standard pulsed dynamical decoupling sequences (CPMG, XY8, UDD), under both Lorentzian and composite (1/f +) line-rich noise spectra. It generates the main figures in the paper, including: (i) filter-function and noise-weighting plots, and (ii) jitter–flip-angle robustness heatmaps comparing Q-Loop to XY8/CPMG. A Colab-friendly script is included so all figures can be regenerated on a laptop without specialized hardware. The repository also provides example waveform generators (I/Q baseband) for implementing Q-Loop and pulsed sequences on standard AWGs, together with reference parameter sets ((\eta \simeq 3.6, T \simeq 0.97\tau_c)) that reproduce the reported (\sim 5)–(6\times) coherence extension. This archive is intended as a starting point for both numerical studies of coherence management under realistic platform noise and for experimental implementation on ensemble NV magnetometers or other driven qubit sensors.

•Nov 21, 2025•0 citations
Python simulation codes accompanying the manuscript "Holonomic quantum gates via continuous measurement in bosonic codes: GKP and cat states." The repository contains numerical implementations of holonomic logical gates for four-component cat and finite-energy GKP codes, including Wigner-function evolution, logical gate fidelities, process infidelities, and measurement-induced leakage calculations. The simulations use NumPy, SciPy, Matplotlib, and Strawberry Fields.
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
We apply continuous measurement-based holonomic quantum computation (CMHQC) to bosonic quantum error-correcting codes and develop explicit protocols for both four-component cat codes and Gottesman-Kitaev-Preskill (GKP) codes. In this framework, a continuously monitored time-dependent codespace undergoes a closed trajectory on the Grassmannian manifold while Zeno confinement suppresses departures from the instantaneous code subspace. For cat codes, we construct a family of squeezed-cat trajectories whose projected Wilczek-Zee connection generates arbitrary logical Z rotations, including non-Clifford T-gates. For GKP codes, we introduce a translated-lattice trajectory that realizes the logical GKP T gate through a purely geometric holonomy. We derive the corresponding time-dependent projectors, analytically evaluate the projected connections, and show that the resulting holonomies reproduce the desired logical operations without Hamiltonian control. Furthermore, we analyze the error-correcting capabilities of the instantaneous codespaces by establishing dressed Knill-Laflamme conditions for the relevant bosonic error models and derive analytical estimates for leakage induced by finite-strength continuous measurements. Our results provide a concrete realization of measurement-induced holonomic control in experimentally relevant bosonic platforms and establish a full fault-tolerant logical gate implementation.
Abstract We apply continuous measurement-based holonomic quantum computation (CMHQC) \cite{Lanka2025,Lanka2026} to bosonic quantum error-correcting codes and develop explicit protocols for both four-component cat codes and Gottesman–Kitaev–Preskill (GKP) codes. In this framework, a continuously monitored time-dependent codespace undergoes a closed trajectory on the Grassmannian manifold while Zeno confinement suppresses departures from the instantaneous code subspace. For cat codes, we construct a family of squeezed-cat trajectories whose projected Wilczek–Zee connection generates arbitrary logical ZLZ_LZL​ rotations, including non-Clifford TLT_LTL​-gates. For GKP codes, we introduce a translated-lattice trajectory that realizes the logical TGKPT_\mathrm{GKP}TGKP​ gate through a purely geometric holonomy. We derive the corresponding time-dependent projectors, analytically evaluate the projected connections, and show that the resulting holonomies reproduce the desired logical operations without Hamiltonian control. Furthermore, we analyze the error-correcting capabilities of the instantaneous codespaces by establishing dressed Knill–Laflamme conditions for the relevant bosonic error models and derive analytical estimates for leakage induced by finite-strength continuous measurements. Our results provide a concrete realization of measurement-induced holonomic control in experimentally relevant bosonic platforms and establish a full fault-tolerant logical gate implementation.
Bosonic qubits are a promising route to building fault-tolerant quantum computers on a variety of physical platforms.Studying the performance of bosonic qubits under realistic gates and measurements is challenging with existing analytical and numerical tools.We present a novel formalism for simulating classes of states that can be represented as linear combinations of Gaussian functions in phase space.This formalism allows us to analyze and simulate a wide class of non-Gaussian states, transformations, and measurements.We demonstrate how useful classes of bosonic qubits-Gottesman-Kitaev-Preskill (GKP), cat, and Fock states-can be simulated using this formalism, opening the door to investigating the behavior of bosonic qubits under Gaussian channels and measurements, non-Gaussian transformations such as those achieved via gate teleportation, and important non-Gaussian measurements such as threshold and photon-number detection.Our formalism enables simulating these situations with levels of accuracy that are not feasible with existing methods.Finally, we use a method informed by our formalism to simulate circuits critical to the study of fault-tolerant quantum computing with bosonic qubits but beyond the reach of existing techniques.Specifically, we examine how finite-energy GKP states transform under realistic qubit phase gates; interface with a continuous-variable cluster state; and transform under non-Clifford T gate teleportation using magic states.We implement our simulation method as a part of the open-source Strawberry Fields PYTHON library.
Bosonic fault tolerant quantum computing requires preparations of Bosonic code states like cat states and GKP states with high fidelity and reliable quantum certification of these states. Although many proposals on preparing these states have been developed, few investigation has been done on how to reliably certify these experimental states. In this paper, we develop approaches to certify whether a continuous-variable state falls inside a certain Bosonic qubit code space by detecting a witness using Gaussian measurements. Our results can be applied to certification of various cat codes including two-component cat states, four-component cat states, and squeezed two-component cat states as well as Gottesman-Kitaev-Preskill codes. Then we further apply our approach to certify resource states in continuous-variable universal fault tolerant measurement-based quantum computing and quantum outputs of instantaneous quantum polynomial circuits, which can be used to show quantum supremacy. The sample complexity of our approach is efficient in terms of number of modes, so significantly reducing overhead compared to quantum state tomography in certification of many-mode quantum states.
This repository contains the simulation and analysis code accompanying the manuscript “Q-Loop-Enabled Deterministic Coherence Management for Portable Quantum Sensors”. It provides a fully reproducible Python/NumPy/QuTiP workflow to evaluate Q-Loop, a continuous phase-modulation protocol for coherence protection in NV-centre magnetometers and related qubit sensors operating under “robotic” composite noise.The code computes filter functions (|F(\omega,\tau)|^2) and decoherence functionals (\chi(\tau)) for free evolution, Q-Loop, and standard pulsed dynamical decoupling sequences (CPMG, XY8, UDD), under both Lorentzian and composite (1/f +) line-rich noise spectra. It generates the main figures in the paper, including: (i) filter-function and noise-weighting plots, and (ii) jitter–flip-angle robustness heatmaps comparing Q-Loop to XY8/CPMG. A Colab-friendly script is included so all figures can be regenerated on a laptop without specialized hardware. The repository also provides example waveform generators (I/Q baseband) for implementing Q-Loop and pulsed sequences on standard AWGs, together with reference parameter sets ((\eta \simeq 3.6, T \simeq 0.97\tau_c)) that reproduce the reported (\sim 5)–(6\times) coherence extension. This archive is intended as a starting point for both numerical studies of coherence management under realistic platform noise and for experimental implementation on ensemble NV magnetometers or other driven qubit sensors.