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:2406.06418 · PRX Quantum

Bridging Magic and Non-Gaussian Resources via Gottesman-Kitaev-Preskill Encoding

Oliver Hahn, Giulia Ferrini, Ryuji Takagi

Published Feb 18, 2025• 15 citations
arXivHTMLPDF

Abstract

Although the similarity between nonstabilizer states—also known as magic states—in discrete-variable systems and non-Gaussian states in continuous-variable systems has widely been recognized, the precise connections between these two notions have still been unclear. We establish a fundamental link between these two quantum resources via the Gottesman-Kitaev-Preskill (GKP) encoding. We show that the negativity of the continuous-variable Wigner function for an encoded GKP state coincides with a magic measure we introduce, which matches the negativity of the discrete Wigner function for odd dimensions. We also provide a continuous-variable representation of the stabilizer Rényi entropy—a recent proposal for a magic measure for multiqubit states. We further provide the magic measure with an operational interpretation as a runtime of a classical simulation algorithm. In addition, we employ our results to prove that implementing a multiqubit logical non-Clifford operation in the GKP code subspace requires a non-Gaussian operation even at the limit of perfect encoding, despite the fact that the ideal GKP states already come with a large amount of non-Gaussianity.

DOI
10.1103/prxquantum.6.010330

Related papers

Non-Gaussianity in cat codes: global incompatibility and local geometric alignment with the magic resource

Yuwei Zhu, Seungbeom Chin, William J. Munro +1 more

Non-Gaussianity is an essential resource for genuine quantum advantages in continuous-variable quantum systems and is regarded as a counterpart of the magic resource in discrete-variable systems. Recently, an exact correspondence between non-Gaussianity (NG) and the magic resource was identified within the Gottesman--Kitaev--Preskill (GKP) encoding framework. Whether such a relation persists beyond GKP encoding, however, remains unclear. Here, we address this question in the cat-code setting. By comparing the Wigner logarithmic negativity (WLN) and a magic measure defined from a phase-operator basis, we analyze the resource geometry of non-degenerate $d$-peaked cat states. We find that cat codes do not inherit the global value-preserving GKP magic--NG equivalence, but their asymptotic WLN geometry allows a constructive local alignment with the magic-measure geometry. Specifically, under a distinguished SU($d$) asymptotic cat code, we establish a sector-dependent alignment between WLN level sets and magic-measure level sets based on their intrinsic local geometries. These results identify both the global incompatibility and the locally constructive relation between magic and non-Gaussian resources in cat codes, suggesting a geometry-based approach to resource correspondences beyond the GKP framework.

quant-pharXiv:2607.15739•Jul 20, 2026•0 citations

From the Bloch Sphere to Phase-Space Representations with the Gottesman–Kitaev–Preskill Encoding

Laura García-Álvarez, Alessandro Ferraro, Giulia Ferrini

Abstract In this work, we study the Wigner phase-space representation of qubit states encoded in continuous variables (CV) by using the Gottesman–Kitaev–Preskill (GKP) mapping. We explore a possible connection between resources for universal quantum computation in discrete-variable (DV) systems, i.e. non-stabilizer states, and negativity of the Wigner function in CV architectures, which is a necessary requirement for quantum advantage. In particular, we show that the lowest Wigner logarithmic negativity corresponds to encoded stabilizer states, while the maximum negativity is associated with the most non-stabilizer states, H-type and T-type quantum states.

arXiv:1911.12346•Mathematics for industry•Oct 22, 2020•8 citations

Equivalence of approximate Gottesman-Kitaev-Preskill codes

Takaya Matsuura, Hayata Yamasaki, Masato Koashi

The Gottesman-Kitaev-Preskill (gkp) quantum error-correcting code attracts much attention in continuous variable (CV) quantum computation and CV quantum communication due to the simplicity of error-correcting routines and the high tolerance against Gaussian errors. Since the gkp code state should be regarded as a limit of physically meaningful approximate ones, various approximations have been developed until today, but explicit relations among them are still unclear. In this paper, we rigorously prove the equivalence of these approximate gkp codes with an explicit correspondence of the parameters. We also propose a standard form of the approximate code states in the position representation, which enables us to derive closed-form expressions for the Wigner function, inner products, and the average photon number in terms of the theta functions. Our results serve as fundamental tools for further analyses of fault-tolerant quantum computation and channel coding using approximate gkp codes.

arXiv:1910.08301•Physical Review A•Sep 15, 2020•61 citations

The logical set of Gaussian states under the stabilizer subsystem decomposition

Santiago Zamora, Kaustav Chatterjee, Ulrik Lund Andersen +4 more

