Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

One-use testing-Rains metaconverse

Open
QAlgorithms.Papers.Independent.Support50.P04.oneUse_testingRains

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. For normalized ρ\rhoρ, let ωρ=(id⊗N)(ψρ)\omega^\rho=(\mathrm{id}\otimes\mathcal N)(\psi^\rho)ωρ=(id⊗N)(ψρ) with the source first-factor purification. Define

IRε(N)=sup⁡ρ∈S(A)inf⁡σ∈PPT′DHε(ωρ∥σ),I_R^\varepsilon(\mathcal N)=\sup_{\rho\in\mathcal S(A)}\inf_{\sigma\in\mathrm{PPT}^{\prime}}D_H^\varepsilon(\omega^\rho\|\sigma),IRε​(N)=ρ∈S(A)sup​σ∈PPT′inf​DHε​(ωρ∥σ),

where DHε(ω∥σ)=−log⁡2min⁡{tr⁡(Tσ):0⪯T⪯I,tr⁡(Tω)≥1−ε}D_H^\varepsilon(\omega\|\sigma)=-\log_2\min\{\operatorname{tr}(T\sigma):0\preceq T\preceq I,\operatorname{tr}(T\omega)\ge1-\varepsilon\}DHε​(ω∥σ)=−log2​min{tr(Tσ):0⪯T⪯I,tr(Tω)≥1−ε}, with value +∞+\infty+∞ when its testing value is zero. Then

R^cpp(1;ε)≤IRε(N).\widehat R^{\mathrm{cpp}}(1;\varepsilon)\le I_R^\varepsilon(\mathcal N).Rcpp(1;ε)≤IRε​(N).

The comparison state may vary with the input state.

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.10–11, Lemma 1, Eq.(24).
The comparison state is optimized separately for each normalized channel input. -/
theorem oneUse_testingRains [Nonempty A] [Nonempty B]
    (N : Superop A B) (hN : IsChannel N) (epsilon : ℝ)
    (he0 : 0 < epsilon) (he1 : epsilon < 1) :
    cppBoundary N 1 epsilon ≤ channelTestingRains N epsilon := by sorry

end QAlgorithms.Papers.Independent.Support50.P04

end
Source
Quantum Coding with Finite Resources, arXiv:1504.04617v2, PDF p. 10, Lemma 1, Eq. (24)
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 channel from complex matrices on AAA to those on BBB, and let 0<ϵ<10<\epsilon<10<ϵ<1; a channel means a finite Kraus sum X↦∑jEjXEj†X\mapsto\sum_jE_jXE_j^\daggerX↦∑j​Ej​XEj†​ with ∑jEj†Ej=I\sum_jE_j^\dagger E_j=I∑j​Ej†​Ej​=I. Define B1B_1B1​ as the extended-real supremum of real RRR for which there are positive integers M,qM,qM,q, a channel A:M→(A×q)\mathcal A:M\to(A\times q)A:M→(A×q), and a channel D:(q×B)→M\mathcal D:(q\times B)\to MD:(q×B)→M, such that R≤log⁡2MR\le\log_2MR≤log2​M and

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

The decoder must have the form F∘tr⁡a∘L∘Ad⁡W⊗V\mathcal F\circ\operatorname{tr}_a\circ\mathcal L\circ\operatorname{Ad}_{W\otimes V}F∘tra​∘L∘AdW⊗V​, for positive integers a,ba,ba,b, isometries W:q→aW:q\to aW:q→a, V:B→bV:B\to bV:B→b, and a channel F:b→M\mathcal F:b\to MF:b→M. The map L\mathcal LL must satisfy the following local-history limit condition: instruments have completely positive complex-linear branches, summable outputs for every matrix, and trace-preserving totals, with complete positivity tested under every finite identity amplification; a local round has tensor-product branches consisting of one party’s countable-outcome instrument and the other party’s outcome-dependent channel. There are finite raw history instruments KjK_jKj​, each starting from a local round and having a positive number of rounds, with each Kj+1K_{j+1}Kj+1​ obtained by extending every history of KjK_jKj​ by an outcome-dependent local round using the fixed pairing of natural-number labels, and single-outcome instruments AjA_jAj​ coarse-grained from KjK_jKj​ by summing over fibers of outcome-label functions, such that sup⁡ω density∥(id⊗(Aj−L))(ω)∥1→0\sup_{\omega\text{ density}}\|(\mathrm{id}\otimes(A_j-\mathcal L))(\omega)\|_1\to0supω density​∥(id⊗(Aj​−L))(ω)∥1​→0, where the identity register has dimension ababab. For every density matrix ρ\rhoρ on AAA, set sρ(i,j)=(ρ)i,js_\rho(i,j)=(\sqrt\rho)_{i,j}sρ​(i,j)=(ρ​)i,j​ and Ωρ=(idA⊗N)(sρsρ†)\Omega_\rho=(\mathrm{id}_A\otimes\mathcal N)(s_\rho s_\rho^\dagger)Ωρ​=(idA​⊗N)(sρ​sρ†​). For matrices X,GX,GX,G on the same space, define

bϵ(X,G)=inf⁡0≤Q≤IRe⁡tr⁡(QX)≥1−ϵRe⁡tr⁡(QG),Dϵ(X,G)={−log⁡2bϵ(X,G),bϵ(X,G)>0,+∞,bϵ(X,G)≤0.b_\epsilon(X,G)= \inf_{\substack{0\le Q\le I\\ \operatorname{Re}\operatorname{tr}(QX)\ge1-\epsilon}} \operatorname{Re}\operatorname{tr}(QG), \qquad D_\epsilon(X,G)= \begin{cases} -\log_2 b_\epsilon(X,G),&b_\epsilon(X,G)>0,\\ +\infty,&b_\epsilon(X,G)\le0. \end{cases}bϵ​(X,G)=0≤Q≤IRetr(QX)≥1−ϵ​inf​Retr(QG),Dϵ​(X,G)={−log2​bϵ​(X,G),+∞,​bϵ​(X,G)>0,bϵ​(X,G)≤0.​

Let GTBG^{T_B}GTB​ be partial transpose on BBB, and let ∥X∥1=Re⁡tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{tr}\sqrt{X^\dagger X}∥X∥1​=RetrX†X​. The theorem asserts the extended-real inequality

B1≤sup⁡ρ density on A inf⁡G≥0∥GTB∥1≤1Dϵ(Ωρ,G).B_1\le \sup_{\rho\text{ density on }A} \ \inf_{\substack{G\ge0\\\|G^{T_B}\|_1\le1}} D_\epsilon(\Omega_\rho,G).B1​≤ρ density on Asup​ G≥0∥GTB​∥1​≤1​inf​Dϵ​(Ωρ​,G).

Here log⁡2x=ln⁡x/ln⁡2\log_2x=\ln x/\ln2log2​x=lnx/ln2; the alternative GGG need not have trace 111, and the admissible alternatives include G=0G=0G=0, for which the displayed testing quantity is +∞+\infty+∞.

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