Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Optimized smooth-min-entropy achievability

Open
QAlgorithms.Papers.Independent.Support50.P04.optimized_smooth_achievability

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 n≥1n\ge1n≥1, 0<ε<10<\varepsilon<10<ε<1, and one isometry U:A↪B⊗EU:A\hookrightarrow B\otimes EU:A↪B⊗E; N\mathcal NN and Nc\mathcal N^cNc are respectively the receiver and environment partial traces of that same dilation. For a normalized center ω\omegaω, define Hmin⁡δ(A∣E)ωH_{\min}^{\delta}(A|E)_\omegaHminδ​(A∣E)ω​ as the supremum of real λ\lambdaλ for which there exist ωˉ⪰0\bar\omega\succeq0ωˉ⪰0 of trace at most one and a normalized density σE\sigma_EσE​ such that F(ωˉ,ω)≥1−δ2F(\bar\omega,\omega)\ge1-\delta^2F(ωˉ,ω)≥1−δ2 and ωˉ⪯2−λIA⊗σE\bar\omega\preceq2^{-\lambda}I_A\otimes\sigma_Eωˉ⪯2−λIA​⊗σE​. Supremums are taken in the extended reals. For every normalized input ρ\rhoρ on AnA^nAn, put ωρ=(id⊗(Nc)⊗n)(ψρ)\omega^\rho=(\mathrm{id}\otimes(\mathcal N^c)^{\otimes n})(\psi^\rho)ωρ=(id⊗(Nc)⊗n)(ψρ). Then

R^(n;ε)≥sup⁡0<η<εsup⁡ρ∈S(An)Hmin⁡ε−η(An∣En)ωρ−4log⁡2(1/η)−1n.\widehat R(n;\varepsilon)\ge\sup_{0<\eta<\varepsilon}\sup_{\rho\in\mathcal S(A^n)}\frac{H_{\min}^{\sqrt{\varepsilon-\eta}}(A^n|E^n)_{\omega^\rho}-4\log_2(1/\eta)-1}{n}.R(n;ε)≥0<η<εsup​ρ∈S(An)sup​nHminε−η​​(An∣En)ωρ​−4log2​(1/η)−1​.

The one-bit term accounts for integer message rounding.

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.13–14, Corollary 5, Eq.(46).
Printed ball F>=(1-delta)^2; changed to F>=1-delta^2 to match the named purified
distance and the square-root conversion used in (45),(51). Entire expression /n. -/
theorem optimized_smooth_achievability [Nonempty A] [Nonempty B] [Nonempty E]
    (U : Matrix (B × E) A ℂ) (hU : Uᴴ * U = 1)
    (n : ℕ) (hn : 0 < n) (epsilon : ℝ) (he0 : 0 < epsilon) (he1 : epsilon < 1) :
    smoothInner (QAlgorithms.Papers.Independent.Information100.P67.complementaryChannel U) n epsilon ≤
      unassistedBoundary (QAlgorithms.Papers.Independent.Information100.P67.receiverChannel U) n epsilon := by sorry

end QAlgorithms.Papers.Independent.Support50.P04

end
Source
Quantum Coding with Finite Resources, arXiv:1504.04617v2, PDF p. 14, Corollary 5, Eq. (46)
Read-back

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

Let A,B,EA,B,EA,B,E be nonempty finite sets with decidable equality, and let U:CA→CB×EU:\mathbb C^A\to\mathbb C^{B\times E}U:CA→CB×E satisfy U†U=IAU^\dagger U=I_AU†U=IA​. Define N(X)=Tr⁡E(UXU†)\mathcal N(X)=\operatorname{Tr}_E(UXU^\dagger)N(X)=TrE​(UXU†) and Nc(X)=Tr⁡B(UXU†)\mathcal N^c(X)=\operatorname{Tr}_B(UXU^\dagger)Nc(X)=TrB​(UXU†). For every integer n>0n>0n>0 and 0<ϵ<10<\epsilon<10<ϵ<1, the assertion is

