Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corrected parameterized main theorem

Open
QAlgorithms.Papers.Independent.Intakenext100.P70.mainTheorem

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

prove2quantum

Let n≥1n\geq1n≥1 be an integer, 0<κ<1/20<\kappa<1/20<κ<1/2, and

(1+κn)−1/n≤p<1.(1+\kappa^n)^{-1/n}\leq p<1.(1+κn)−1/n≤p<1.

There exist positive integers N,r,mN,r,mN,r,m, an integer d≥2d\geq2d≥2, and a weight 0<q≤1/20<q\leq1/20<q≤1/2 with the following properties. Let a,b,S,Fa,b,S,Fa,b,S,F be qubits, let every Ai,j,kA_{i,j,k}Ai,j,k​ and Bi,j,kB_{i,j,k}Bi,j,k​ have dimension ddd, and group the shield into NNN shares with rmrmrm factors per share. Define Γ:aA→bB\Gamma:aA\to bBΓ:aA→bB from the normalized Choi state in (S18), and define the retained, measured switch channel

M=P0⊗(Eκ∘Γ)+P1⊗Ep.\mathcal M=\mathcal P_0\otimes(\mathcal E_\kappa\circ\Gamma)+\mathcal P_1\otimes\mathcal E_p.M=P0​⊗(Eκ​∘Γ)+P1​⊗Ep​.

Here Eu\mathcal E_uEu​ erases the entire main register with probability uuu, replacing it by its maximally mixed state and outputting a separate binary flag. The parameters satisfy (S19), Γ\GammaΓ is PPT-binding, and M\mathcal MM is completely positive and trace preserving. With the all-density-input optimization and bit-valued rates defined above,

Q(n)(M)=0,Q(N+1)(M)>0,Q(M)>0.Q^{(n)}(\mathcal M)=0,\qquad Q^{(N+1)}(\mathcal M)>0,\qquad Q(\mathcal M)>0.Q(n)(M)=0,Q(N+1)(M)>0,Q(M)>0.

This gives the constructive family behind the undetectability result.

Source correction. The printed endpoint p=1p=1p=1 is excluded, as required by the intersection of parameter ranges in the source's proof.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P70
Formal statement
namespace QAlgorithms.Papers.Independent.Intakenext100.P70

noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P22
  (Op coherentInformation singleUseInformation quantumCapacity mixed)

/-- Methods Theorem, PDF p.3; repeated Supplementary Theorem, p.11.
SOURCE CORRECTION: the printed interval ends at p=1; here p<1, precisely the
intersection of Lemmas 3 and 4 used in its proof. At p=1 every branch is PPT-binding,
so the printed positive-capacity endpoint is false. Gamma is computed from S18. -/
theorem mainTheorem (n : ℕ) (hn : 0 < n) (kappa p : ℝ)
    (hk0 : 0 < kappa) (hk1 : kappa < 1 / 2)
    (hp0 : cubittErasureThreshold n kappa ≤ p) (hp1 : p < 1) :
    ∃ P : CubittParameters, CubittValid P ∧ CubittPPTCondition P ∧ CubittPPTBinding (cubittGammaChannel P) ∧
      IsChannel (cubittPaperChannel P kappa p) ∧
      cubittBlockInformation (cubittPaperChannel P kappa p) n = 0 ∧
      0 < cubittBlockInformation (cubittPaperChannel P kappa p) (P.N + 1) ∧
      0 < quantumCapacity (cubittPaperChannel P kappa p) := by sorry

end

end QAlgorithms.Papers.Independent.Intakenext100.P70
Source
Unbounded number of channel uses are required to see quantum capacity, arXiv:1408.5115v1, PDF p. 11, Supplementary Theorem; repeated Methods Theorem, p.3
Read-back

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

For every natural number n>0n>0n>0 and real numbers κ,p\kappa,pκ,p satisfying

0<κ<12,(1+κn)−1/n≤p<1,0<\kappa<\frac12,\qquad (1+\kappa^n)^{-1/n}\le p<1,0<κ<21​,(1+κn)−1/n≤p<1,

there exists a record P=(N,r,m,d,q)P=(N,r,m,d,q)P=(N,r,m,d,q) with natural numbers N,r,m,dN,r,m,dN,r,m,d and real qqq such that

