betaFeedback

WorksPhysics and Astronomy

Time- and Photon-Optimal Paths for the Preparation and Logical Flip of Gottesman-Kitaev-Preskill States

Abstract

Gottesman-Kitaev-Preskill (GKP) states are highly non-Gaussian, making their control challenging, particularly in the presence of photon loss. Here, we use the brachistochrone, the fastest path at bounded speed, to construct ideal nonlinear Hamiltonians for state preparation and logical gates, and compare it with the photon-optimal path. We find that the two paths nearly coincide for state preparation but differ markedly for logical operations, namely the brachistochrone preserves the encoded qubit during a bit flip, whereas the photon-optimal path flips a known state through the vacuum. We then introduce the tangential capacity to quantify how effectively gate sets track these paths. Using this analysis, we find that conditional squeezing achieves the highest capacity, preparing GKP states in 824 ns with a fidelity of 0.99 and a minimum closeness to the path of 0.90, compared with 0.98 and 0.51 for conditional displacements and 0.83 and 0.19 for SNAP gates.

Introduction.—The brachistochrone problem, posed by Bernoulli in 1696, asks for the curve along which a body falls between two points in the shortest time [1]. Bernoulli solved it with Fermat’s principle, treating the body as a light ray that follows the path of least time through a medium of varying refractive index [2, 3], ultimately leading to the development of the calculus of variations. In quantum mechanics, speed limits bound how fast a state can evolve [4, 5, 6], but the quantum brachistochrone has been shown to reach this bound [7, 8, 9]. For an oscillator, photon loss adds a second cost, and the path of least photon exposure obeys Fermat’s principle with the mean photon number as the refractive index. Here, we show that these two paths provide a common framework for preparing and manipulating bosonic states.

Among bosonic codes [10, 11, 12, 13], which include cat [14, 15] and binomial codes [16, 17], Gottesman–Kitaev–Preskill (GKP) codes protect a qubit against small displacements in both quadratures with a grid of phase-space states [18, 19]. GKP error correction has been demonstrated in circuit QED [20, 21], beyond break-even [22], autonomously [23], and in a fully planar circuit [24], as well as in the motion of a trapped ion [25, 26]. Other hardware-efficient platforms, such as the grid-ium [27], encode the grid in the circuit Hamiltonian itself, and two Josephson junctions coupled by a gyrator, an element recently demonstrated on chip [28], would encode a GKP qubit in their degenerate ground space [29].

Operations on these codes are highly non-Gaussian [30], realized in circuit QED with echoed conditional displacements [31] or selective number-dependent arbitrary phase (SNAP) gates and displacements [32, 33] and by other preparation protocols for trapped ions, photonic systems, and superconducting circuits [25, 26, 34, 35, 36, 37, 38, 39, 40, 41, 42]. However, the circuit-QED pulses that prepare GKP states typically last microseconds [22, 31], during which the control qubit (the ancilla) decoheres and the oscillator loses photons. Optimal control and reinforcement learning reduce these errors by optimizing the pulses within a gate family [43, 44, 45], and time-optimal control has been applied to Fock and cat states in qubit–oscillator models [46, 47]. Instead, the quantum brachistochrone provides a reference path, which a gate set follows directly only where its generators push the state along it. For GKP states, which contain only even photon numbers, this requires generators that change the photon number in pairs, such as conditional squeezing [48], rather than the single-photon generators of displacements.

In this Letter, we derive the time- and photon-optimal paths for GKP preparation and for operations on the logical states, together with the explicit nonlinear Hamiltonians that generate the time-optimal paths. The two paths nearly coincide in preparation, but between the logical states the photon-optimal path detours through the vacuum, so only the time-optimal path keeps the qubit encoded. We then introduce the tangential capacity, the largest speed at which a gate set moves a state directly along a path. For conditional squeezing (CS), conditional displacement (CD), and SNAP-displacement control (SNAP) at equal drive strength, it predicts that only CS can follow the GKP brachistochrone directly. We test this prediction with pulses optimized by gradient-ascent pulse engineering (GRAPE) under experimentally motivated noise rates, and we observe that the CS gate set follows the GKP brachistochrone most closely.

