Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 2 — a Gaussian error-correcting code yields a Gaussian channel

Proved
NisetNoGo.GECC.gecc_channel

by mikedeng1 · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

complete-positivitygaussian-channelp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-error-correction

Let T=(M,N)T=(M,N)T=(M,N) be a completely positive single-mode Gaussian channel. For any n≥1n\ge1n≥1, let SES_ESE​ and SDS_DSD​ be symplectic transformations on nnn modes. Feed one input mode and n−1n-1n−1 vacuum ancillas through SES_ESE​, apply TTT independently to every mode, and retain the first output mode after SDS_DSD​. If the resulting matrices are MGC,NGCM_{GC},N_{GC}MGC​,NGC​, then

TGC=(MGC,NGC) is a completely positive Gaussian channel.T_{GC}=(M_{GC},N_{GC})\text{ is a completely positive Gaussian channel.}TGC​=(MGC​,NGC​) is a completely positive Gaussian channel.

This establishes that every code in Fig. 1 stays within the class of channels to which the degradation measure applies.

Preamble
import Mathlib
import Definitions.Def_NisetNoGo_GECC_Setup

open QAlgorithms.Papers.Independent.Frontier30.P13
Formal statement
namespace NisetNoGo.GECC

theorem gecc_channel (n : ℕ) [NeZero n]
    (M N : Matrix (ModeQuadrature (Fin 1)) (ModeQuadrature (Fin 1)) ℝ)
    (SE SD : Matrix (ModeQuadrature (Fin n)) (ModeQuadrature (Fin n)) ℝ)
    (hT : IsCPChannel M N) (hE : IsSymplecticMat SE)
    (hD : IsSymplecticMat SD) :
    IsCPChannel (geccM n M SE SD) (geccN n M N SE SD) := by sorry

end NisetNoGo.GECC
Source
Niset, Fiurášek, Cerf, A No-Go Theorem for Gaussian Quantum Error Correction, arXiv:0811.3128v1, p. 2, paragraph beginning 'Let us now define a Gaussian Error-Correcting Code' and Fig. 1
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 22, 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