Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

General second-order achievability

Open
QAlgorithms.Papers.Independent.Support50.P04.general_secondOrder_inner

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​. For every normalized density input ρ\rhoρ, use the source purification with coefficients (ρ)ij(\sqrt\rho)_{ij}(ρ​)ij​ in the reference/input bases, and put ωρ=(id⊗N)(ψρ)\omega^\rho=(\mathrm{id}\otimes\mathcal N)(\psi^\rho)ωρ=(id⊗N)(ψρ). Let Ic(N)=max⁡ρ[S(B)ωρ−S(AB)ωρ]I_c(\mathcal N)=\max_\rho[S(B)_{\omega^\rho}-S(AB)_{\omega^\rho}]Ic​(N)=maxρ​[S(B)ωρ​−S(AB)ωρ​], and let Πc\Pi_cΠc​ be all maximizing density inputs, including rank-deficient ones. Let VcεV_c^\varepsilonVcε​ be the minimum of V(ωρ∥IA⊗ωBρ)V(\omega^\rho\|I_A\otimes\omega_B^\rho)V(ωρ∥IA​⊗ωBρ​) over Πc\Pi_cΠc​ below 1/21/21/2, and the maximum at or above 1/21/21/2. Then

R^(n;ε)≥Ic(N)+Vcε(N)/n Φ−1(ε)−Clog⁡2n/n.\widehat R(n;\varepsilon)\ge I_c(\mathcal N)+\sqrt{V_c^\varepsilon(\mathcal N)/n}\,\Phi^{-1}(\varepsilon)-C\log_2n/n.R(n;ε)≥Ic​(N)+Vcε​(N)/n​Φ−1(ε)−Clog2​n/n.

This is a general achievable lower bound; it need not equal the optimal boundary.

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.8,14, Result 5, Eq.(15).
This is an achievable lower bound, not equality with the arbitrary-channel boundary. -/
theorem general_secondOrder_inner [Nonempty A] [Nonempty B]
    (N : Superop A B) (hN : IsChannel N) (epsilon : ℝ)
    (he0 : 0 < epsilon) (he1 : epsilon < 1) :
    dispersionLower (fun n => unassistedBoundary N n epsilon)
      (channelCoherentBits N) (coherentInformationVariance N epsilon) epsilon := by sorry

end QAlgorithms.Papers.Independent.Support50.P04

end
Source
Quantum Coding with Finite Resources, arXiv:1504.04617v2, PDF p. 8, Result 5, Eq. (15)
Read-back

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

Let A,BA,BA,B be arbitrary finite nonempty types with decidable equality, let N\mathcal NN be a map from complex matrices on AAA to those on BBB with a finite Kraus representation N(X)=∑jEjXEj†\mathcal N(X)=\sum_jE_jXE_j^\daggerN(X)=∑j​Ej​XEj†​, ∑jEj†Ej=IA\sum_jE_j^\dagger E_j=I_A∑j​Ej†​Ej​=IA​, and let 0<ϵ<10<\epsilon<10<ϵ<1. Write S(X)=−Re⁡tr⁡f(X)S(X)=-\operatorname{Re}\operatorname{tr}f(X)S(X)=−Retrf(X), where f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x is applied by functional calculus and log⁡2x=ln⁡x/ln⁡2\log_2x=\ln x/\ln2log2​x=lnx/ln2. For each density matrix ρ\rhoρ on AAA, form the vector sρ(i,j)=(ρ)i,js_\rho(i,j)=(\sqrt\rho)_{i,j}sρ​(i,j)=(ρ​)i,j​, the matrix Ωρ=(idA⊗N)(sρsρ†)\Omega_\rho=(\mathrm{id}_A\otimes\mathcal N)(s_\rho s_\rho^\dagger)Ωρ​=(idA​⊗N)(sρ​sρ†​), its BBB-marginal Ωρ,B=tr⁡AΩρ\Omega_{\rho,B}=\operatorname{tr}_A\Omega_\rhoΩρ,B​=trA​Ωρ​, and Iρ=S(Ωρ,B)−S(Ωρ)I_\rho=S(\Omega_{\rho,B})-S(\Omega_\rho)Iρ​=S(Ωρ,B​)−S(Ωρ​). Define

a=sup⁡ρ densityIρ,O={ρ density:Iρ=a},a=\sup_{\rho\text{ density}}I_\rho,\qquad \mathcal O=\{\rho\text{ density}:I_\rho=a\},a=ρ densitysup​Iρ​,O={ρ density:Iρ​=a}, Vρ=Re⁡tr⁡ ⁣[Ωρ(log⁡2Ωρ−log⁡2(IA⊗Ωρ,B))2]−(Re⁡tr⁡(fln⁡(Ωρ)−Ωρln⁡(IA⊗Ωρ,B))ln⁡2)2,fln⁡(x)=xln⁡x,V_\rho= \operatorname{Re}\operatorname{tr}\!\left[ \Omega_\rho\bigl(\log_2\Omega_\rho-\log_2(I_A\otimes\Omega_{\rho,B})\bigr)^2 \right] -\left( \frac{\operatorname{Re}\operatorname{tr}\bigl(f_{\ln}(\Omega_\rho) -\Omega_\rho\ln(I_A\otimes\Omega_{\rho,B})\bigr)}{\ln2} \right)^2, \quad f_{\ln}(x)=x\ln x,Vρ​=Retr[Ωρ​(log2​Ωρ​−log2​(IA​⊗Ωρ,B​))2]−(ln2Retr(fln​(Ωρ​)−Ωρ​ln(IA​⊗Ωρ,B​))​)2,fln​(x)=xlnx,

and let vϵ=inf⁡ρ∈OVρv_\epsilon=\inf_{\rho\in\mathcal O}V_\rhovϵ​=infρ∈O​Vρ​ if ϵ<12\epsilon<\tfrac12ϵ<21​, and vϵ=sup⁡ρ∈OVρv_\epsilon=\sup_{\rho\in\mathcal O}V_\rhovϵ​=supρ∈O​Vρ​ otherwise. For each nnn, let RnR_nRn​ be the extended-real supremum of real RRR for which there exist a positive integer MMM and channels E:M→An\mathcal E:M\to A^nE:M→An, D:Bn→M\mathcal D:B^n\to MD:Bn→M, each a finite normalized Kraus sum, satisfying R≤log⁡2M/nR\le\log_2M/nR≤log2​M/n and

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

The theorem asserts that there exist C>0C>0C>0 and a natural n0≥2n_0\ge2n0​≥2 such that every natural n≥n0n\ge n_0n≥n0​ satisfies

a+vϵn zϵ−Clog⁡2nn≤Rn,a+\sqrt{\frac{v_\epsilon}{n}}\,z_\epsilon-C\frac{\log_2n}{n}\le R_n,a+nvϵ​​​zϵ​−Cnlog2​n​≤Rn​,

where zϵz_\epsilonzϵ​ is the infimum of the real zzz at which the standard normal integral is at least ϵ\epsilonϵ. All suprema and infima defining a,vϵa,v_\epsilona,vϵ​ are real ones, including their total-function conventions if an indexing set is empty or unbounded; no separate optimizer-attainment hypothesis is imposed. No conclusion for small block lengths is included.

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