Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Schmidt coding erases complementary inputs and cannot be faithful

Proved
QAlgorithms.Papers.Independent.Support50.P42.schmidt_coding

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For p∈(0,1)p\in(0,1)p∈(0,1), source Q′Q'Q′ emits 1−p∣0⟩+(−1)bp∣1⟩\sqrt{1-p}|0\rangle+(-1)^b\sqrt p|1\rangle1−p​∣0⟩+(−1)bp​∣1⟩ with uniform bit bbb. Let ∣Ψx⟩|\Psi_x\rangle∣Ψx​⟩ be its length-nnn product signal, with n>2n>2n>2 as in the section, for uniform binary label xxx, and let xˉ\bar xxˉ be its complement. The Schmidt encoder measures the weight kkk and retains both the quantum branch and the classical outcome. Then

En(∣Ψx⟩⟨Ψx∣)=En(∣Ψxˉ⟩⟨Ψxˉ∣),Fn(D)≤1+∣1−2p∣n2\mathcal E_n(|\Psi_x\rangle\langle\Psi_x|)=\mathcal E_n(|\Psi_{\bar x}\rangle\langle\Psi_{\bar x}|),\qquad F_n(\mathcal D)\le\frac{1+|1-2p|^n}{2}En​(∣Ψx​⟩⟨Ψx​∣)=En​(∣Ψxˉ​⟩⟨Ψxˉ​∣),Fn​(D)≤21+∣1−2p∣n​

for every decoder channel D\mathcal DD independent of xxx, where FnF_nFn​ is source-average squared fidelity. Bare transmission which forgets kkk without decoding has average fidelity tending to zero. The displayed bound prevents arbitrary decoders, even using kkk, from attaining asymptotically perfect fidelity.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P42
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P42

open scoped BigOperators Matrix ComplexConjugate

open MeasureTheory ProbabilityTheory

attribute [local instance] Classical.propDecidable Classical.decEq

-- Reuse the exact accepted objects, without introducing same-name aliases.

open Information100.P21 (Op Vec FiniteLOCC)

open Dependency50.P42 (dimensionedPower singlets)

open Dependency50.P48 (pureFidelity)

open Gap48.P32 (pairOfState)

open Next46.P39 (rectAct)

/-- PDF pp.13--14: complement erasure even with the classical outcome,
bare-fidelity limit zero, and a uniform bound for every decoder channel.
The decoder receives the entire classical-quantum output, never the unknown x. -/
theorem schmidt_coding (p : ℝ) (hp : 0<p) (hp1 : p<1) :
    (∀ (n : ℕ), 2<n → ∀ x : Fin n → Bool,
      flaggedEncoder n (pureDensity (sourceKet p x))=
        flaggedEncoder n (pureDensity (sourceKet p (fun i => !(x i))))) ∧
    (∀ (n : ℕ) (D : Superop (Fin (n+1) × (Fin n → Bool)) (Fin n → Bool)),
      2<n → IsChannel D → codingFidelity n p D≤(1+|1-2*p|^n)/2) ∧
    Filter.Tendsto (fun n : ℕ => ((2 : ℝ)^(n+3))⁻¹*∑ x : Fin (n+3) → Bool,
      pureFidelity (sourceKet p x) (bareEncoder (n+3) (pureDensity (sourceKet p x))))
      Filter.atTop (nhds (0 : ℝ)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P42

end
Source
Concentrating Partial Entanglement by Local Operations, arXiv:quant-ph/9511030v1, PDF p. 13, §IV: Schmidt coding erases complements and cannot be faithful
Read-back

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

For every real ppp with 0<p<10<p<10<p<1, define, for each natural number rrr and each Boolean string x∈{0,1}rx\in\{0,1\}^rx∈{0,1}r, a vector vp,x∈C{0,1}rv_{p,x}\in\mathbb C^{\{0,1\}^r}vp,x​∈C{0,1}r by

vp,x(z)=∏i=0r−1{−p,zi=1, xi=1,p,zi=1, xi=0,1−p,zi=0.v_{p,x}(z)=\prod_{i=0}^{r-1} \begin{cases} -\sqrt p,&z_i=1,\ x_i=1,\\ \sqrt p,&z_i=1,\ x_i=0,\\ \sqrt{1-p},&z_i=0. \end{cases}vp,x​(z)=i=0∏r−1​⎩⎨⎧​−p​,p​,1−p​,​zi​=1, xi​=1,zi​=1, xi​=0,zi​=0.​

Write Pv=vv†P_v=vv^\daggerPv​=vv†, let Πr,k\Pi_{r,k}Πr,k​ be the diagonal projector onto strings containing exactly kkk true bits, and define

Fr(X)(k,z),(ℓ,w)={(Πr,kXΠr,k)z,w,k=ℓ,0,k≠ℓ,Br(X)=∑k=0rΠr,kXΠr,k.F_r(X)_{(k,z),(\ell,w)} =\begin{cases}(\Pi_{r,k}X\Pi_{r,k})_{z,w},&k=\ell,\\0,&k\ne\ell,\end{cases} \qquad B_r(X)=\sum_{k=0}^{r}\Pi_{r,k}X\Pi_{r,k}.Fr​(X)(k,z),(ℓ,w)​={(Πr,k​XΠr,k​)z,w​,0,​k=ℓ,k=ℓ,​Br​(X)=k=0∑r​Πr,k​XΠr,k​.

Then three assertions hold: for every r>2r>2r>2 and every x∈{0,1}rx\in\{0,1\}^rx∈{0,1}r, Fr(Pvp,x)=Fr(Pvp,¬x)F_r(P_{v_{p,x}})=F_r(P_{v_{p,\neg x}})Fr​(Pvp,x​​)=Fr​(Pvp,¬x​​), where (¬x)i=1−xi(\neg x)_i=1-x_i(¬x)i​=1−xi​; for every natural r>2r>2r>2 and every channel DDD from matrices on {0,…,r}×{0,1}r\{0,\ldots,r\}\times\{0,1\}^r{0,…,r}×{0,1}r to matrices on {0,1}r\{0,1\}^r{0,1}r,

2−r∑x∈{0,1}rRe⁡tr⁡ ⁣(Pvp,xD(Fr(Pvp,x)))≤1+∣1−2p∣r2;2^{-r}\sum_{x\in\{0,1\}^r} \operatorname{Re}\operatorname{tr}\!\left(P_{v_{p,x}}D(F_r(P_{v_{p,x}}))\right) \le \frac{1+|1-2p|^r}{2};2−rx∈{0,1}r∑​Retr(Pvp,x​​D(Fr​(Pvp,x​​)))≤21+∣1−2p∣r​;

and

lim⁡n→∞2−(n+3)∑x∈{0,1}n+3Re⁡tr⁡ ⁣(Pvp,xBn+3(Pvp,x))=0.\lim_{n\to\infty}2^{-(n+3)} \sum_{x\in\{0,1\}^{n+3}} \operatorname{Re}\operatorname{tr}\!\left( P_{v_{p,x}}B_{n+3}(P_{v_{p,x}}) \right)=0.n→∞lim​2−(n+3)x∈{0,1}n+3∑​Retr(Pvp,x​​Bn+3​(Pvp,x​​))=0.

Here a channel means a map X↦∑jKjXKj†X\mapsto\sum_jK_jXK_j^\daggerX↦∑j​Kj​XKj†​ with a finite Kraus family satisfying ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I; the decoder bound quantifies over every such DDD.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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