Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Dephasing moments and second-order boundary

Open
QAlgorithms.Papers.Independent.Support50.P04.qubit_moments_secondOrder

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

prove2quantum

Let N:A→B\mathcal N:A\to BN:A→B be a CPTP channel on finite positive-dimensional complex Hilbert spaces with fixed orthonormal bases. Write R^(n;ε)\widehat R(n;\varepsilon)R(n;ε) and R^cpp(n;ε)\widehat R^{\mathrm{cpp}}(n;\varepsilon)Rcpp(n;ε) for the maximum unassisted and classical-post-processing assisted entanglement-transmission rates. A code has a positive integer message dimension MMM, rate log⁡2M/n\log_2 M/nlog2​M/n, and squared fidelity to the normalized maximally entangled target at least 1−ε1-\varepsilon1−ε. A cpp encoder may retain sender memory; its decoder is LOCC across that memory and the receiver outputs, with its final quantum output at the receiver and no preshared entanglement. Fix 0<ε<10<\varepsilon<10<ε<1. All logarithms are binary and Φ−1\Phi^{-1}Φ−1 is the standard Gaussian quantile. Remainder constants may depend on the fixed channel and error, and are chosen before the block length: there are C>0C>0C>0 and n0≥2n_0\ge2n0​≥2 such that the displayed bound holds for every integer n≥n0n\ge n_0n≥n0​. Write h(p)=−plog⁡2p−(1−p)log⁡2(1−p)h(p)=-p\log_2p-(1-p)\log_2(1-p)h(p)=−plog2​p−(1−p)log2​(1−p), with zero-weight terms zero, and v(p)=p(log⁡2p+h(p))2+(1−p)(log⁡2(1−p)+h(p))2v(p)=p(\log_2p+h(p))^2+(1-p)(\log_2(1-p)+h(p))^2v(p)=p(log2​p+h(p))2+(1−p)(log2​(1−p)+h(p))2. For every 0≤γ≤10\le\gamma\le10≤γ≤1, put ω=(id⊗Zγ)(Φ2)\omega=(\mathrm{id}\otimes\mathcal Z_\gamma)(\Phi_2)ω=(id⊗Zγ​)(Φ2​). Its coherent information and variance satisfy

I(A⟩B)ω=1−h(γ),V(A⟩B)ω=v(γ).I(A\rangle B)_\omega=1-h(\gamma),\qquad V(A\rangle B)_\omega=v(\gamma).I(A⟩B)ω​=1−h(γ),V(A⟩B)ω​=v(γ).

Moreover, with tn=1−h(γ)+v(γ)/nΦ−1(ε)t_n=1-h(\gamma)+\sqrt{v(\gamma)/n}\Phi^{-1}(\varepsilon)tn​=1−h(γ)+v(γ)/n​Φ−1(ε),

tn−C−log⁡2n/n≤R^Zγ(n;ε)≤tn+C+log⁡2n/nt_n-C_-\log_2n/n\le\widehat R_{\mathcal Z_\gamma}(n;\varepsilon)\le t_n+C_+\log_2n/ntn​−C−​log2​n/n≤RZγ​​(n;ε)≤tn​+C+​log2​n/n

for all sufficiently large nnn. Each side has fixed positive constants and thresholds; they may be combined into a single remainder bound. This second-order result includes zero dispersion.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P04
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder

open QAlgorithms

namespace QAlgorithms.Papers.Independent.Support50.P04

variable {A B E : Type} [Fintype A] [DecidableEq A]

variable [Fintype B] [DecidableEq B] [Fintype E] [DecidableEq E]

/-- arXiv:1504.04617v2, PDF pp.4,15–16, Eqs.(58)–(60).
Printed h=1-gamma log gamma-(1-gamma)log(1-gamma) in (58); changed to Result 1's
binary entropy. The O(log n/n) statement includes zero-dispersion endpoints. -/
theorem qubit_moments_secondOrder (gamma epsilon : ℝ) (hg0 : 0 ≤ gamma) (hg1 : gamma ≤ 1)
    (he0 : 0 < epsilon) (he1 : epsilon < 1) :
    QAlgorithms.Papers.Independent.Dependency50.P36.stateCoherentInformationBits (choiState (QAlgorithms.Papers.Independent.Information100.P27.qubitDephasing (1-2*gamma))) = 1-QAlgorithms.Papers.Independent.Frontier18.P07.binaryEntropyBits gamma ∧
    QAlgorithms.Papers.Independent.Dependency50.P36.coherentVariance (choiState (QAlgorithms.Papers.Independent.Information100.P27.qubitDephasing (1-2*gamma))) = binaryVariance gamma ∧
    dispersionLower (fun n => unassistedBoundary (QAlgorithms.Papers.Independent.Information100.P27.qubitDephasing (1-2*gamma)) n epsilon)
      (1-QAlgorithms.Papers.Independent.Frontier18.P07.binaryEntropyBits gamma) (binaryVariance gamma) epsilon ∧
    dispersionUpper (fun n => unassistedBoundary (QAlgorithms.Papers.Independent.Information100.P27.qubitDephasing (1-2*gamma)) n epsilon)
      (1-QAlgorithms.Papers.Independent.Frontier18.P07.binaryEntropyBits gamma) (binaryVariance gamma) epsilon := by sorry

end QAlgorithms.Papers.Independent.Support50.P04

end
Source
Quantum Coding with Finite Resources, arXiv:1504.04617v2, PDF p. 15, Eqs. (58)–(60)
Read-back

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

