Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Ideal square and hexagonal GKP infidelity bounds

Open
QAlgorithms.Papers.Independent.Intakenext100.P65.idealGkp_infidelity

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let 0<γ<10<\gamma<10<γ<1. Apply quantum-limited amplification of gain 1/(1−γ)1/(1-\gamma)1/(1−γ) after pure loss, followed by perfect nearest-lattice modular-displacement correction. Use the square normalizer lattice with step π/2\sqrt{\pi/2}π/2​, or the triangular normalizer lattice with basis π/3(1,eiπ/3)\sqrt{\pi/\sqrt3}(1,e^{i\pi/3})π/3​​(1,eiπ/3); in each case the stabilizer lattice is twice this lattice. A nearest lattice point gives the measured residual syndrome and its two integer coordinates modulo two give the logical Pauli. Fix a tie rule independently of the logical input. Integrating these four cosets against pγ(α)=(1−γ)(πγ)−1e−(1−γ)∣α∣2/γp_\gamma(\alpha)=(1-\gamma)(\pi\gamma)^{-1}e^{-(1-\gamma)|\alpha|^2/\gamma}pγ​(α)=(1−γ)(πγ)−1e−(1−γ)∣α∣2/γ constructs a CPTP qubit channel EL\mathcal E_LEL​. Nearest points exist and the four coset probabilities sum to one. Its squared maximally entangled overlap obeys

1−FE(Esquare)<e−π(1−γ)/(8γ),1−FE(Ehex)<e−π(1−γ)/(43γ).1-F_E(\mathcal E_{\rm square})<e^{-\pi(1-\gamma)/(8\gamma)},\qquad 1-F_E(\mathcal E_{\rm hex})<e^{-\pi(1-\gamma)/(4\sqrt3\gamma)}.1−FE​(Esquare​)<e−π(1−γ)/(8γ),1−FE​(Ehex​)<e−π(1−γ)/(43​γ).

These are bounds for an ideal logical recovery. They also lower-bound an ideal optimal recovery's fidelity, but assert no physical finite-energy encoder approximation or matching asymptotic lower bound.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P65
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P65

open MeasureTheory Filter

open QAlgorithms.Papers.Independent.Frontier18.P14 (displacementEntry)

open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)

open scoped ComplexConjugate Matrix Topology

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

/-- PDF p.6 (2.2), pp.20--21 (7.22)--(7.24): ideal recovered logical fidelity,
with both square (c=2) and hexagonal (c=sqrt(3)) constants. The channel is constructed
before any logical input through a fixed nearest-lattice syndrome decoder. This is
not finite-energy physical achievability and does not claim a matching lower asymptotic. -/
theorem idealGkp_infidelity (g : ℝ) (hg0 : 0 < g) (hg1 : g < 1) :
    (∀ shape : LatticeShape,
      (∀ z : ℂ, ∀ m : ℤ × ℤ,
        ‖modularSyndrome shape z‖ ≤ ‖z - gkpNormalizerPoint shape m‖) ∧
      (∀ z : ℂ, modularSyndrome shape z ∈ correctableCell shape) ∧
      (∑ c : Fin 2 × Fin 2, cosetProbability shape g c) = 1 ∧
      IsChannel (idealRecoveredChannel shape g)) ∧
    1 - QuditFidelity.entanglementFidelity 2 (by decide) (idealRecoveredChannel .square g) <
      Real.exp (-Real.pi * (1 - g) / (8 * g)) ∧
    1 - QuditFidelity.entanglementFidelity 2 (by decide) (idealRecoveredChannel .hexagonal g) <
      Real.exp (-Real.pi * (1 - g) / (4 * Real.sqrt 3 * g)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P65

end
Source
Performance and structure of single-mode bosonic codes, arXiv:1708.05010v3, PDF p. 20, §II B (2.2), §VII B (7.22)–(7.24): ideal GKP entanglement-infidelity bound
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every real ggg with 0<g<10<g<10<g<1, define Lsquare(a,b)=π/2(a+ib)L_{\mathrm{square}}(a,b)=\sqrt{\pi/2}(a+ib)Lsquare​(a,b)=π/2​(a+ib) and Lhexagonal(a,b)=π/3(a+b(1/2+i3/2))L_{\mathrm{hexagonal}}(a,b)=\sqrt{\pi/\sqrt3}\bigl(a+b(1/2+i\sqrt3/2)\bigr)Lhexagonal​(a,b)=π/3​​(a+b(1/2+i3​/2)), and let ns(z)∈Z2n_s(z)\in\mathbb Z^2ns​(z)∈Z2 be the classically selected nearest label for shape sss, with unspecified tie resolution. Put rs(z)=z−Ls(ns(z))r_s(z)=z-L_s(n_s(z))rs​(z)=z−Ls​(ns​(z)), let Cs(z)∈{0,1}2C_s(z)\in\{0,1\}^2Cs​(z)∈{0,1}2 be the coordinatewise parity of ns(z)n_s(z)ns​(z), and let ps,cp_{s,c}ps,c​ be the real conversion of the measure of {z:Cs(z)=c}\{z:C_s(z)=c\}{z:Cs​(z)=c} under complex-plane volume weighted by dg(z)=1−gπgexp⁡(−1−gg∣z∣2)d_g(z)=\frac{1-g}{\pi g}\exp(-\frac{1-g}{g}|z|^2)dg​(z)=πg1−g​exp(−g1−g​∣z∣2). With X=(0110)X=\begin{pmatrix}0&1\\1&0\end{pmatrix}X=(01​10​), Z=diag⁡(1,−1)Z=\operatorname{diag}(1,-1)Z=diag(1,−1), define Φs,g(ρ)=∑a,bKa,bρKa,b†\Phi_{s,g}(\rho)=\sum_{a,b}K_{a,b}\rho K_{a,b}^{\dagger}Φs,g​(ρ)=∑a,b​Ka,b​ρKa,b†​, where Ka,b=ps,(a,b)XaZbK_{a,b}=\sqrt{p_{s,(a,b)}}X^aZ^bKa,b​=ps,(a,b)​​XaZb. For every shape sss, the theorem asserts that ∣rs(z)∣≤∣z−Ls(m)∣|r_s(z)|\le|z-L_s(m)|∣rs​(z)∣≤∣z−Ls​(m)∣ for every z∈Cz\in\mathbb Cz∈C and m∈Z2m\in\mathbb Z^2m∈Z2, that rs(z)r_s(z)rs​(z) belongs to {w:∣w∣≤∣w−Ls(m)∣ for every m∈Z2}\{w:|w|\le|w-L_s(m)|\text{ for every }m\in\mathbb Z^2\}{w:∣w∣≤∣w−Ls​(m)∣ for every m∈Z2} for every zzz, that ∑cps,c=1\sum_c p_{s,c}=1∑c​ps,c​=1, and that Φs,g\Phi_{s,g}Φs,g​ is a channel, meaning it admits a finite Kraus representation whose Kraus matrices satisfy ∑jAj†Aj=I\sum_j A_j^\dagger A_j=I∑j​Aj†​Aj​=I. Moreover, writing Fe(Φ)=Re⁡tr⁡(Pφ(id⁡⊗Φ)(Pφ))F_e(\Phi)=\operatorname{Re}\operatorname{tr}\bigl(P_\varphi(\operatorname{id}\otimes\Phi)(P_\varphi)\bigr)Fe​(Φ)=Retr(Pφ​(id⊗Φ)(Pφ​)), where φ=(∣00⟩+∣11⟩)/2\varphi=(|00\rangle+|11\rangle)/\sqrt2φ=(∣00⟩+∣11⟩)/2​, Pφ=φφ†P_\varphi=\varphi\varphi^\daggerPφ​=φφ†, and id⁡⊗Φ\operatorname{id}\otimes\Phiid⊗Φ applies Φ\PhiΦ to each block indexed by the first register, it asserts the strict bounds

1−Fe(Φsquare,g)<exp⁡ ⁣(−π(1−g)8g),1−Fe(Φhexagonal,g)<exp⁡ ⁣(−π(1−g)43 g).1-F_e(\Phi_{\mathrm{square},g})< \exp\!\left(-\frac{\pi(1-g)}{8g}\right), \qquad 1-F_e(\Phi_{\mathrm{hexagonal},g})< \exp\!\left(-\frac{\pi(1-g)}{4\sqrt3\,g}\right).1−Fe​(Φsquare,g​)<exp(−8gπ(1−g)​),1−Fe​(Φhexagonal,g​)<exp(−43​gπ(1−g)​).
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me