[Jump to code hierarchy]

Square-lattice GKP code [1]

Description

Single-mode GKP qudit-into-oscillator CSS code based on the rectangular lattice. Its stabilizer generators are oscillator displacement operators \(\hat{S}_q(2\alpha)=e^{-2i\alpha \hat{p}}\) and \(\hat{S}_p(2\beta)=e^{2i\beta \hat{x}}\). To ensure \(\hat{S}_q(2\alpha)\) and \(\hat{S}_p(2\beta)\) generate a stabilizer group that is Abelian, there is a constraint that \(\alpha\beta=q\pi/2\) where \(q\) is an integer denoting the logical dimension.

Codewords can be expressed as equal weight superpositions of coherent states on a rectangular lattice in phase space with spatial period \(2\sqrt{\pi}\). The exact GKP state is non-normalizable, so approximate constructions have to be considered.

The \(q=1\) trivial encoding is spanned by the canonical GKP state (a.k.a. grid state or qunaught state [2]), \begin{align} |GKP\rangle=\sum_{\ell\in\mathbb{Z}}|x=\ell\sqrt{2\pi}\rangle~,\tag*{$(1)$} \end{align}where \(|x\rangle\) are single-mode position states.

Single-mode GKP states have been introduced in quantum foundations research defining modular conjugate variables [3] and in coherent-state theory associated with the Heisenberg-Weyl group [4–6][7; Sec. 1.5 and 3.2]. The Dirac-delta orthonormal and complete [8] basis formed by the GKP canonical states and their error states is known as the Zak basis, discovered independently by Gelfand [9] and Zak [10]. It is also called the Gelfand mapping, Weil-Brezin transform, and \(kq\) representation in condensed-matter physics and signal processing [11][12; Ch. 1][13; Eq. (1.112)] (see Refs. [14,15] for more history). Expansion of a function on \(\mathbb{R}\) in terms of this basis is called the Zak transform. The Segal-Bargmann representations of GKP states are the theta functions of the lowest Landau level on a torus [16; Sec. V][17; Prop. 6.3] (see also Refs. [18,19]).

Protection

For stabilizers \(\hat{S}_q(2\alpha),\hat{S}_p(2\beta)\), the code can correct displacement errors up to \(\alpha/2\) in the \(q\)-direction and \(\beta/2\) in the \(p\)-direction. Approximately protects against photon loss errors [20,21], outperforming most other codes designed to explicitly protect against loss [21]. An analytical expression can be derived for the effective logical channel after loss [22]. Very sensitive to dephasing errors [23]. A biased-noise GKP error correcting code can be prepared by choosing \(\alpha\neq \beta\). Expectation values of observables versus energy may be fit to a power law [24].

Encoding

Dissipative stabilization of finite-energy square-lattice GKP states using stabilizers conjugated by a cooling [25; Appx. B] or damping operator, i.e., a damped exponential of the total occupation number [26,27]. Preparation of approximate square-lattice GKP states has been studied both theoretically and experimentally [20,28–30]. Various damped versions of GKP states are equivalent [31,32], and there exists a Fock-state expansion [33; Appx. A].Heralded preparation from a squeezed state using one ancilla qubit, by repeated qubit-controlled displacements of doubling length, each followed by a qubit measurement [34].Two Josephson junctions coupled by a gyrator [16].Periodic driving (a.k.a. Floquet engineering) [35,36].Approximate GKP states can be prepared using Gaussian operations and photon detectors [37].An optimal-size circuit using ancillary qubits can be used to prepare an approximate GKP state [38]. The size of the circuit is linear in the logarithm of the approximation parameters of the GKP codes.Numerically optimized preparation from the vacuum Fock state using a universal bosonic gate set [39].Dissipative stabilization using a high-impedance LRC circuit and a Josephson junction [40].

Gates

Clifford gates can be realized by performing linear-optical operations, symplectic transformations and displacements, all of which are Gaussian operations. Pauli gates can be performed using displacement operators. Clifford gates are fault tolerant in the sense that they map bounded-size errors to bounded-size errors [1].By applying square-lattice GKP error correction to Gaussian input states, universality can be achieved without non-Gaussian elements [41].Square-root of the Hadamard gate performed via a Kerr interaction [42].\(\sqrt{T}\) gate using a quadratic potential [43].