Time-optimal paths.—The distance between two states ∣ψi⟩\lvert\psi_i\rangle and ∣ψf⟩\lvert\psi_f\rangle is the angle θ\theta, with cos⁡θ=⟨ψi∣ψf⟩≥0\cos\theta= \langle\psi_i\lvert\psi_f\rangle\ge0, and a state moves at a speed set by its energy uncertainty ΔH\Delta H [49]. At speeds up to ω\omega, reaching ∣ψf⟩\lvert\psi_f\rangle takes at least T∗=θ/ωT^* = \theta/\omega [4, 6], a limit reached only by the brachistochrone, the great circle between the two states traveled at full speed. We take ω=5.3 μs−1\omega= 5.3\ \mu\mathrm{s}^{-1} (ω/2π=0.84\omega/2\pi= 0.84 MHz), the speed at which the gate sets compared below move the vacuum at the drive strength proposed for conditional squeezing [48]. The brachistochrone’s generator is known for any two states [7] (Supplementary Information (SI) [50], Sec. I),

Hopt=iωsin⁡θ(∣ψf⟩⟨ψi∣−∣ψi⟩⟨ψf∣),(1)H_{\mathrm{opt}} = \frac{i\omega}{\sin\theta}\left(|\psi_f\rangle\langle\psi_i| - |\psi_i\rangle\langle\psi_f|\right), \tag*{(1)}

which rotates ∣ψi⟩|\psi_i\rangle into ∣ψf⟩|\psi_f\rangle through the path states ∣p(t)⟩=[sin⁡(θ−ωt)∣ψi⟩+sin⁡(ωt)∣ψf⟩]/sin⁡θ|p(t)\rangle= [\sin(\theta-\omega t)|\psi_i\rangle+\sin(\omega t)|\psi_f\rangle]/\sin\theta, a coherent Rabi oscillation between ∣ψi⟩|\psi_i\rangle and the part of ∣ψf⟩|\psi_f\rangle orthogonal to it. For an oscillator, HoptH_{\mathrm{opt}} is an infinite series of multiphoton terms, so we use the brachistochrone as a reference path.

We apply the brachistochrone framework to the square finite-energy GKP logical states [18] [51, 52]

∣μL⟩∝e−Δ2n^∑m,l∈Zm≡μ (mod 2)e−iπml/2D^(mα+lβ)∣0⟩,(2)|\mu_L\rangle\propto e^{-\Delta^2\hat{n}}\sum_{\substack{m,l\in\mathbb{Z}\\m\equiv\mu\ (\mathrm{mod}\ 2)}}e^{-i\pi ml/2}\hat{D}(m\alpha+l\beta)|0\rangle, \tag*{(2)}

with μ∈{0,1}\mu\in\{0,1\}, α=π/2\alpha=\sqrt{\pi/2}, β=iα\beta=i\alpha, envelope width Δ=0.4\Delta=0.4, displacement operator D^(ζ)=exp⁡(ζa^†−ζ∗a^)\hat{D}(\zeta)=\exp(\zeta\hat{a}^{\dagger}-\zeta^{*}\hat{a}), photon number n^=a^†a^\hat{n}=\hat{a}^{\dagger}\hat{a}, and annihilation operator a^\hat{a}. Time-optimal preparation of ∣0L⟩|0_L\rangle from the vacuum takes T∗=0.74/ωT^{*}=0.74/\omega, whereas the flip between the nearly orthogonal logical states takes T∗=1.56/ωT^{*}=1.56/\omega.

