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:1903.00012 · Physical Review Letters

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

Ben Q. Baragiola, Giacomo Pantaleoni, Rafael N. Alexander, Angela Karanjai, Nicolas C. Menicucci

Published Nov 13, 2019• 173 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevlett.123.200502

Related papers

Improved GKP magic states from error-corrected non-Gaussian quantum states

Sharon David, Jack Davis, Ulysse Chabaud +1 more

Gate teleportation, together with magic state distillation, is a promising route towards fault-tolerant, universal computation. In the context of bosonic quantum computation, Baragiola et al. PRL 123(20).200502 (2019) showed that within the framework of Gottesman--Kitaev--Preskill codes, encoded magic states suitable for distillation can be produced by error correcting Gaussian states, such as the vacuum. Here, we show that applying the same framework to simple non-Gaussian input states can significantly improve the quality of the magic states obtained, reducing the overall resources for the complete distillation procedure. We focus on superpositions of coherent states or Fock states, showing that many can lead to improvements in the generation of high-quality encoded magic states, which in some cases reduces the resources required for magic state distillation by about a factor $3$. We also investigate the primary source of these improvements and find that, unlike what was previously conjectured, the suitability of input states is not fully explained by symmetry arguments. Instead, the best states seem to avoid projection near stabilizer states as a result of the error correction procedure.

quant-pharXiv:2607.07833•Jul 10, 2026•0 citations

Unsuitability of cubic phase gates for non-Clifford operations on Gottesman-Kitaev-Preskill states

Jacob Hastrup, Mikkel V. Larsen, Jonas Schou Neergaard-Nielsen +2 more

With the Gottesman-Kitaev-Preskill (GKP) encoding, Clifford gates and error correction can be carried out using simple Gaussian operations. Still, non-Clifford gates, required for universality, require non-Gaussian elements. In their original proposal, GKP suggested a particularly simple method of using a single application of the cubic phase gate to perform the logical non-Clifford $T$ gate. Here we show that this cubic phase gate approach performs extraordinarily poorly, even for arbitrarily large amounts of squeezing in the GKP state. Thus, contrary to common belief, the cubic phase gate is not suitable for achieving universal fault-tolerant quantum computation with GKP states.

arXiv:2009.05309•Physical Review A•Mar 10, 2021•27 citations

Realistic Gottesman-Kitaev-Preskill stabilizer states enable universal quantum computation

Fariba Hosseinynejad, Pavithran Iyer, Guillaume Dauphinais +1 more

Physical Gottesman-Kitaev-Preskill (GKP) states are inherently noisy as ideal ones would require infinite energy. While this is typically considered as a deficiency to be actively corrected, this work demonstrates that imperfect GKP stabilizer states can be leveraged in order to apply non-Clifford gates using only linear optical elements. In particular, Gaussian operations on normalizable GKP states, combined with homodyne measurements, permit two key primitives: clean projection onto Pauli eigenstates in the normalizable GKP codespace, thereby implementing Clifford gates with high fidelity; and probabilistic projection of unmeasured modes onto non-Pauli eigenstates. These results demonstrate that normalizable GKP stabilizer states combined with Gaussian operations provide a practical framework for computational universality within the measurement-based model of quantum computation in a realistic continuous-variable setting.

quant-pharXiv:2511.03874•Physical Review Letters•Nov 7, 2025•1 citation

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

Fault-tolerant bosonic quantum error correction with the surface–Gottesman-Kitaev-Preskill code

Kyungjoo Noh, Christopher Chamberland

The performance of the circuit-based surface-GKP bosonic quantum error correction code under noise due to finite squeezing of the GKP states and photon losses is investigated. The authors show under what conditions fault-tolerant quantum error correction is possible with the surface-GKP code.

arXiv:1908.03579•Physical Review A•Jan 13, 2020•161 citations

Universal quantum gate set for Gottesman–Kitaev–Preskill logical qubits

Vassili G. Matsos, Christophe H. Valahu, Maverick J. Millican +4 more