Decoding

Syndrome measurement can be done by applying a controlled displacement controlled by an ancilla qubit. The syndrome information can be obtained by measuring the ancilla qubit after the controlled-displacement operation; see [23; Sec. 2D].Decoder [2] based on Knill error correction (a.k.a. telecorrection [44]), which is based on teleportation [45,46].Pauli \(X\), \(Y\), and \(Z\) measurements can be performed by measuring \(-\hat{p}\), \(\hat{x}-\hat{p}\), and \(\hat{x}\), respectively. If the measurement outcome is close to an even multiple of \(\sqrt{\pi}\), then the outcome is +1. If the measurement outcome is close to an odd multiple of \(\sqrt{\pi}\), then the outcome is -1; see [23; Sec. 2D].Reinforcement learning decoder that uses only one ancilla qubit [47]. It has been extended to utilize previously measured syndrome information [48].Knill and Steane error correction have been analytically compared [49].

Fault Tolerance

Clifford gates can be realized by performing linear-optical operations, symplectic transformations and displacements, all of which are Gaussian operations. Pauli gates can be performed using displacement operators. Clifford gates are fault tolerant in the sense that they map bounded-size errors to bounded-size errors [1].Error correction scheme is fault-tolerant to displacement noise as long as all input states have displacement errors less than \(\sqrt{\pi}/6\) [50].

Realizations

Motional degree of freedom of a trapped ion: square-lattice GKP encoding realized with the help of post-selection by Home group [51,52], followed by realization of reduced form of GKP error correction, where displacement error syndromes are measured to one bit of precision using an ion electronic state [27]. State preparation also realized by Tan group [53]. Universal gate set, including a two-qubit entangling gate, realized by Tan group [54]. State initialization and application to measuring displacements [55].Microwave cavity coupled to superconducting circuits: reduced form of square-lattice GKP error correction, where displacement error syndromes are measured to one bit of precision using an ancillary transmon [29]. Subsequent paper by Devoret group [47] uses reinforcement learning for error-correction cycle design and is the first to go beyond break-even error-correction, with the lifetime of a logical qubit exceeding the cavity lifetime by about a factor of two (see also [56]). See Ref. [57] for another experiment. A feed-forward-free, i.e., fully autonomous protocol has also been implemented by Nord Quantique [58]. Qudit encodings with \(q=3,4\) have been realized, with logical error rates also beyond break even [59].Optical systems: GKP states and homodyne measurements have been realized in propagating telecom light by the Furusawa group [60] and on-chip by Xanadu Quantum Technologies [61].Single-qubit \(Z\)-gate has been demonstrated [62] in the single-photon subspace of an infinite-mode space [63], in which time and frequency become bosonic conjugate variables of a single effective bosonic mode. In this context, GKP position-state wavefunctions are called Dirac combs or frequency combs.

Notes

GKP syndrome extraction can be used for QKD with squeezed states [64].

Cousins

  • Approximate quantum error-correcting code (AQECC)— Square-lattice GKP codes approximately protect against photon loss [20,21,65].
  • Rotor code— Because square-lattice GKP error states are parameterized by two modular (i.e., periodic) variables of position and momentum, measuring one of the GKP stabilizers constrains the oscillator Hilbert space into that of a rotor.
  • \(\mathbb{Z}^n\) hypercubic lattice— GKP codewords, when written in terms of coherent states, form a square lattice in phase space.
  • Fusion-based quantum computing (FBQC) code— GKP states can be used to perform computation in a fusion-based encoding [66].
  • Symmetry-protected topological (SPT) code— The Segal-Bargmann representations of GKP states are the theta functions of the lowest Landau level on a torus [16; Sec. V][17; Prop. 6.3] (see also Refs. [18,19,67]).
  • Kitaev current-mirror qubit code— Current-mirror code phase gates utilize ancillary oscillators in square-lattice GKP states [68,69].
  • Zero-pi qubit code— Zero-pi code phase gates utilize ancillary oscillators in square-lattice GKP states [68,69].
  • Rotor GKP code— GKP (rotor GKP) codes protect against shifts in linear (angular) degrees of freedom.
  • Number-phase code— Square-lattice GKP codes utilize translational symmetry in phase space, while number-phase codes utilize rotational symmetry. The two are related via a mapping [70].
  • Asymmetric quantum code (AQC)— GKP code parameters against position and momentum displacements can be tuned by the choice of lattice (e.g., square vs rectangular).
  • Modular-qudit GKP code— The square-lattice GKP code can be obtained from the modular-qudit code by taking the physical qudit dimension to be infinite [1; Sec. II].
  • Spin GKP code— Spin-GKP code constructions utilize the Holstein-Primakoff mapping [71–73] to convert various expressions for square-lattice GKP states into codes for spin systems.