Universal quantum computation requires non-Gaussianity in continuous-variable systems and non-stabilizerness in discrete-variable systems. Yet, mapping a Gaussian state into the Gottesman-Kitaev-Preskill logical subspace can yield a logical qubit with non-stabilizer resources. To understand how the continuous-variable structure determines logical resources, we characterize the image of single-mode Gaussian states under the corresponding extraction channel, known as the stabilizer subsystem decomposition. Specifically, we derive series expressions for the logical Bloch vector and characterize the resulting reachable set, enabling an analytical treatment of the robustness of magic of the logical states. We then turn this geometric framework into a certification tool: by mapping a discrete-variable qubit witness to a continuous-variable squeezing witness, we obtain lower bounds on the squeezing of prepared states. We also show that ensembles of Gaussian states can violate both stabilizer and classical bounds. Violation of the stabilizer bound certifies the relational resource known as "set-magic," while violation of the classical bound enables the certification of cryptographic randomness at moderate squeezing.

quant-pharXiv:2609.26898•Sep 24, 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

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
Although the similarity between nonstabilizer states—also known as magic states—in discrete-variable systems and non-Gaussian states in continuous-variable systems has widely been recognized, the precise connections between these two notions have still been unclear. We establish a fundamental link between these two quantum resources via the Gottesman-Kitaev-Preskill (GKP) encoding. We show that the negativity of the continuous-variable Wigner function for an encoded GKP state coincides with a magic measure we introduce, which matches the negativity of the discrete Wigner function for odd dimensions. We also provide a continuous-variable representation of the stabilizer Rényi entropy—a recent proposal for a magic measure for multiqubit states. We further provide the magic measure with an operational interpretation as a runtime of a classical simulation algorithm. In addition, we employ our results to prove that implementing a multiqubit logical non-Clifford operation in the GKP code subspace requires a non-Gaussian operation even at the limit of perfect encoding, despite the fact that the ideal GKP states already come with a large amount of non-Gaussianity.
Non-Gaussianity is an essential resource for genuine quantum advantages in continuous-variable quantum systems and is regarded as a counterpart of the magic resource in discrete-variable systems. Recently, an exact correspondence between non-Gaussianity (NG) and the magic resource was identified within the Gottesman--Kitaev--Preskill (GKP) encoding framework. Whether such a relation persists beyond GKP encoding, however, remains unclear. Here, we address this question in the cat-code setting. By comparing the Wigner logarithmic negativity (WLN) and a magic measure defined from a phase-operator basis, we analyze the resource geometry of non-degenerate ddd-peaked cat states. We find that cat codes do not inherit the global value-preserving GKP magic--NG equivalence, but their asymptotic WLN geometry allows a constructive local alignment with the magic-measure geometry. Specifically, under a distinguished SU(ddd) asymptotic cat code, we establish a sector-dependent alignment between WLN level sets and magic-measure level sets based on their intrinsic local geometries. These results identify both the global incompatibility and the locally constructive relation between magic and non-Gaussian resources in cat codes, suggesting a geometry-based approach to resource correspondences beyond the GKP framework.
Abstract In this work, we study the Wigner phase-space representation of qubit states encoded in continuous variables (CV) by using the Gottesman–Kitaev–Preskill (GKP) mapping. We explore a possible connection between resources for universal quantum computation in discrete-variable (DV) systems, i.e. non-stabilizer states, and negativity of the Wigner function in CV architectures, which is a necessary requirement for quantum advantage. In particular, we show that the lowest Wigner logarithmic negativity corresponds to encoded stabilizer states, while the maximum negativity is associated with the most non-stabilizer states, H-type and T-type quantum states.
The Gottesman-Kitaev-Preskill (gkp) quantum error-correcting code attracts much attention in continuous variable (CV) quantum computation and CV quantum communication due to the simplicity of error-correcting routines and the high tolerance against Gaussian errors. Since the gkp code state should be regarded as a limit of physically meaningful approximate ones, various approximations have been developed until today, but explicit relations among them are still unclear. In this paper, we rigorously prove the equivalence of these approximate gkp codes with an explicit correspondence of the parameters. We also propose a standard form of the approximate code states in the position representation, which enables us to derive closed-form expressions for the Wigner function, inner products, and the average photon number in terms of the theta functions. Our results serve as fundamental tools for further analyses of fault-tolerant quantum computation and channel coding using approximate gkp codes.
Universal quantum computation requires non-Gaussianity in continuous-variable systems and non-stabilizerness in discrete-variable systems. Yet, mapping a Gaussian state into the Gottesman-Kitaev-Preskill logical subspace can yield a logical qubit with non-stabilizer resources. To understand how the continuous-variable structure determines logical resources, we characterize the image of single-mode Gaussian states under the corresponding extraction channel, known as the stabilizer subsystem decomposition. Specifically, we derive series expressions for the logical Bloch vector and characterize the resulting reachable set, enabling an analytical treatment of the robustness of magic of the logical states. We then turn this geometric framework into a certification tool: by mapping a discrete-variable qubit witness to a continuous-variable squeezing witness, we obtain lower bounds on the squeezing of prepared states. We also show that ensembles of Gaussian states can violate both stabilizer and classical bounds. Violation of the stabilizer bound certifies the relational resource known as "set-magic," while violation of the classical bound enables the certification of cryptographic randomness at moderate squeezing.
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.
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.