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

arXiv:2301.10030 · Physical Review A

Gaussian conversion protocol for heralded generation of generalized Gottesman-Kitaev-Preskill states

Yu Chuan Zheng, Alessandro Ferraro, Anton Frisk Kockum, Giulia Ferrini

Published Jul 5, 2023• 13 citations
arXivHTMLPDF

Abstract

In the field of fault-tolerant quantum computing, continuous-variable systems can be utilized to protect quantum information from noise through the use of bosonic codes. These codes map qubit-type quantum information onto the larger bosonic Hilbert space, and can be divided into two main categories: translational-symmetric codes, such as Gottesman-Kitaev-Preskill (GKP) codes, and rotational-symmetric codes, including cat and binomial codes. The relationship between these families of codes has not yet been fully understood. We present an iterative protocol for converting between two instances of these codes---generalized GKP (so-called qunaught) states and fourfold-symmetric binomial states corresponding to a zero-logical encoded qubit---using only Gaussian operations. This conversion demonstrates the potential for universality of binomial states for all-Gaussian quantum computation and provides a method for the heralded preparation of GKP states. Through numerical simulation, we obtain GKP qunaught states with a fidelity of over $98%$ and a probability of approximately $3.14%$, after only two steps of our iterative protocol, though higher fidelities can be achieved with additional iterations at the cost of lower success probabilities.

DOI
10.1103/physreva.108.012603

Related papers

Error Correction of Beamsplitter-Generated Entangled GKP States

Moritz Fontboté-Schmidt, Jeremy Metzner, Florence Berterottière +8 more

To be useful, quantum computers will be required to successfully correct errors occurring at the hardware level. Bosonic codes provide a hardware-efficient option for error correction, but fault-tolerance further requires that the available gate interactions be compatible with the code. A promising bosonic code is the Gottesman-Kitaev-Preskill (GKP) code, for which a linear beamsplitter-like coupling between two bosonic modes is fault-tolerant, making this a key primitive for building larger systems. Here, using two motional modes of a trapped ion, we demonstrate the generation of entangled states of GKP qubits by interfering two qunaught states, which have a grid structure but carry no logical information, on a beamsplitter. We generate all four Bell states with an average fidelity of 69%, and subsequently demonstrate an extension of the entangled state lifetime through the use of quantum error correction. These results complete the set of Gaussian operations required for quantum computing with GKP codes and enable explorations of multi-mode bosonic encodings as well as fundamental tests of information channels.

quant-pharXiv:2605.08009•May 11, 2026•0 citations

Phase-space methods for representing, manipulating, and correcting Gottesman-Kitaev-Preskill qubits

Lucas J. Mensen, Ben Q. Baragiola, Nicolas C. Menicucci

The Gottesman-Kitaev-Preskill (GKP) encoding of a qubit into a bosonic mode is a promising bosonic code for quantum computation due to its tolerance for noise and all-Gaussian gate set. We present a toolkit for phase-space description and manipulation of GKP encodings that includes Wigner functions for ideal and approximate GKP states, for various types of mixed GKP states, and for GKP-encoded operators. One advantage of a phase-space approach is that Gaussian unitaries, required for computation with GKP codes, correspond to simple transformations on the arguments of Wigner functions. We use this fact and our toolkit to describe GKP error correction, including magic-state preparation, entirely in phase space using operations on Wigner functions. While our focus here is on the square-lattice GKP code, we provide a general framework for GKP codes defined on any lattice.

arXiv:2012.12488•Physical Review A•Aug 6, 2021•21 citations

All-Gaussian Universality and Fault Tolerance with the Gottesman-Kitaev-Preskill Code

Ben Q. Baragiola, Giacomo Pantaleoni, Rafael N. Alexander +2 more

The Gottesman-Kitaev-Preskill (GKP) encoding of a qubit within an oscillator is particularly appealing for fault-tolerant quantum computing with bosons because Gaussian operations on encoded Pauli eigenstates enable Clifford quantum computing with error correction. We show that applying GKP error correction to Gaussian input states, such as vacuum, produces distillable magic states, achieving universality without additional non-Gaussian elements. Fault tolerance is possible with sufficient squeezing and low enough external noise. Thus, Gaussian operations are sufficient for fault-tolerant, universal quantum computing given a supply of GKP-encoded Pauli eigenstates.

arXiv:1903.00012•Physical Review Letters•Nov 13, 2019•173 citations

Spin-squeezed Gottesman-Kitaev-Preskill codes for quantum error correction in atomic ensembles

Sivaprasad Omanakuttan, Tyler J. Volkoff