References

  1. [1]

    D. Gottesman, A. Kitaev, and J. Preskill, “Encoding a qubit in an oscillator”, Physical Review A 64, (2001) arXiv:quant-ph/0008040 DOI

  2. [2]

    B. W. Walshe, B. Q. Baragiola, R. N. Alexander, and N. C. Menicucci, “Continuous-variable gate teleportation and bosonic-code error correction”, Physical Review A 102, (2020) arXiv:2008.12791 DOI

  3. [3]

    Y. Aharonov, H. Pendleton, and A. Petersen, “Modular variables in quantum theory”, International Journal of Theoretical Physics 2, 213 (1969) DOI

  4. [4]

    J. von Neumann, “Mathematical Foundations of Quantum Mechanics”, (2018) DOI

  5. [5]

    P. Cartier, “Quantum mechanical commutation relations and theta functions”, Proceedings of Symposia in Pure Mathematics 9 (1966)

  6. [6]

    A. M. Perelomov, “Coherent states and theta functions”, Functional Analysis and Its Applications 6, 292 (1972) DOI

  7. [7]

    A. Perelomov, Generalized Coherent States and Their Applications (Springer Berlin Heidelberg, 1986) DOI

  8. [8]

    H. Bacry, A. Grossmann, and J. Zak, “Proof of completeness of lattice states in thekqrepresentation”, Physical Review B 12, 1118 (1975) DOI

  9. [9]

    I. M. Gelfand, “Expansion in characteristic functions of an equation with periodic coefficients”. In: Doklady Akademii Nauk SSSR (N.S.) 73 (1950), pp. 1117–1120

  10. [10]

    J. Zak, “Finite Translations in Solid-State Physics”, Physical Review Letters 19, 1385 (1967) DOI

  11. [11]

    A. Weil, “Sur certains groupes d’opérateurs unitaires”, Acta Mathematica 111, 143 (1964) DOI

  12. [12]

    H. G. Feichtinger and T. Strohmer, editors , Gabor Analysis and Algorithms (Birkhäuser Boston, 1998) DOI

  13. [13]

    G. B. Folland, “Harmonic Analysis in Phase Space. (AM-122)”, (1989) DOI

  14. [14]

    A. J. E. M. Janssen, “The Zak transform: a signal transform for sampled time-continuous signals”, Philips Journal of Research 43(1), 23-69 (1988)

  15. [15]

    I. Daubechies and A. J. E. M. Janssen, “Two theorems on lattice expansions”, IEEE Transactions on Information Theory 39, 3 (1993) DOI

  16. [16]

    M. Rymarz, S. Bosco, A. Ciani, and D. P. DiVincenzo, “Hardware-Encoding Grid States in a Nonreciprocal Superconducting Circuit”, Physical Review X 11, (2021) arXiv:2002.07718 DOI

  17. [17]

    T. Dereli and T. Popov, “Bloch waves and non-commutative tori of magnetic translations”, Journal of Mathematical Physics 62, (2021) arXiv:2106.11093 DOI

  18. [18]

    F. D. M. Haldane and E. H. Rezayi, “Periodic Laughlin-Jastrow wave functions for the fractional quantized Hall effect”, Physical Review B 31, 2529 (1985) DOI

  19. [19]

    Tata Lectures on Theta I (Birkhäuser Boston, 2007) DOI

  20. [20]

    B. M. Terhal and D. Weigand, “Encoding a qubit into a cavity mode in circuit QED using phase estimation”, Physical Review A 93, (2016) arXiv:1506.05033 DOI

  21. [21]

    V. V. Albert et al., “Performance and structure of single-mode bosonic codes”, Physical Review A 97, (2018) arXiv:1708.05010 DOI

  22. [22]

    T. B. Harris, T. Matsuura, B. Q. Baragiola, and N. C. Menicucci, “Logical channel for heralded and pure loss with the Gottesman-Kitaev-Preskill code”, Physical Review A 112, (2025) arXiv:2504.13497 DOI

  23. [23]

    A. L. Grimsmo and S. Puri, “Quantum Error Correction with the Gottesman-Kitaev-Preskill Code”, PRX Quantum 2, (2021) arXiv:2106.12989 DOI

  24. [24]

    G.-Z. Luo and M. Otten, “Energy-Scaled Zero-Noise Extrapolation for Gottesman-Kitaev-Preskill Code”, (2025) arXiv:2512.03583

  25. [25]

    N. C. Menicucci, “Fault-Tolerant Measurement-Based Quantum Computing with Continuous-Variable Cluster States”, Physical Review Letters 112, (2014) arXiv:1310.7596 DOI

  26. [26]

    B. Royer, S. Singh, and S. M. Girvin, “Stabilization of Finite-Energy Gottesman-Kitaev-Preskill States”, Physical Review Letters 125, (2020) arXiv:2009.07941 DOI

  27. [27]

    B. de Neeve, T. L. Nguyen, T. Behrle, and J. Home, “Error correction of a logical grid state qubit by dissipative pumping”, (2020) arXiv:2010.09681

  28. [28]

    D. J. Weigand and B. M. Terhal, “Generating grid states from Schrödinger-cat states without postselection”, Physical Review A 97, (2018) arXiv:1709.08580 DOI

  29. [29]

    P. Campagne-Ibarcq et al., “Quantum error correction of a qubit encoded in grid states of an oscillator”, Nature 584, 368 (2020) arXiv:1907.12487 DOI

  30. [30]

    I. Tzitrin, J. E. Bourassa, N. C. Menicucci, and K. K. Sabapathy, “Progress towards practical qubit computation using approximate Gottesman-Kitaev-Preskill codes”, Physical Review A 101, (2020) arXiv:1910.03673 DOI

  31. [31]

    T. Matsuura, H. Yamasaki, and M. Koashi, “Equivalence of approximate Gottesman-Kitaev-Preskill codes”, Physical Review A 102, (2020) arXiv:1910.08301 DOI

  32. [32]

    L. J. Mensen, B. Q. Baragiola, and N. C. Menicucci, “Phase-space methods for representing, manipulating, and correcting Gottesman-Kitaev-Preskill qubits”, Physical Review A 104, (2021) arXiv:2012.12488 DOI

  33. [33]

    B. M. Terhal, J. Conrad, and C. Vuillot, “Towards scalable bosonic quantum error correction”, Quantum Science and Technology 5, 043001 (2020) arXiv:2002.11008 DOI

  34. [34]

    B. C. Travaglione and G. J. Milburn, “Preparing encoded states in an oscillator”, Physical Review A 66, (2002) arXiv:quant-ph/0205114 DOI

  35. [35]

    J. Conrad, “Twirling and Hamiltonian engineering via dynamical decoupling for Gottesman-Kitaev-Preskill quantum computing”, Physical Review A 103, (2021) arXiv:2010.13853 DOI

  36. [36]

    X. C. Kolesnikow, R. W. Bomantara, A. C. Doherty, and A. L. Grimsmo, “Gottesman-Kitaev-Preskill State Preparation Using Periodic Driving”, Physical Review Letters 132, (2024) arXiv:2303.03541 DOI

  37. [37]

    D. Su, C. R. Myers, and K. K. Sabapathy, “Conversion of Gaussian states to non-Gaussian states using photon-number-resolving detectors”, Physical Review A 100, (2019) arXiv:1902.02323 DOI

  38. [38]

    L. Brenner, L. Caha, X. Coiteux-Roy, and R. Koenig, “Complexity of Gottesman-Kitaev-Preskill States”, Physical Review X 15, (2025) arXiv:2410.19610 DOI

  39. [39]

    S. Blair, F. Arzani, G. Ferrini, and A. Ferraro, “Towards fault-tolerant quantum computation with universal continuous-variable gates”, (2025) arXiv:2506.13643

  40. [40]

    F. Nathan, L. O’Brien, K. Noh, M. H. Matheny, A. L. Grimsmo, L. Jiang, and G. Refael, “Self-correcting GKP qubit and gates in a driven-dissipative circuit”, (2025) arXiv:2405.05671

  41. [41]

    B. Q. Baragiola, G. Pantaleoni, R. N. Alexander, A. Karanjai, and N. C. Menicucci, “All-Gaussian Universality and Fault Tolerance with the Gottesman-Kitaev-Preskill Code”, Physical Review Letters 123, (2019) arXiv:1903.00012 DOI

  42. [42]

    J. Boudreault, R. Shillito, J.-B. Bertrand, and B. Royer, “Using a Self-Kerr Nonlinearity for Magic State Preparation in Grid Codes”, Physical Review Letters 136, (2026) arXiv:2507.09684 DOI

  43. [43]

    L. O’Brien, G. Refael, and F. Nathan, “Exponentially robust non-Clifford gate in a driven-dissipative circuit”, (2025) arXiv:2507.19713

  44. [44]

    C. M. Dawson, H. L. Haselgrove, and M. A. Nielsen, “Noise thresholds for optical cluster-state quantum computation”, Physical Review A 73, (2006) arXiv:quant-ph/0601066 DOI

  45. [45]

    E. Knill, “Quantum computing with realistically noisy devices”, Nature 434, 39 (2005) arXiv:quant-ph/0410199 DOI

  46. [46]

    E. Knill, “Scalable Quantum Computation in the Presence of Large Detected-Error Rates”, (2004) arXiv:quant-ph/0312190

  47. [47]

    V. V. Sivak et al., “Real-time quantum error correction beyond break-even”, Nature 616, 50 (2023) arXiv:2211.09116 DOI

  48. [48]

    M. Puviani, S. Borah, R. Zen, J. Olle, and F. Marquardt, “Non-Markovian Feedback for Optimized Quantum Error Correction”, Physical Review Letters 134, (2025) arXiv:2312.07391 DOI

  49. [49]

    F. K. Marqversen, J. H. Wesenberg, N. T. Zinner, and U. L. Andersen, “Performance analysis of GKP error correction”, (2025) arXiv:2505.14775

  50. [50]

    S. Glancy and E. Knill, “Error analysis for encoding a qubit in an oscillator”, Physical Review A 73, (2006) arXiv:quant-ph/0510107 DOI

  51. [51]

    C. Flühmann, T. L. Nguyen, M. Marinelli, V. Negnevitsky, K. Mehta, and J. P. Home, “Encoding a qubit in a trapped-ion mechanical oscillator”, Nature 566, 513 (2019) arXiv:1807.01033 DOI

  52. [52]

    C. Flühmann and J. P. Home, “Direct Characteristic-Function Tomography of Quantum States of the Trapped-Ion Motional Oscillator”, Physical Review Letters 125, (2020) arXiv:1907.06478 DOI

  53. [53]

    V. G. Matsos, C. H. Valahu, T. Navickas, A. D. Rao, M. J. Millican, X. C. Kolesnikow, M. J. Biercuk, and T. R. Tan, “Robust and Deterministic Preparation of Bosonic Logical States in a Trapped Ion”, Physical Review Letters 133, (2024) arXiv:2310.15546 DOI

  54. [54]

    V. G. Matsos, C. H. Valahu, M. J. Millican, T. Navickas, X. C. Kolesnikow, M. J. Biercuk, and T. R. Tan, “Universal Quantum Gate Set for Gottesman-Kitaev-Preskill Logical Qubits”, (2024) arXiv:2409.05455

  55. [55]

    C. H. Valahu, M. P. Stafford, Z. Huang, V. G. Matsos, M. J. Millican, T. Chalermpusitarak, N. C. Menicucci, J. Combes, B. Q. Baragiola, and T. R. Tan, “Quantum-Enhanced Multi-Parameter Sensing in a Single Mode”, (2025) arXiv:2412.04865

  56. [56]

    Z. Ni et al., “Beating the break-even point with a discrete-variable-encoded logical qubit”, Nature 616, 56 (2023) arXiv:2211.09319 DOI

  57. [57]

    M. Kudra et al., “Robust Preparation of Wigner-Negative States with Optimized SNAP-Displacement Sequences”, PRX Quantum 3, (2022) arXiv:2111.07965 DOI

  58. [58]

    D. Lachance-Quirion et al., “Autonomous quantum error correction of Gottesman-Kitaev-Preskill states”, (2023) arXiv:2310.11400

  59. [59]

    B. L. Brock, S. Singh, A. Eickbusch, V. V. Sivak, A. Z. Ding, L. Frunzio, S. M. Girvin, and M. H. Devoret, “Quantum error correction of qudits beyond break-even”, Nature 641, 612 (2025) arXiv:2409.15065 DOI

  60. [60]

    S. Konno et al., “Logical states for fault-tolerant quantum computation with propagating light”, Science 383, 289 (2024) arXiv:2309.02306 DOI

  61. [61]

    M. V. Larsen et al., “Integrated photonic source of Gottesman–Kitaev–Preskill qubits”, Nature 642, 587 (2025) DOI

  62. [62]

    N. Fabre et al., “Generation of a time-frequency grid state with integrated biphoton frequency combs”, Physical Review A 102, (2020) arXiv:1904.01351 DOI

  63. [63]

    É. Descamps, A. Keller, and P. Milman, “Gottesman-Kitaev-Preskill Encoding in Continuous Modal Variables of Single Photons”, Physical Review Letters 132, (2024) arXiv:2310.12618 DOI

  64. [64]

    D. Gottesman and J. Preskill, “Secure quantum key distribution using squeezed states”, Physical Review A 63, (2001) arXiv:quant-ph/0008046 DOI

  65. [65]

    K. Noh, V. V. Albert, and L. Jiang, “Quantum Capacity Bounds of Gaussian Thermal Loss Channels and Achievable Rates With Gottesman-Kitaev-Preskill Codes”, IEEE Transactions on Information Theory 65, 2563 (2019) arXiv:1801.07271 DOI

  66. [66]

    A. Doherty, M. Gimeno-Segovia, D. Litinski, N. Nickerson, M. Pant, T. Rudolph, and C. Sparrow, “Generation and Measurement of Entangled Systems of Photonic GKP Qubits”, U.S. Patent Application 18/273,753 (2024)

  67. [67]

    S. Ganeshan and M. Levin, “Formalism for the solution of quadratic Hamiltonians with large cosine terms”, Physical Review B 93, (2016) arXiv:1507.08966 DOI

  68. [68]

    A. Kitaev, “Protected qubit based on a superconducting current mirror”, (2006) arXiv:cond-mat/0609441

  69. [69]

    P. Brooks, A. Kitaev, and J. Preskill, “Protected gates for superconducting qubits”, Physical Review A 87, (2013) arXiv:1302.4122 DOI

  70. [70]

    A. D. C. Tosta, T. O. Maciel, and L. Aolita, “Grand Unification of continuous-variable codes”, (2022) arXiv:2206.01751

  71. [71]

    T. Holstein and H. Primakoff, “Field Dependence of the Intrinsic Domain Magnetization of a Ferromagnet”, Physical Review 58, 1098 (1940) DOI

  72. [72]

    C. D. Cushen and R. L. Hudson, “A quantum-mechanical central limit theorem”, Journal of Applied Probability 8, 454 (1971) DOI

  73. [73]

    A. Klein and E. R. Marshalek, “Boson realizations of Lie algebras with applications to nuclear physics”, Reviews of Modern Physics 63, 375 (1991) DOI

Page edit log

Your contribution is welcome!

on github.com (edit & pull request)

— see instructions

Zoo Code ID: gkp

Cite as:
“Square-lattice GKP code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/gkp, arXiv:2606.11484
BibTeX:
@incollection{eczoo_gkp,
title={Square-lattice GKP code},
booktitle={The Error Correction Zoo},
year={2026},
editor={Albert, Victor V. and Faist, Philippe},
eprint={2606.11484},
doi={10.48550/arXiv.2606.11484},
url={https://errorcorrectionzoo.org/c/gkp}
}
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/gkp

Cite as:

“Square-lattice GKP code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/gkp, arXiv:2606.11484

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/quantum/oscillators/stabilizer/lattice/gkp.yml.