Jump to content

Draft:Gottesman-Kitaev-Preskill Code

From Wikipedia, the free encyclopedia

The Gottesman-Kitaev-Preskill (GKP) code is a quantum error correcting code that encodes logical qubits into the continuous degrees of freedom of a quantum system. Most often, it is used in continuous variable (CV) photonic quantum computing, in which logical qubits are encoded into the field quadratures of an optical mode. This can be thought of as the well known quantum harmonic oscillator with conjugate position and momentum operators.[1]. By encoding logical qubits into a single optical mode, the GKP code demonstrates greater hardware efficiency than traditional qubit codes. Instead of needing many qubits to act as redundancy for a single qubit, the GKP code instead requires a precisely constructed optical state. GKP codes are able to protect against both small shifts in the quadratures, but also loss channels such as photon loss in a photonic system.[2]


Overview

[edit]

GKP codes protects against random shifts in the quadratures, which can be modeled as a Gaussian random displacement channel.[3] This describes a displacement on a state by with probability determined by variance . denotes the displacement operator defined as This unitary operator generates displaced vacuum states in phase space, resulting in coherent states.

The stabilizer group of the GKP code is the set , for . Where and . The logical Pauli operators and are defined by displacements over complex and such that and anticommute.[4]

Ideal GKP codewords can be constructed (eigenstates of and ) as infinite superpositions of functions in the amplitudes of each quadrature, forming a Dirac comb of even spacing in their quasi-probability distributions. The simplest example is the square code, where the spacing of peaks is the same in both quadratures. In this case, each peak is separated by and the logical states can be written as

Errors can be corrected by applying the and operators as in any stabilizer code. Since these operators can be implemented with linear optical components, and the code words can be further concatenated with more traditional qubit codes, GKP codes have been studied extensively in regards to error correction in CV quantum computing.[5]

These ideal states, however, are not physical. Not only do they require infinite squeezing in both quadratures, they are also not normalizable. In practice, GKP states must be approximated.[6] These approximate states display finite squeezing, and, in general, an overall Gaussian envelope for normalization.

For instance, can be approximated as a normalized Gaussian of width [1] The approximate codeword then becomes a superposition of such Gaussians, with the aforementioned normalization envelope. Where and are normalization factors, and translates by .

This finite squeezing is another source of error, but since the code is designed to protect against small shifts in the quadratures, this error is negligible for modest squeezing.[citation needed] This means that GKP encoding can be easily implemented with the aforementioned optical techniques.

Experimental Realization

[edit]

Physically, GKP states are realized in the following way. First, cat states are generated via Gaussian boson sampling (GBS) techniques, then, the cat states are squeezed and interfered at a beam splitter. Homodyne detection is performed at one output of the beam splitter, and depending on the outcome, an approximate GKP state is created. The output can be further interfered to produce better approximations[7]

Cat states are superpositions of out of phase coherent states. They can be written as Where is a normalization factor defined as . These states can be generated in a variety of ways with varying efficiencies. Photon subtraction is one approach, which uses squeezed vacuum states, beam splitters, and photon number resolving (PNR) detectors. The beam splitters must be tuned with a high transmissivity however, making this process impractical for state preparation.

The approach pursued by Xanadu is that of GBS. [8] A GBS device consists of an input of squeezed vacuum states, a universal linear interferometer, which can enact any unitary transformation on a given state, and a PNR detector. An input mode GBS device can produce a non Gaussian state of peaks. Producing a state with greater number of peaks makes the GKP state production process more efficient, as less iterations must occur to produce approximate states. The input modes are interfered, generating a superposition of Gaussians, which can be further refined into approximate GKP states.

A homodyne detector measures one output of the beam splitter (measuring, in general, modes), heralding approximate cat states. Transforming these cat states to GKP states is a similar process. A beam splitter combines two squeezed multi-peak states, and performs another homodyne measurement on the second mode. The homodyne measurements yielding greater squeezing correspond to the most likely outcomes of measurement, meaning this procedure produces well approximated GKP states with high probability.

Loss Channels

[edit]

GKP codes are primarily designed to protect against small shifts in phase space, but they can also be used to protect against photon loss. Photon loss can be modeled as mixing the GKP state with a vacuum state on a beam splitter with transmittance .[2] The effect of this loss is the shrinking of the state by a factor of in phase space, and shifting the peaks of the state towards the origin. This can result in a shift of magnitude greater than —an error outside the correctable distance. It has been shown, however, that loss can be corrected without additional overhead if the GKP state is not squeezed to an unrealistic degree. In fact, techniques to correct explicitly for photon losses introduce more errors than they correct, meaning the GKP code is resistant to both small shifts and loss channels.

References

[edit]
  1. ^ a b Gottesman, Daniel; Kitaev, Alexei; Preskill, John (2001). "Encoding a qubit in an oscillator". Physical Review A. 64 (1): 012310. arXiv:quant-ph/0008040. Bibcode:2001PhRvA..64a2310G. doi:10.1103/PhysRevA.64.012310.
  2. ^ a b Hastrup, Jacob; Andersen, Ulrik Lund (2023). "Analysis of loss correction with the Gottesman-Kitaev-Preskill code". Physical Review A. 108 (5): 052413. arXiv:2112.01425. Bibcode:2023PhRvA.108e2413H. doi:10.1103/physreva.108.052413.
  3. ^ The fabulous world of GKP codes (Report). 2024-12-04.
  4. ^ Grimsmo, Arne L.; Puri, Shruti (2021). "Quantum Error Correction with the Gottesman-Kitaev-Preskill Code". PRX Quantum. 2 (2): 020101. arXiv:2106.12989. Bibcode:2021PRXQ....2b0101G. doi:10.1103/prxquantum.2.020101.
  5. ^ Xu, Yijia; Wang, Yixu; Kuo, En-Jui; Albert, Victor V. (2023). "Qubit-Oscillator Concatenated Codes: Decoding Formalism and Code Comparison". PRX Quantum. 4 (2): 020342. arXiv:2209.04573. Bibcode:2023PRXQ....4b0342X. doi:10.1103/PRXQuantum.4.020342.
  6. ^ Matsuura, Takaya; Yamasaki, Hayata; Koashi, Masato (2020). "Equivalence of approximate Gottesman-Kitaev-Preskill codes". Physical Review A. 102 (3): 032408. arXiv:1910.08301. Bibcode:2020PhRvA.102c2408M. doi:10.1103/PhysRevA.102.032408.
  7. ^ "Generation of GKP states with optical states". NIST.
  8. ^ Aghaee Rad, H.; et al. (2025). "Scaling and networking a modular photonic quantum computer". Nature. 638 (8052): 912–919. Bibcode:2025Natur.638..912A. doi:10.1038/s41586-024-08406-9. PMC 11864973. PMID 39843755.