Gottesman-Kitaev-Preskill (GKP) codes encode a qubit in displaced phase-space combs of a continuous-variable (CV) quantum system and are useful for correcting a variety of high-weight photonic errors. Here we propose atomic ensemble analogs of the single-mode CV GKP code by using the quantum central limit theorem to pull back the phase-space structure of a CV system to the compact phase space of a quantum spin system. We study the optimal recovery performance of these codes under error channels described by stochastic relaxation and isotropic ballistic dephasing processes using the diversity combining approach for calculating channel fidelity. We find that the spin GKP codes outperform other spin system codes such as cat codes or binomial codes. Our spin GKP codes based on the two-axis countertwisting interaction and superpositions of SU(2) coherent states are direct spin analogs of the finite-energy CV GKP codes, whereas our codes based on one-axis twisting do not yet have well-studied CV analogs. A state preparation scheme for the spin GKP codes is proposed which uses the linear-combination-of-unitaries method, applicable to both the CV and spin GKP settings. Finally, we discuss a fault-tolerant approximate gate set for quantum computing with spin-GKP-encoded qubits, obtained by translating gates from the CV GKP setting using the quantum central limit theorem.

arXiv:2211.05181•Physical Review A•Aug 28, 2023•11 citations

Robust suppression of noise propagation in Gottesman-Kitaev-Preskill error correction

Christian Siegele, Philippe Campagne-Ibarcq

Straightforward logical operations contrasting with complex state preparation are the hallmarks of the bosonic encoding proposed by Gottesman, Kitaev, and Preskill (GKP). The recently reported generation and error correction of GKP qubits in trapped ions and superconducting circuits thus holds great promise for the future of quantum computing architectures based on such encoded qubits. However, these experiments rely on error-syndrome detection via an auxiliary physical qubit, whose noise may propagate and corrupt the encoded GKP qubit. We propose a simple module composed of two oscillators and a physical qubit, operated with two experimentally accessible quantum gates and elementary feedback controls to implement an error-corrected GKP qubit protected from such propagating errors. In the idealized setting of periodic GKP states, we develop efficient numerical methods to optimize our protocol parameters and show that errors of the encoded qubit stemming from flips of the physical qubit and diffusion of the oscillators state in phase space may be exponentially suppressed as the noise strength over individual operations is decreased. Our approach circumvents the main roadblock towards fault-tolerant quantum computation with GKP qubits.

Physical Review A•Oct 26, 2023•4 citations

Magnonic Gottesman-Kitaev-Preskill states

Zi-Xu Lu, Gang Liu, Matteo Fadel +1 more

Bosonic quantum error correction encodes a logical qubit in an oscillator, avoiding the hardware overhead of large qubit arrays. Among such encodings, Gottesman-Kitaev-Preskill (GKP) states are paticularly powerful because their phase-space grid structure protects against small displacement errors simultaneously in both conjugate quadratures. Here we provide the first protocol for preparing magnonic GKP states, which involves an ellipsoidal magnetic crystal effectively coupled to a superconducting qubit via a microwave cavity. The geometric anisotropy intrinsically squeezes the magnon mode, while the cavity-mediated qubit control realizes an effective conditional-displacement interaction. We show that two rounds of a conditional-displacement interaction and a qubit projective measurement yield three- and four-component magnonic GKP-like states. We also show how to realize single logical qubit gate operations, such as Pauli, Hadamard and phase gates, completing the logical Pauli basis of the approximate GKP code. Our results establish hybrid magnon-qubit systems as a promising platform for preparing bosonic code states, with applications in magnonic fault-tolerant quantum computation and quantum sensing.