Abstract Conventional approaches towards creating a large-scale, fault-tolerant quantum computer require an error correction scheme that uses multiple physical qubits to encode one logical qubit of protected quantum information. A key limiting factor in realizing error-corrected quantum information processing is the large ratio of physical-to-logical qubits required by many error correction codes, outstripping the size of near-term devices. The Gottesman–Kitaev–Preskill (GKP) code offers hardware efficiency at the cost of increased encoding complexity by encoding a logical qubit into a single quantum harmonic oscillator. Building on earlier demonstrations of GKP-encoded operations, we realize an entangling gate on GKP logical qubits. Our experiments use an optimal control strategy that deterministically implements a universal set of energy-preserving logical gates on finite-energy GKP states encoded in the mechanical motions of a trapped ion. We also directly generate a GKP Bell state starting from vacuum. Our approach is compatible with existing hardware architectures, demonstrating the potential for optimal control techniques with advanced encoding schemes to accelerate the path towards large-scale fault-tolerant quantum information processing.

Nature Physics•Aug 21, 2025•22 citations
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.
Gate teleportation, together with magic state distillation, is a promising route towards fault-tolerant, universal computation. In the context of bosonic quantum computation, Baragiola et al. PRL 123(20).200502 (2019) showed that within the framework of Gottesman--Kitaev--Preskill codes, encoded magic states suitable for distillation can be produced by error correcting Gaussian states, such as the vacuum. Here, we show that applying the same framework to simple non-Gaussian input states can significantly improve the quality of the magic states obtained, reducing the overall resources for the complete distillation procedure. We focus on superpositions of coherent states or Fock states, showing that many can lead to improvements in the generation of high-quality encoded magic states, which in some cases reduces the resources required for magic state distillation by about a factor 333. We also investigate the primary source of these improvements and find that, unlike what was previously conjectured, the suitability of input states is not fully explained by symmetry arguments. Instead, the best states seem to avoid projection near stabilizer states as a result of the error correction procedure.
With the Gottesman-Kitaev-Preskill (GKP) encoding, Clifford gates and error correction can be carried out using simple Gaussian operations. Still, non-Clifford gates, required for universality, require non-Gaussian elements. In their original proposal, GKP suggested a particularly simple method of using a single application of the cubic phase gate to perform the logical non-Clifford TTT gate. Here we show that this cubic phase gate approach performs extraordinarily poorly, even for arbitrarily large amounts of squeezing in the GKP state. Thus, contrary to common belief, the cubic phase gate is not suitable for achieving universal fault-tolerant quantum computation with GKP states.
Physical Gottesman-Kitaev-Preskill (GKP) states are inherently noisy as ideal ones would require infinite energy. While this is typically considered as a deficiency to be actively corrected, this work demonstrates that imperfect GKP stabilizer states can be leveraged in order to apply non-Clifford gates using only linear optical elements. In particular, Gaussian operations on normalizable GKP states, combined with homodyne measurements, permit two key primitives: clean projection onto Pauli eigenstates in the normalizable GKP codespace, thereby implementing Clifford gates with high fidelity; and probabilistic projection of unmeasured modes onto non-Pauli eigenstates. These results demonstrate that normalizable GKP stabilizer states combined with Gaussian operations provide a practical framework for computational universality within the measurement-based model of quantum computation in a realistic continuous-variable setting.
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.
Abstract Conventional approaches towards creating a large-scale, fault-tolerant quantum computer require an error correction scheme that uses multiple physical qubits to encode one logical qubit of protected quantum information. A key limiting factor in realizing error-corrected quantum information processing is the large ratio of physical-to-logical qubits required by many error correction codes, outstripping the size of near-term devices. The Gottesman–Kitaev–Preskill (GKP) code offers hardware efficiency at the cost of increased encoding complexity by encoding a logical qubit into a single quantum harmonic oscillator. Building on earlier demonstrations of GKP-encoded operations, we realize an entangling gate on GKP logical qubits. Our experiments use an optimal control strategy that deterministically implements a universal set of energy-preserving logical gates on finite-energy GKP states encoded in the mechanical motions of a trapped ion. We also directly generate a GKP Bell state starting from vacuum. Our approach is compatible with existing hardware architectures, demonstrating the potential for optimal control techniques with advanced encoding schemes to accelerate the path towards large-scale fault-tolerant quantum information processing.