To make Eq. (1) explicit, we write each GKP state as a superposition of unnormalized coherent states, ∣μL⟩=∑m≡μ,lcmleζmla^†∣0⟩|\mu_L\rangle=\sum_{m\equiv\mu,l}c_{ml}e^{\zeta_{ml}\hat{a}^{\dagger}}|0\rangle, with ζml=mα+lβ\zeta_{ml}=m\alpha+l\beta, ζmlΔ=e−Δ2ζml\zeta_{ml}^{\Delta} = e^{-\Delta^2}\zeta_{ml}, cmlμ=Nμe−iπml/2−∣ζml∣2/2c_{ml}^{\mu}=\mathcal{N}_{\mu}e^{-i\pi ml/2-|\zeta_{ml}|^2/2}, and Nμ\mathcal{N}_{\mu} the normalization constant fixed by ⟨μL∣μL⟩=1\langle\mu_L|\mu_L\rangle=1 (SI Sec. I.2). Inserting these states into Eq. (1) and writing the vacuum projector in normal order, ∣0⟩⟨0∣=∑r≥0(−1)ra^†ra^r/r!|0\rangle\langle0|=\sum_{r\geq0}(-1)^r\hat{a}^{\dagger r}\hat{a}^{r}/r!, gives the brachistochrone Hamiltonians of preparation and of the logical flip in explicit normal-ordered form (SI Secs. I.3 and I.4),