quant-pharXiv:2604.27565•May 1, 2026•0 citations
In the field of fault-tolerant quantum computing, continuous-variable systems can be utilized to protect quantum information from noise through the use of bosonic codes. These codes map qubit-type quantum information onto the larger bosonic Hilbert space, and can be divided into two main categories: translational-symmetric codes, such as Gottesman-Kitaev-Preskill (GKP) codes, and rotational-symmetric codes, including cat and binomial codes. The relationship between these families of codes has not yet been fully understood. We present an iterative protocol for converting between two instances of these codes---generalized GKP (so-called qunaught) states and fourfold-symmetric binomial states corresponding to a zero-logical encoded qubit---using only Gaussian operations. This conversion demonstrates the potential for universality of binomial states for all-Gaussian quantum computation and provides a method for the heralded preparation of GKP states. Through numerical simulation, we obtain GKP qunaught states with a fidelity of over 9898%98 and a probability of approximately 3.143.14%3.14, after only two steps of our iterative protocol, though higher fidelities can be achieved with additional iterations at the cost of lower success probabilities.
To be useful, quantum computers will be required to successfully correct errors occurring at the hardware level. Bosonic codes provide a hardware-efficient option for error correction, but fault-tolerance further requires that the available gate interactions be compatible with the code. A promising bosonic code is the Gottesman-Kitaev-Preskill (GKP) code, for which a linear beamsplitter-like coupling between two bosonic modes is fault-tolerant, making this a key primitive for building larger systems. Here, using two motional modes of a trapped ion, we demonstrate the generation of entangled states of GKP qubits by interfering two qunaught states, which have a grid structure but carry no logical information, on a beamsplitter. We generate all four Bell states with an average fidelity of 69%, and subsequently demonstrate an extension of the entangled state lifetime through the use of quantum error correction. These results complete the set of Gaussian operations required for quantum computing with GKP codes and enable explorations of multi-mode bosonic encodings as well as fundamental tests of information channels.
The Gottesman-Kitaev-Preskill (GKP) encoding of a qubit into a bosonic mode is a promising bosonic code for quantum computation due to its tolerance for noise and all-Gaussian gate set. We present a toolkit for phase-space description and manipulation of GKP encodings that includes Wigner functions for ideal and approximate GKP states, for various types of mixed GKP states, and for GKP-encoded operators. One advantage of a phase-space approach is that Gaussian unitaries, required for computation with GKP codes, correspond to simple transformations on the arguments of Wigner functions. We use this fact and our toolkit to describe GKP error correction, including magic-state preparation, entirely in phase space using operations on Wigner functions. While our focus here is on the square-lattice GKP code, we provide a general framework for GKP codes defined on any lattice.
The Gottesman-Kitaev-Preskill (GKP) encoding of a qubit within an oscillator is particularly appealing for fault-tolerant quantum computing with bosons because Gaussian operations on encoded Pauli eigenstates enable Clifford quantum computing with error correction. We show that applying GKP error correction to Gaussian input states, such as vacuum, produces distillable magic states, achieving universality without additional non-Gaussian elements. Fault tolerance is possible with sufficient squeezing and low enough external noise. Thus, Gaussian operations are sufficient for fault-tolerant, universal quantum computing given a supply of GKP-encoded Pauli eigenstates.
Gottesman-Kitaev-Preskill (GKP) codes encode a qubit in displaced phase-space combs of a continuous-variable (CV) quantum system and are useful for correcting a variety of high-weight photonic errors. Here we propose atomic ensemble analogs of the single-mode CV GKP code by using the quantum central limit theorem to pull back the phase-space structure of a CV system to the compact phase space of a quantum spin system. We study the optimal recovery performance of these codes under error channels described by stochastic relaxation and isotropic ballistic dephasing processes using the diversity combining approach for calculating channel fidelity. We find that the spin GKP codes outperform other spin system codes such as cat codes or binomial codes. Our spin GKP codes based on the two-axis countertwisting interaction and superpositions of SU(2) coherent states are direct spin analogs of the finite-energy CV GKP codes, whereas our codes based on one-axis twisting do not yet have well-studied CV analogs. A state preparation scheme for the spin GKP codes is proposed which uses the linear-combination-of-unitaries method, applicable to both the CV and spin GKP settings. Finally, we discuss a fault-tolerant approximate gate set for quantum computing with spin-GKP-encoded qubits, obtained by translating gates from the CV GKP setting using the quantum central limit theorem.
Straightforward logical operations contrasting with complex state preparation are the hallmarks of the bosonic encoding proposed by Gottesman, Kitaev, and Preskill (GKP). The recently reported generation and error correction of GKP qubits in trapped ions and superconducting circuits thus holds great promise for the future of quantum computing architectures based on such encoded qubits. However, these experiments rely on error-syndrome detection via an auxiliary physical qubit, whose noise may propagate and corrupt the encoded GKP qubit. We propose a simple module composed of two oscillators and a physical qubit, operated with two experimentally accessible quantum gates and elementary feedback controls to implement an error-corrected GKP qubit protected from such propagating errors. In the idealized setting of periodic GKP states, we develop efficient numerical methods to optimize our protocol parameters and show that errors of the encoded qubit stemming from flips of the physical qubit and diffusion of the oscillators state in phase space may be exponentially suppressed as the noise strength over individual operations is decreased. Our approach circumvents the main roadblock towards fault-tolerant quantum computation with GKP qubits.
Bosonic quantum error correction encodes a logical qubit in an oscillator, avoiding the hardware overhead of large qubit arrays. Among such encodings, Gottesman-Kitaev-Preskill (GKP) states are paticularly powerful because their phase-space grid structure protects against small displacement errors simultaneously in both conjugate quadratures. Here we provide the first protocol for preparing magnonic GKP states, which involves an ellipsoidal magnetic crystal effectively coupled to a superconducting qubit via a microwave cavity. The geometric anisotropy intrinsically squeezes the magnon mode, while the cavity-mediated qubit control realizes an effective conditional-displacement interaction. We show that two rounds of a conditional-displacement interaction and a qubit projective measurement yield three- and four-component magnonic GKP-like states. We also show how to realize single logical qubit gate operations, such as Pauli, Hadamard and phase gates, completing the logical Pauli basis of the approximate GKP code. Our results establish hybrid magnon-qubit systems as a promising platform for preparing bosonic code states, with applications in magnonic fault-tolerant quantum computation and quantum sensing.