sup⁡0<η<ϵρ≥0, Tr⁡ρ=1Hmin⁡ϵ−η ⁣(Ω(Nc)⊗n,ρ)−4log⁡2(1/η)−1n≤Cu(N,n,ϵ).\sup_{\substack{0<\eta<\epsilon\\ \rho\ge0,\ \operatorname{Tr}\rho=1}} \frac{ H_{\min}^{\sqrt{\epsilon-\eta}} \!\left(\Omega_{(\mathcal N^c)^{\otimes n},\rho}\right) -4\log_2(1/\eta)-1}{n} \le C_{\mathrm u}(\mathcal N,n,\epsilon).0<η<ϵρ≥0, Trρ=1​sup​nHminϵ−η​​(Ω(Nc)⊗n,ρ​)−4log2​(1/η)−1​≤Cu​(N,n,ϵ).

Here ρ\rhoρ ranges over matrices on AnA^nAn; if S=ρS=\sqrt\rhoS=ρ​, then PρP_\rhoPρ​ has entries SijSkl‾S_{ij}\overline{S_{kl}}Sij​Skl​​ at ((i,j),(k,l))((i,j),(k,l))((i,j),(k,l)), and ΩM,ρ=(id⊗M)(Pρ)\Omega_{\mathcal M,\rho}=(\mathrm{id}\otimes\mathcal M)(P_\rho)ΩM,ρ​=(id⊗M)(Pρ​). Tensor powers of maps act separately on each coordinate of matrix units. For a matrix ω\omegaω on I×JI\times JI×J, the quantity appearing on the left is defined by

Hmin⁡δ(ω)=sup⁡{λ∈R:∃ τ≥0,Re⁡Tr⁡τ≤1,F(τ,ω)≥1−δ2,∃ σ≥0,Tr⁡σ=1,τ≤2−λII⊗σ},H_{\min}^{\delta}(\omega)= \sup\left\{\lambda\in\mathbb R: \begin{array}{l} \exists\,\tau\ge0,\quad \operatorname{Re}\operatorname{Tr}\tau\le1,\quad F(\tau,\omega)\ge1-\delta^2,\\ \exists\,\sigma\ge0,\quad\operatorname{Tr}\sigma=1,\quad \tau\le2^{-\lambda}I_I\otimes\sigma \end{array}\right\},Hminδ​(ω)=sup{λ∈R:∃τ≥0,ReTrτ≤1,F(τ,ω)≥1−δ2,∃σ≥0,Trσ=1,τ≤2−λII​⊗σ​},

where the supremum is taken in the extended reals, σ\sigmaσ is on JJJ, and F(X,Y)=(Re⁡Tr⁡X Y X)2F(X,Y)=(\operatorname{Re}\operatorname{Tr}\sqrt{\sqrt X\,Y\,\sqrt X})^2F(X,Y)=(ReTrX​YX​​)2. Thus the smoothing condition uses this squared fidelity, and permits τ=0\tau=0τ=0. The right side is the extended-real supremum of all real RRR for which some positive integer MMM, a channel encoder E:MM(C)→MAn(C)\mathcal E:M_M(\mathbb C)\to M_{A^n}(\mathbb C)E:MM​(C)→MAn​(C), and a channel decoder D:MBn(C)→MM(C)\mathcal D:M_{B^n}(\mathbb C)\to M_M(\mathbb C)D:MBn​(C)→MM​(C) satisfy log⁡2M/n≥R\log_2M/n\ge Rlog2​M/n≥R and

Re⁡Tr⁡ ⁣[ΦM(id⊗(D∘N⊗n∘E))(ΦM)]≥1−ϵ,\operatorname{Re}\operatorname{Tr} \!\left[\Phi_M(\mathrm{id}\otimes (\mathcal D\circ\mathcal N^{\otimes n}\circ\mathcal E))(\Phi_M)\right] \ge1-\epsilon,ReTr[ΦM​(id⊗(D∘N⊗n∘E))(ΦM​)]≥1−ϵ,

where ΦM\Phi_MΦM​ projects onto M−1/2∑i∣i,i⟩M^{-1/2}\sum_i|i,i\rangleM−1/2∑i​∣i,i⟩. Every channel here means a finite Kraus sum whose Kraus operators satisfy the completeness equation.

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