H0→μL=iωsin⁡θμ∑m≡μ,lcmlμ∑n≥1,r≥0(−1)rn! r!(ζmlΔ)na^†n+ra^r+h.c.,(3)H_{0\to\mu_L}=\frac{i\omega}{\sin\theta_{\mu}}\sum_{m\equiv\mu,l}c_{ml}^{\mu}\sum_{\substack{n\geq1,r\geq0}}\frac{(-1)^r}{n!\,r!}\left(\zeta_{ml}^{\Delta}\right)^n\hat{a}^{\dagger n+r}\hat{a}^{r}+\mathrm{h.c.}, \tag*{(3)}
H0L→1L=iωsin⁡θL∑m′≡0,l′m≡0,lcm′l′1cml0∗∑n,n′,r≥0(−1)rn! n′! r!(ζm′l′Δ)n(ζmlΔ∗)n′a^†n+ra^n′+r+h.c.,(4)H_{0_L\to1_L}=\frac{i\omega}{\sin\theta_L}\sum_{\substack{m'\equiv0,l'\\m\equiv0,l}}c_{m'l'}^{1}c_{ml}^{0*}\sum_{\substack{n,n',r\geq0}}\frac{(-1)^r}{n!\,n'!\,r!}\left(\zeta_{m'l'}^{\Delta}\right)^n\left(\zeta_{ml}^{\Delta*}\right)^{n'}\hat{a}^{\dagger n+r}\hat{a}^{n'+r}+\mathrm{h.c.}, \tag*{(4)}

with cos⁡θμ=⟨0∣μL⟩\cos\theta_{\mu}=\langle0|\mu_L\rangle and cos⁡θL=⟨0L∣1L⟩\cos\theta_L=\langle0_L|1_L\rangle. Their lowest terms are squeezers, and the higher terms of Eq. (3a) are multiphoton drives confined to the vacuum. Because the vacuum and both logical states contain only even photon numbers, both Hamiltonians conserve photon-number parity. Each has rank two, whereas every nonzero polynomial in a^\hat{a} and a^†\hat{a}^{\dagger} has infinite rank, so no finite truncation reproduces it (SI Secs. I.1 and I.5). The flip Hamiltonian equals ωYL\omega Y_L, with YLY_L the logical Pauli YY in the orthonormalized code basis. It rotates every encoded state about the logical YY axis within the code space, carries ∣0L⟩|0_L\rangle to ∣1L⟩|1_L\rangle and ∣1L⟩|1_L\rangle to −∣0L⟩-|0_L\rangle (fidelity 0.9992) at T∗T^{*}, and couples only Fock states whose photon numbers differ by 2, 6, 10, … (SI Sec. I.4). Remarkably, this construction applies to any target written as a superposition of coherent states.

Figures 1(a) and 1(b) show all paths on the same sphere of real states, spanned by ∣0⟩|0\rangle, ∣0L⟩|0_L\rangle, and ∣1L⟩|1_L\rangle. Both brachistochrones are great-circle arcs (solid lines). During preparation, the grid grows out of the vacuum as the target fidelity FTF_T rises from 0.54 to 1 [Figure 1(c)]. During the flip, the state crosses the equator of the logical Bloch sphere at t=T∗/2t=T^{*}/2, where it equals ∣+L⟩∝∣0L⟩+∣1L⟩|+_L\rangle\propto|0_L\rangle+|1_L\rangle [Figure 1(d)].

References

  1. [1]J. Anandan and Y. Aharonov, Geometry of quantum evolution, Phys. Rev. Lett. 65, 1697 (1990).pubmed.ncbi.nlm.nih.gov/10042340
  2. [2]A. Carlini, A. Hosoya, T. Koike, and Y. Okudaira, Time-optimal quantum evolution, Phys. Rev. Lett. 96, 060503 (2006).pubmed.ncbi.nlm.nih.gov/16605975
  3. [3]D. Gottesman, A. Kitaev, and J. Preskill, Encoding a qubit in an oscillator, Phys. Rev. A 64, 012310 (2001).DOI
  4. [4]A. L. Grimsmo and S. Puri, Quantum error correction with the Gottesman–Kitaev–Preskill code, PRX Quantum 2, 020101 (2021).DOI
  5. [5]C. Weedbrook, S. Pirandola, R. García-Patrón, N. J. Cerf, T. C. Ralph, J. H. Shapiro, and S. Lloyd, Gaussian quantum information, Rev. Mod. Phys. 84, 621 (2012).DOI
  6. [6]I. Tzitrin, J. E. Bourassa, N. C. Menicucci, and K. K. Sabapathy, Progress towards practical qubit computation using approximate Gottesman–Kitaev–Preskill codes, Phys. Rev. A 101, 032315 (2020).
  7. [7]B. Royer, S. Singh, and S. M. Girvin, Stabilization of finite-energy Gottesman–Kitaev–Preskill states, Phys. Rev. Lett. 125, 260509 (2020).DOI
  8. [8]S. Ashhab, F. Fischer, D. Lonigro, D. Braak, and D. Burgarth, Finite-dimensional approximations of generalized squeezing, Phys. Rev. A 113, 013703 (2026), arXiv:2508.09041 [quant-ph].DOI
  9. [9]E. M. Stein and R. Shakarchi, Fourier Analysis: An Introduction (Princeton University Press, Princeton, NJ, 2003).
  10. [10]F. G. Mehler, Ueber die Entwicklung einer Function von beliebig vielen Variablen nach Laplaceschen Functionen höherer Ordnung, J. Reine Angew. Math. 66, 161 (1866).DOI
  11. [11]N. Gorgichuk, M. Ayyash, M. Mariantoni, and S. Ashhab, Fast bosonic control via multiphoton qubit-oscillator interactions, Quantum 10, 2224 (2026), arXiv:2510.27035 [quant-ph].DOI
  12. [12]M. Born and E. Wolf, Principles of Optics, 7th ed. (Cambridge University Press, Cambridge, 1999).DOI
  13. [13]J. Bernoulli, Curvatura radii in diaphanis non uniformibus, solutioque problematis a se in Actis 1696, p. 269, propositi, de inveniendis linea brachystochrona, id est, in qua grave a dato puncto ad datum punctum brevissimo tempore decurrit, & de curva synchona seu radiorum unda construenda, Acta Eruditorum, 206 (1697).
  14. [14]M. R. Bridson and A. Haefliger, Metric Spaces of Non-Positive Curvature, Grundlehren der mathematischen Wis- senschaften, Vol. 319 (Springer, Berlin, 1999).DOI
  15. [15]L. M. Brekhovskikh, Waves in Layered Media (Academic Press, New York, 1960).
  16. [16]R. H. Byrd, P. Lu, J. Nocedal, and C. Zhu, A limited memory algorithm for bound constrained optimization, SIAM J. Sci. Comput. 16, 1190 (1995).
  17. [17]R. Bellman, Dynamic Programming (Princeton University Press, Princeton, NJ, 1957).
  18. [18]I. M. Gelfand and S. V. Fomin, Calculus of Variations (Prentice-Hall, Englewood Cliffs, NJ, 1963).
  19. [19]G. Lindblad, On the generators of quantum dynamical semigroups, Commun. Math. Phys. 48, 119 (1976).DOI
  20. [20]V. V. Sivak, A. Eickbusch, B. Royer, S. Singh, I. Tsitsios, S. Ganjam, A. Miano, B. L. Brock, A. Z. Ding, L. Frunzio, S. M. Girvin, R. J. Schoelkopf, and M. H. Devoret, Real-time quantum error correction beyond break-even, Nature 616, 50 (2023).DOI
  21. [21]N. F. Del Grosso, R. G. Cortiñas, P. I. Villar, F. C. Lombardo, and J. P. Paz, Controlled-squeeze gate in superconducting quantum circuits, Phys. Rev. A 111, 042606 (2025).arxiv.org/abs/2408.08404
  22. [22]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).
  23. [23]P. Campagne-Ibarcq, A. Eickbusch, S. Touzard, E. Zalys-Geller, N. E. Frattini, V. V. Sivak, P. Reinhold, S. Puri, S. Shankar, R. J. Schoelkopf, L. Frunzio, M. Mirrahimi, and M. H. Devoret, Quantum error correction of a qubit en- coded in grid states of an oscillator, Nature 584, 368 (2020).
  24. [24]L.-A. Sellem, A. Sarlette, Z. Leghtas, M. Mirrahimi, P. Rouchon, and P. Campagne-Ibarcq, Dissipative protection of a GKP qubit in a high-impedance superconducting circuit driven by a microwave frequency comb, Phys. Rev. X 15, 011011 (2025).
  25. [25]I. Rojkov, P. M. Röggla, M. Wagener, M. Fontboté-Schmidt, S. Welte, J. Home, and F. Reiter, Two-qubit operations for finite-energy Gottesman–Kitaev–Preskill encodings, Phys. Rev. Lett. 133, 100601 (2024).DOI
  26. [26]R. W. Heeres, P. Reinhold, N. Ofek, L. Frunzio, M. Jiang, M. H. Devoret, and R. J. Schoelkopf, Implementing a universal gate set on a logical qubit encoded in an oscillator, Nat. Commun. 8, 94 (2017).
  27. [27]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, Nat. Phys. 21, 1664 (2025).arxiv.org/abs/2409.05455
  28. [28]M. A. Nielsen, A simple formula for the average gate fidelity of a quantum dynamical operation, Phys. Lett. A 303, 249 (2002).DOI
  29. [29]M. H. Shaw, A. C. Doherty, and A. L. Grimsmo, Stabilizer subsystem decompositions for single- and multimode Gottesman–Kitaev–Preskill codes, PRX Quantum 5, 010331 (2024).DOI
  30. [30]G. Pantaleoni, B. Q. Baragiola, and N. C. Menicucci, Modular bosonic subsystem codes, Phys. Rev. Lett. 125, 040501 (2020).
  31. [31]P. Brooks, A. Kitaev, and J. Preskill, Protected gates for superconducting qubits, Phys. Rev. A 87, 052306 (2013).DOI
  32. [32]N. Khaneja, R. Brockett, and S. J. Glaser, Time optimal control in spin systems, Phys. Rev. A 63, 032308 (2001).DOI
  33. [33]C. Arenz, B. Russell, D. Burgarth, and H. Rabitz, The roles of drift and control field constraints upon quantum control speed limits, New J. Phys. 19, 103015 (2017).DOI
  34. [34]A. A. Agrachev and Y. L. Sachkov, Control Theory from the Geometric Viewpoint, Encyclopaedia of Mathematical Sciences, Vol. 87 (Springer, Berlin, 2004).DOI
  35. [35]N. Khaneja, T. Reiss, C. Kehlet, T. Schulte-Herbrüggen, and S. J. Glaser, Optimal control of coupled spin dynamics: design of NMR pulse sequences by gradient ascent algorithms, J. Magn. Reson. 172, 296 (2005).pubmed.ncbi.nlm.nih.gov/15649756
  36. [36]P. de Fouquieres, S. G. Schirmer, S. J. Glaser, and I. Kuprov, Second order gradient ascent pulse engineering, J. Magn. Reson. 212, 412 (2011).DOI
  37. [37]A. Eickbusch, V. Sivak, A. Z. Ding, S. S. Elder, S. R. Jha, J. Venkatraman, B. Royer, S. M. Girvin, R. J. Schoelkopf, and M. H. Devoret, Fast universal control of an oscillator with weak dispersive coupling to a qubit, Nat. Phys. 18, 1464 (2022).DOI
  38. [38]D. Lachance-Quirion, M.-A. Lemond, J. O. Simoneau, L. St-Jean, P. Lemieux, S. Turcotte, W. Wright, A. Lacroix, J. Fréchette-Viens, R. Shillito, F. Hopfmueller, M. Tremblay, N. E. Frattini, J. Camirand Lemyre, and P. St-Jean, Autonomous quantum error correction of Gottesman–Kitaev–Preskill states, Phys. Rev. Lett. 132, 150607 (2024).
  39. [39]B. de Neeve, T.-L. Nguyen, T. Behrle, and J. P. Home, Error correction of a logical grid state qubit by dissipative pumping, Nat. Phys. 18, 296 (2022).arxiv.org/abs/2010.09681
  40. [40]L. Sun, A. Petrenko, Z. Leghtas, B. Vlastakis, G. Kirchmair, K. M. Sliwa, A. Narla, M. Hatridge, S. Shankar, J. Blumoff, L. Frunzio, M. Mirrahimi, M. H. Devoret, and R. J. Schoelkopf, Tracking photon jumps with repeated quantum nondemolition parity measurements, Nature 511, 444 (2014).DOI
  41. [41]O. Vy, X. Wang, and K. Jacobs, Error-transparent evolution: the ability of multi-body interactions to bypass decoherence, New J. Phys. 15, 053002 (2013).DOI
  42. [42]E. Kapit, Error-transparent quantum gates for small logical qubit architectures, Phys. Rev. Lett. 120, 050503 (2018).DOI
  43. [43]Y. Ma, Y. Xu, X. Mu, W. Cai, L. Hu, W. Wang, X. Pan, H. Wang, Y. P. Song, C.-L. Zou, and L. Sun, Error-transparent operations on a logical qubit protected by quantum error correction, Nat. Phys. 16, 827 (2020).DOI
  44. [44]W.-L. Ma, M. Zhang, Y. Wong, K. Noh, S. Rosenblum, P. Reinhold, R. J. Schoelkopf, and L. Jiang, Path-independent quantum gates with noisy ancilla, Phys. Rev. Lett. 125, 110503 (2020).DOI
  45. [45]Y. Wu, S. Kolkowitz, S. Puri, and J. D. Thompson, Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays, Nat. Commun. 13, 4657 (2022).DOI
  46. [46]A. Kubica, A. Haim, Y. Vaknin, H. Levine, F. Brändao, and A. Retzker, Erasure qubits: Overcoming the T1 limit in superconducting circuits, Phys. Rev. X 13, 041022 (2023).DOI
  47. [47]J. D. Teoh, P. Winkel, H. K. Babla, B. J. Chapman, J. Claes, S. J. de Graaf, J. W. O. Garmon, W. D. Kalfus, Y. Lu, A. Maiti, K. Sahay, N. Thakur, T. Tsunoda, S. H. Xue, L. Frunzio, S. M. Girvin, S. Puri, and R. J. Schoelkopf, Dual-rail encoding with superconducting cavities, Proc. Natl. Acad. Sci. U.S.A. 120, e2221736120 (2023).DOI
  48. [48]R. W. Heeres, B. Vlastakis, E. Holland, S. Krastanov, V. V. Albert, L. Frunzio, L. Jiang, and R. J. Schoelkopf, Cavity state manipulation using photon-number selective phase gates, Phys. Rev. Lett. 115, 137002 (2015).
  49. [49]A. Carlini, A. Hosoya, T. Koike, and Y. Okudaira, Time-optimal unitary operations, Phys. Rev. A 75, 042308 (2007).DOI
  50. [50]L. Mandelstam and I. Tamm, The uncertainty relation between energy and time in non-relativistic quantum mechanics, J. Phys. (USSR) 9, 249 (1945).

Paper details

vlnc:W_u66dp8pn
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 7

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents