Ideal square and hexagonal GKP infidelity bounds
OpenQAlgorithms.Papers.Independent.Intakenext100.P65.idealGkp_infidelityLet . Apply quantum-limited amplification of gain after pure loss, followed by perfect nearest-lattice modular-displacement correction. Use the square normalizer lattice with step , or the triangular normalizer lattice with basis ; 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 constructs a CPTP qubit channel . Nearest points exist and the four coset probabilities sum to one. Its squared maximally entangled overlap obeys
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.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P65
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real with , define and , and let be the classically selected nearest label for shape , with unspecified tie resolution. Put , let be the coordinatewise parity of , and let be the real conversion of the measure of under complex-plane volume weighted by . With , , define , where . For every shape , the theorem asserts that for every and , that belongs to for every , that , and that is a channel, meaning it admits a finite Kraus representation whose Kraus matrices satisfy . Moreover, writing , where , , and applies to each block indexed by the first register, it asserts the strict bounds
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.