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

Optimal quantum encoding of an oscillator into two oscillators

Jing Wu, Anthony J. Brady, Quntao Zhuang

Published Jan 1, 2023• 0 citations
Publisher

Abstract

We solve the problem of finding the optimal two-mode oscillator-to-oscillator code for continuous-variable error correction—demonstrating that the two-mode-squeezing code with a hexagonal Gottesman-Kitaev-Preskill state is best.
DOI
10.1364/cleo_fs.2023.fm4a.6

Related papers

Error analysis for encoding a qubit in an oscillator

Scott Glancy, E. Knill

In , Gottesman, Kitaev, and Preskill described a method to encode a qubit in the continuous Hilbert space of an oscillator's position and momentum variables. This encoding provides a natural error-correction scheme that can correct errors due to small shifts of the position or momentum wave functions (i.e., use of the displacement operator). We present bounds on the size of correctable shift errors when both qubit and ancilla states may contain errors. We then use these bounds to constrain the quality of input qubit and ancilla states.

arXiv:quant-ph/0510107•Physical Review A•Jan 19, 2006•98 citations

Continuous-variable quantum error correction II: the Gottesman-Kitaev-Preskill code

Kyungjoo Noh, Kasper Duivenvoorden, Victor V. Albert +8 more

Bulletin of the American Physical Society•Mar 16, 2017•0 citations

Probabilistic Error Cancellation for Single-Mode Gottesman-Kitaev-Preskill Codes

Victoria Wadewitz, Alessandro Ciani

In order to solve practical problems on a quantum computer, it is necessary to use fault-tolerant quantum error correction schemes to overcome noise: the errors arising from imperfections in physical components. The Gottesman-Kitaev-Preskill (GKP) code aims at achieving this in a hardware efficient manner by encoding finite-dimensional logical subspaces in the Hilbert space of one or more continuous variable modes. In near term implementations, however, it is not feasible to eliminate errors entirely, so it is natural to also employ alternative error mitigation techniques together with error correction. In this work, we study a quantum error mitigation method known as probabilistic error cancellation in the context of the GKP code. We compare Steane-type and teleportation-based GKP error correction, and calculate the sampling overheads associated with the technique for square and hexagonal GKP codes. We employ the stabilizer subsystem decomposition for GKP codes to obtain an effective logical channel for noisy operations that is used to express the ideal one of a target logical unitary. We consider noise from finite squeezing on the data and the two ancilla modes, needed for error correction, and examine the relationship between the sampling overhead and the noise for different decoding methods. Our results are calculated for single- and two-qubit GKP Clifford gates and one round of error correction, and show the nontrivial combination of error correction and mitigation in continuous variable codes.

quant-pharXiv:2609.17095•Sep 16, 2026•0 citations

Optimality of Gottesman-Kitaev-Preskill (GKP) Codes for Bosonic Quantum Error Correction

Kyungjoo Noh, Victor V. Albert, Liang Jiang

Bulletin of the American Physical Society•Mar 7, 2019•0 citations

Optimal encoding of oscillators into more oscillators

Jing Wu, Anthony J. Brady, Quntao Zhuang

Bosonic encoding of quantum information into harmonic oscillators is a hardware efficient approach to battle noise. In this regard, oscillator-to-oscillator codes not only provide an additional opportunity in bosonic encoding, but also extend the applicability of error correction to continuous-variable states ubiquitous in quantum sensing and communication. In this work, we derive the optimal oscillator-to-oscillator codes among the general family of Gottesman-Kitaev-Preskill (GKP)-stablizer codes for homogeneous noise. We prove that an arbitrary GKP-stabilizer code can be reduced to a generalized GKP two-mode-squeezing (TMS) code. The optimal encoding to minimize the geometric mean error can be constructed from GKP-TMS codes with an optimized GKP lattice and TMS gains. For single-mode data and ancilla, this optimal code design problem can be efficiently solved, and we further provide numerical evidence that a hexagonal GKP lattice is optimal and strictly better than the previously adopted square lattice. For the multimode case, general GKP lattice optimization is challenging. In the two-mode data and ancilla case, we identify the D4 lattice—a 4-dimensional dense-packing lattice—to be superior to a product of lower dimensional lattices. As a by-product, the code reduction allows us to prove a universal no-threshold-theorem for arbitrary oscillators-to-oscillators codes based on Gaussian encoding, even when the ancilla are not GKP states.

arXiv:2212.11970•Quantum•Aug 16, 2023•8 citations

Qubit-Oscillator Concatenated Codes: Decoding Formalism and Code Comparison

Yijia Xu, Yixu Wang, En-Jui Kuo +1 more

The strategy of concatenating Gottesman-Kitaev-Preskill with qubit error-correcting codes is investigated, providing insights on the advantages over established schemes and on how to build efficient decoders.

PRX Quantum•Jun 14, 2023•15 citations
In , Gottesman, Kitaev, and Preskill described a method to encode a qubit in the continuous Hilbert space of an oscillator's position and momentum variables. This encoding provides a natural error-correction scheme that can correct errors due to small shifts of the position or momentum wave functions (i.e., use of the displacement operator). We present bounds on the size of correctable shift errors when both qubit and ancilla states may contain errors. We then use these bounds to constrain the quality of input qubit and ancilla states.
In order to solve practical problems on a quantum computer, it is necessary to use fault-tolerant quantum error correction schemes to overcome noise: the errors arising from imperfections in physical components. The Gottesman-Kitaev-Preskill (GKP) code aims at achieving this in a hardware efficient manner by encoding finite-dimensional logical subspaces in the Hilbert space of one or more continuous variable modes. In near term implementations, however, it is not feasible to eliminate errors entirely, so it is natural to also employ alternative error mitigation techniques together with error correction. In this work, we study a quantum error mitigation method known as probabilistic error cancellation in the context of the GKP code. We compare Steane-type and teleportation-based GKP error correction, and calculate the sampling overheads associated with the technique for square and hexagonal GKP codes. We employ the stabilizer subsystem decomposition for GKP codes to obtain an effective logical channel for noisy operations that is used to express the ideal one of a target logical unitary. We consider noise from finite squeezing on the data and the two ancilla modes, needed for error correction, and examine the relationship between the sampling overhead and the noise for different decoding methods. Our results are calculated for single- and two-qubit GKP Clifford gates and one round of error correction, and show the nontrivial combination of error correction and mitigation in continuous variable codes.
Bosonic encoding of quantum information into harmonic oscillators is a hardware efficient approach to battle noise. In this regard, oscillator-to-oscillator codes not only provide an additional opportunity in bosonic encoding, but also extend the applicability of error correction to continuous-variable states ubiquitous in quantum sensing and communication. In this work, we derive the optimal oscillator-to-oscillator codes among the general family of Gottesman-Kitaev-Preskill (GKP)-stablizer codes for homogeneous noise. We prove that an arbitrary GKP-stabilizer code can be reduced to a generalized GKP two-mode-squeezing (TMS) code. The optimal encoding to minimize the geometric mean error can be constructed from GKP-TMS codes with an optimized GKP lattice and TMS gains. For single-mode data and ancilla, this optimal code design problem can be efficiently solved, and we further provide numerical evidence that a hexagonal GKP lattice is optimal and strictly better than the previously adopted square lattice. For the multimode case, general GKP lattice optimization is challenging. In the two-mode data and ancilla case, we identify the D4 lattice—a 4-dimensional dense-packing lattice—to be superior to a product of lower dimensional lattices. As a by-product, the code reduction allows us to prove a universal no-threshold-theorem for arbitrary oscillators-to-oscillators codes based on Gaussian encoding, even when the ancilla are not GKP states.