Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Qubit dephasing: third-order boundary

Open
QAlgorithms.Papers.Independent.Support50.P04.dephasing_thirdOrder

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 the phase-flip channel Zγ(X)=(1−γ)X+γZXZ\mathcal Z_\gamma(X)=(1-\gamma)X+\gamma ZXZZγ​(X)=(1−γ)X+γZXZ, assume 0<γ<10<\gamma<10<γ<1 and γ≠1/2\gamma\ne1/2γ=1/2. Then

∣R^Zγ(n;ε)−(1−h(γ)+v(γ)/n Φ−1(ε)+log⁡2n2n)∣≤Cn.\left|\widehat R_{\mathcal Z_\gamma}(n;\varepsilon)-\left(1-h(\gamma)+\sqrt{v(\gamma)/n}\,\Phi^{-1}(\varepsilon)+\frac{\log_2n}{2n}\right)\right|\le\frac Cn.​RZγ​​(n;ε)−(1−h(γ)+v(γ)/n​Φ−1(ε)+2nlog2​n​)​≤nC​.

This gives the third-order operational boundary on the nonzero-dispersion domain.

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,16–17, Result 1, Eq.(6).
Printed gamma in [0,1]; changed to positive nonzero dispersion, because the
+log2(n)/(2n) term is false at 0,1/2,1. Those printed cases are deferred separately. -/
theorem dephasing_thirdOrder (gamma epsilon : ℝ)
    (hg0 : 0 < gamma) (hg1 : gamma < 1) (hghalf : gamma ≠ 1/2)
    (he0 : 0 < epsilon) (he1 : epsilon < 1) :
    thirdOrderExpansion (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. 4, Result 1, Eq. (6)
Read-back

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

For every γ,ϵ∈R\gamma,\epsilon\in\mathbb Rγ,ϵ∈R satisfying 0<γ<10<\gamma<10<γ<1, γ≠12\gamma\ne\tfrac12γ=21​, and 0<ϵ<10<\epsilon<10<ϵ<1, let Nγ\mathcal N_\gammaNγ​ be the map on 2×22\times22×2 complex matrices that leaves diagonal entries unchanged and multiplies each off-diagonal entry by 1−2γ1-2\gamma1−2γ. Set h(x)=[−xln⁡x−(1−x)ln⁡(1−x)]/ln⁡2h(x)=[-x\ln x-(1-x)\ln(1-x)]/\ln2h(x)=[−xlnx−(1−x)ln(1−x)]/ln2, with the total real logarithm used by the definitions, set log⁡2x=ln⁡x/ln⁡2\log_2x=\ln x/\ln2log2​x=lnx/ln2, and set

a=1−h(γ),v=γ(log⁡2γ+h(γ))2+(1−γ)(log⁡2(1−γ)+h(γ))2.a=1-h(\gamma),\qquad v=\gamma\bigl(\log_2\gamma+h(\gamma)\bigr)^2+ (1-\gamma)\bigl(\log_2(1-\gamma)+h(\gamma)\bigr)^2.a=1−h(γ),v=γ(log2​γ+h(γ))2+(1−γ)(log2​(1−γ)+h(γ))2.

For each nnn, let Rn∈[−∞,+∞]R_n\in[-\infty,+\infty]Rn​∈[−∞,+∞] be the supremum of all real RRR, embedded in the extended reals, for which there are a positive integer MMM and channels E\mathcal EE from MMM-dimensional matrices to matrices on {0,1}n\{0,1\}^n{0,1}n and D\mathcal DD in the reverse direction such that R≤log⁡2M/nR\le\log_2M/nR≤log2​M/n and

1−ϵ≤Re⁡tr⁡ ⁣[ΦM(id⊗(D∘Nγ⊗n∘E))(ΦM)],ΦM=1M∑i,j=0M−1∣i,i⟩⟨j,j∣.1-\epsilon\le \operatorname{Re}\operatorname{tr}\!\left[ \Phi_M\bigl(\mathrm{id}\otimes(\mathcal D\circ\mathcal N_\gamma^{\otimes n}\circ\mathcal E)\bigr)(\Phi_M) \right], \qquad \Phi_M=\frac1M\sum_{i,j=0}^{M-1}|i,i\rangle\langle j,j|.1−ϵ≤Retr[ΦM​(id⊗(D∘Nγ⊗n​∘E))(ΦM​)],ΦM​=M1​i,j=0∑M−1​∣i,i⟩⟨j,j∣.

Here a channel means a map X↦∑jEjXEj†X\mapsto\sum_jE_jXE_j^\daggerX↦∑j​Ej​XEj†​ with a finite Kraus family satisfying ∑jEj†Ej=I\sum_jE_j^\dagger E_j=I∑j​Ej†​Ej​=I, and the tensor power is its usual multilinear extension on matrix units. Write zϵ=inf⁡{z∈R:∫−∞ze−x2/2/2π dx≥ϵ}z_\epsilon=\inf\{z\in\mathbb R:\int_{-\infty}^z e^{-x^2/2}/\sqrt{2\pi}\,dx\ge\epsilon\}zϵ​=inf{z∈R:∫−∞z​e−x2/2/2π​dx≥ϵ}. The theorem asserts that there exist C>0C>0C>0 and a natural number n0≥2n_0\ge2n0​≥2 such that, for every natural n≥n0n\ge n_0n≥n0​,

a+vn zϵ+log⁡2n2n−Cn ≤Rn≤ a+vn zϵ+log⁡2n2n+Cn.a+\sqrt{\frac vn}\,z_\epsilon+\frac{\log_2n}{2n}-\frac Cn \ \le R_n\le\ a+\sqrt{\frac vn}\,z_\epsilon+\frac{\log_2n}{2n}+\frac Cn.a+nv​​zϵ​+2nlog2​n​−nC​ ≤Rn​≤ a+nv​​zϵ​+2nlog2​n​+nC​.

Both inequalities are in the extended reals; no assertion is made here about block lengths below n0n_0n0​.

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