For every γ∈[0,1]\gamma\in[0,1]γ∈[0,1] and 0<ϵ<10<\epsilon<10<ϵ<1, let Dγ\mathcal D_\gammaDγ​ be the map on complex 2×22\times22×2 matrices that leaves diagonal entries unchanged and multiplies off-diagonal entries by 1−2γ1-2\gamma1−2γ, and let ωγ=JDγ/2\omega_\gamma=J_{\mathcal D_\gamma}/2ωγ​=JDγ​​/2, where JDγ,(a,b),(c,d)=Dγ(∣a⟩⟨c∣)bdJ_{\mathcal D_\gamma,(a,b),(c,d)}=\mathcal D_\gamma(|a\rangle\langle c|)_{bd}JDγ​,(a,b),(c,d)​=Dγ​(∣a⟩⟨c∣)bd​. Define

h(γ)=−γln⁡γ−(1−γ)ln⁡(1−γ)ln⁡2,v(γ)=γ(log⁡2γ+h(γ))2+(1−γ)(log⁡2(1−γ)+h(γ))2,h(\gamma)= \frac{-\gamma\ln\gamma-(1-\gamma)\ln(1-\gamma)}{\ln2}, \qquad v(\gamma)= \gamma\bigl(\log_2\gamma+h(\gamma)\bigr)^2+ (1-\gamma)\bigl(\log_2(1-\gamma)+h(\gamma)\bigr)^2,h(γ)=ln2−γlnγ−(1−γ)ln(1−γ)​,v(γ)=γ(log2​γ+h(γ))2+(1−γ)(log2​(1−γ)+h(γ))2,

using the total logarithm with ln⁡0=0\ln0=0ln0=0. The assertion gives both exact moment identities

S(Tr⁡Aωγ)−S(ωγ)=1−h(γ),S(\operatorname{Tr}_A\omega_\gamma)-S(\omega_\gamma)=1-h(\gamma),S(TrA​ωγ​)−S(ωγ​)=1−h(γ), Re⁡Tr⁡ ⁣[ωγ(log⁡2ωγ−log⁡2(I2⊗Tr⁡Aωγ))2]−(Re⁡Tr⁡[ωγln⁡ωγ−ωγln⁡(I2⊗Tr⁡Aωγ)]ln⁡2)2=v(γ),\operatorname{Re}\operatorname{Tr} \!\left[\omega_\gamma \bigl(\log_2\omega_\gamma- \log_2(I_2\otimes\operatorname{Tr}_A\omega_\gamma)\bigr)^2\right] -\left( \frac{\operatorname{Re}\operatorname{Tr} [\omega_\gamma\ln\omega_\gamma- \omega_\gamma\ln(I_2\otimes\operatorname{Tr}_A\omega_\gamma)]}{\ln2} \right)^2 =v(\gamma),ReTr[ωγ​(log2​ωγ​−log2​(I2​⊗TrA​ωγ​))2]−(ln2ReTr[ωγ​lnωγ​−ωγ​ln(I2​⊗TrA​ωγ​)]​)2=v(γ),

where S(X)=−Re⁡Tr⁡(Xlog⁡2X)S(X)=-\operatorname{Re}\operatorname{Tr}(X\log_2X)S(X)=−ReTr(Xlog2​X), and also two eventual bounds: there exist C−>0,n−≥2C_->0,n_-\ge2C−​>0,n−​≥2 and, separately, C+>0,n+≥2C_+>0,n_+\ge2C+​>0,n+​≥2, such that

1−h(γ)+v(γ)n Φ−1(ϵ)−C−log⁡2nn≤Cu(Dγ,n,ϵ)(n≥n−),1-h(\gamma)+\sqrt{\frac{v(\gamma)}n}\,\Phi^{-1}(\epsilon) -C_-\frac{\log_2n}{n} \le C_{\mathrm u}(\mathcal D_\gamma,n,\epsilon) \quad(n\ge n_-),1−h(γ)+nv(γ)​​Φ−1(ϵ)−C−​nlog2​n​≤Cu​(Dγ​,n,ϵ)(n≥n−​), Cu(Dγ,n,ϵ)≤1−h(γ)+v(γ)n Φ−1(ϵ)+C+log⁡2nn(n≥n+).C_{\mathrm u}(\mathcal D_\gamma,n,\epsilon) \le1-h(\gamma)+\sqrt{\frac{v(\gamma)}n}\,\Phi^{-1}(\epsilon) +C_+\frac{\log_2n}{n} \quad(n\ge n_+).Cu​(Dγ​,n,ϵ)≤1−h(γ)+nv(γ)​​Φ−1(ϵ)+C+​nlog2​n​(n≥n+​).

The quantile is Φ−1(ϵ)=inf⁡{z:ϵ≤∫−∞ze−x2/2/2π dx}\Phi^{-1}(\epsilon)=\inf\{z:\epsilon\le\int_{-\infty}^z e^{-x^2/2}/\sqrt{2\pi}\,dx\}Φ−1(ϵ)=inf{z:ϵ≤∫−∞z​e−x2/2/2π​dx}. The extended-real quantity CuC_{\mathrm u}Cu​ is the supremum of rates log⁡2M/n\log_2M/nlog2​M/n obtainable with positive integer MMM, a channel encoder into nnn qubits, and a channel decoder from nnn qubits, whose effective channel through Dγ⊗n\mathcal D_\gamma^{\otimes n}Dγ⊗n​ has overlap at least 1−ϵ1-\epsilon1−ϵ with the normalized maximally entangled state when acting on its second half. Channels mean finite Kraus sums with complete Kraus family. The endpoints γ=0,1\gamma=0,1γ=0,1 are included, and both have h(γ)=v(γ)=0h(\gamma)=v(\gamma)=0h(γ)=v(γ)=0.

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