N,r,m>0,d≥2,0<q≤12,0<q≤13,(dd−1)rN≤1−qq.N,r,m>0,\quad d\ge2,\quad 0<q\le\frac12,\quad 0<q\le\frac13,\quad \left(\frac d{d-1}\right)^{rN}\le\frac{1-q}{q}.N,r,m>0,d≥2,0<q≤21​,0<q≤31​,(d−1d​)rN≤q1−q​.

To specify the maps appearing in the conclusion, put S=(Fin N→Fin r→Fin m→Fin d)S=(\mathrm{Fin}\,N\to\mathrm{Fin}\,r\to\mathrm{Fin}\,m\to\mathrm{Fin}\,d)S=(FinN→Finr→Finm→Find), A=Bool×SA=\mathrm{Bool}\times SA=Bool×S, and D=∣A∣D=|A|D=∣A∣. For z,w∈(Fin d)2z,w\in(\mathrm{Fin}\,d)^2z,w∈(Find)2, set

Dz,w±=1z=w±1z1=w2, z2=w1d(d±1).D^\pm_{z,w}= \frac{\mathbf1_{z=w}\pm\mathbf1_{z_1=w_2,\ z_2=w_1}}{d(d\pm1)}.Dz,w±​=d(d±1)1z=w​±1z1​=w2​, z2​=w1​​​.

For u,v∈S2u,v\in S^2u,v∈S2, let Ωk(u,v)\Omega_k(u,v)Ωk​(u,v) be the product over i<N,j<ri<N,j<ri<N,j<r of the entries of (D++D−)/2(D^++D^-)/2(D++D−)/2 at the row (u1(i,j,k),u2(i,j,k))(u_1(i,j,k),u_2(i,j,k))(u1​(i,j,k),u2​(i,j,k)) and column (v1(i,j,k),v2(i,j,k))(v_1(i,j,k),v_2(i,j,k))(v1​(i,j,k),v2​(i,j,k)), and let Σk(u,v)\Sigma_k(u,v)Σk​(u,v) be the corresponding product of entries of D+D^+D+. Define a matrix ζ\zetaζ on A×AA\times AA×A by taking its entry at row ((α,u1),(β,u2))((\alpha,u_1),(\beta,u_2))((α,u1​),(β,u2​)) and column ((α′,v1),(β′,v2))((\alpha',v_1),(\beta',v_2))((α′,v1​),(β′,v2​)) to be 1/[2(qm+(12−q)m)]1/[2(q^m+(\frac12-q)^m)]1/[2(qm+(21​−q)m)] times

{∏k<mq2(Ωk+Σk),α=β, α′=β′, α=α′,∏k<mq2(Ωk−Σk),α=β, α′=β′, α≠α′,∏k<m(12−q)Σk,α≠β, α=α′, β=β′,0,otherwise.\begin{cases} \displaystyle\prod_{k<m}\frac q2(\Omega_k+\Sigma_k), &\alpha=\beta,\ \alpha'=\beta',\ \alpha=\alpha',\\ \displaystyle\prod_{k<m}\frac q2(\Omega_k-\Sigma_k), &\alpha=\beta,\ \alpha'=\beta',\ \alpha\ne\alpha',\\ \displaystyle\prod_{k<m}\left(\frac12-q\right)\Sigma_k, &\alpha\ne\beta,\ \alpha=\alpha',\ \beta=\beta',\\ 0,&\text{otherwise}. \end{cases}⎩⎨⎧​k<m∏​2q​(Ωk​+Σk​),k<m∏​2q​(Ωk​−Σk​),k<m∏​(21​−q)Σk​,0,​α=β, α′=β′, α=α′,α=β, α′=β′, α=α′,α=β, α=α′, β=β′,otherwise.​

Set

Γ(X)b,c=D∑a,a′∈AXa,a′ζ(a,b),(a′,c).\Gamma(X)_{b,c}=D\sum_{a,a'\in A}X_{a,a'}\zeta_{(a,b),(a',c)}.Γ(X)b,c​=Da,a′∈A∑​Xa,a′​ζ(a,b),(a′,c)​.

For a real uuu, define the whole-erasure map on matrices over AAA by

Eu(X)(α,b),(β,c)={u tr⁡(X) δb,c/D,α=β=true,(1−u)Xb,c,α=β=false,0,α≠β.\mathcal E_u(X)_{(\alpha,b),(\beta,c)} =\begin{cases} u\,\operatorname{tr}(X)\,\delta_{b,c}/D,&\alpha=\beta=\mathrm{true},\\ (1-u)X_{b,c},&\alpha=\beta=\mathrm{false},\\ 0,&\alpha\ne\beta. \end{cases}Eu​(X)(α,b),(β,c)​=⎩⎨⎧​utr(X)δb,c​/D,(1−u)Xb,c​,0,​α=β=true,α=β=false,α=β.​

The paper map Ψ\PsiΨ, from matrices over Bool×A\mathrm{Bool}\times ABool×A to matrices over Bool×(Bool×A)\mathrm{Bool}\times(\mathrm{Bool}\times A)Bool×(Bool×A), discards off-diagonal switch blocks and applies Ep\mathcal E_pEp​ to the true switch block and Eκ∘Γ\mathcal E_\kappa\circ\GammaEκ​∘Γ to the false switch block, retaining the switch value. The conclusions are that both Γ\GammaΓ and Ψ\PsiΨ have finite Kraus representations with ∑jEj†Ej=I\sum_jE_j^\dagger E_j=I∑j​Ej†​Ej​=I, that the output partial transpose of the normalized Choi matrix of Γ\GammaΓ is positive semidefinite, and that

Bn(Ψ)=0,BN+1(Ψ)>0,Q(Ψ)>0.B_n(\Psi)=0,\qquad B_{N+1}(\Psi)>0,\qquad Q(\Psi)>0.Bn​(Ψ)=0,BN+1​(Ψ)>0,Q(Ψ)>0.

Explicitly, the normalized Choi matrix is C(a,b),(a′,c)=Γ(∣a⟩⟨a′∣)b,c/DC_{(a,b),(a',c)}=\Gamma(|a\rangle\langle a'|)_{b,c}/DC(a,b),(a′,c)​=Γ(∣a⟩⟨a′∣)b,c​/D, and its output partial transpose has entries C(a,c),(a′,b)C_{(a,c),(a',b)}C(a,c),(a′,b)​. For any finite-dimensional channel Θ\ThetaΘ,

Bℓ(Θ)=1ℓsup⁡ρ⪰0, tr⁡ρ=1[S(Θ⊗ℓ(ρ))−S((id⊗Θ⊗ℓ)(∣vρ⟩⟨vρ∣))],Q(Θ)=sup⁡ℓ>0Bℓ(Θ).B_\ell(\Theta)=\frac1\ell\sup_{\rho\succeq0,\ \operatorname{tr}\rho=1} \left[S(\Theta^{\otimes\ell}(\rho)) -S((\mathrm{id}\otimes\Theta^{\otimes\ell})(|v_\rho\rangle\langle v_\rho|))\right], \qquad Q(\Theta)=\sup_{\ell>0}B_\ell(\Theta).Bℓ​(Θ)=ℓ1​ρ⪰0, trρ=1sup​[S(Θ⊗ℓ(ρ))−S((id⊗Θ⊗ℓ)(∣vρ​⟩⟨vρ​∣))],Q(Θ)=ℓ>0sup​Bℓ​(Θ).

Here vρ(i,j)=(ρ)j,iv_\rho(i,j)=(\sqrt\rho)_{j,i}vρ​(i,j)=(ρ​)j,i​, the identity extension applies the map to each block with fixed reference indices, and the tensor map sends XXX to the matrix with entries ∑x,x′Xx,x′∏i<ℓΘ(∣xi⟩⟨xi′∣)yi,yi′\sum_{x,x'}X_{x,x'}\prod_{i<\ell}\Theta(|x_i\rangle\langle x_i'|)_{y_i,y_i'}∑x,x′​Xx,x′​∏i<ℓ​Θ(∣xi​⟩⟨xi′​∣)yi​,yi′​​. Entropy is S(Z)=−Re⁡tr⁡f(Z)S(Z)=-\operatorname{Re}\operatorname{tr}f(Z)S(Z)=−Retrf(Z), where f(u)=ulog⁡2uf(u)=u\log_2uf(u)=ulog2​u is applied by continuous functional calculus.

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