Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Covariant product-alternative testing converse

Open
QAlgorithms.Papers.Independent.Support50.P04.covariant_product_comparator

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. Let n≥1n\ge1n≥1 and 0<ε<10<\varepsilon<10<ε<1, and assume covariance with respect to the full input unitary group, with an output unitary representation. Set ω=(id⊗N)(ΦA)\omega=(\mathrm{id}\otimes\mathcal N)(\Phi_A)ω=(id⊗N)(ΦA​) and use the normalized target. Then

R^cpp(n;ε)≤inf⁡σ∈PPT′(A:B)1nDHε(ω⊗n∥σ⊗n).\widehat R^{\mathrm{cpp}}(n;\varepsilon)\le\inf_{\sigma\in\mathrm{PPT}^{\prime}(A:B)}\frac1n D_H^\varepsilon(\omega^{\otimes n}\|\sigma^{\otimes n}).Rcpp(n;ε)≤σ∈PPT′(A:B)inf​n1​DHε​(ω⊗n∥σ⊗n).

The product restriction concerns the comparator only; codes may encode arbitrary entangled inputs.

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.12–13, Eq.(39): product ALTERNATIVES relax the
converse; actual code inputs remain arbitrary, including entangled blocked inputs. -/
theorem covariant_product_comparator [Nonempty A] [Nonempty B]
    (N : Superop A B) (hN : IsChannel N) (hcov : FullUnitaryCovariant N)
    (n : ℕ) (hn : 0 < n) (epsilon : ℝ) (he0 : 0 < epsilon) (he1 : epsilon < 1) :
    cppBoundary N n epsilon ≤ sInf {v | ∃ sigma : Matrix (A × B) (A × B) ℂ,
      QAlgorithms.Papers.Independent.Dependency50.P36.pptPrime sigma ∧
      v = QAlgorithms.Papers.Independent.Dependency50.P36.testingEntropy (QAlgorithms.Papers.Independent.Information100.P60.copies n (choiState N)) (QAlgorithms.Papers.Independent.Information100.P60.copies n sigma) epsilon / (n : EReal)} := by sorry

end QAlgorithms.Papers.Independent.Support50.P04

end
Source
Quantum Coding with Finite Resources, arXiv:1504.04617v2, PDF p. 12, Eq. (39)
Read-back

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

Let A,BA,BA,B be nonempty finite sets with decidable equality, and let N:MA(C)→MB(C)\mathcal N:M_A(\mathbb C)\to M_B(\mathbb C)N:MA​(C)→MB​(C) be a channel, meaning that it has a finite Kraus representation with complete Kraus family. Assume there exists a group homomorphism V:U(A)→U(B)V:U(A)\to U(B)V:U(A)→U(B) such that

N(UXU†)=V(U)N(X)V(U)†for every unitary U and every matrix X.\mathcal N(UXU^\dagger)=V(U)\mathcal N(X)V(U)^\dagger \quad\text{for every unitary }U\text{ and every matrix }X.N(UXU†)=V(U)N(X)V(U)†for every unitary U and every matrix X.

For every n>0n>0n>0 and 0<ϵ<10<\epsilon<10<ϵ<1, the assertion is

Ccpp(N,n,ϵ)≤inf⁡σ≥0∥σTB∥1≤1DHϵ(ωN⊗n∥σ⊗n)n,ωN,(a,b),(c,d)=N(∣a⟩⟨c∣)bd∣A∣.C_{\mathrm{cpp}}(\mathcal N,n,\epsilon) \le \inf_{\substack{\sigma\ge0\\\|\sigma^{T_B}\|_1\le1}} \frac{D_H^\epsilon(\omega_{\mathcal N}^{\otimes n}\| \sigma^{\otimes n})}{n}, \qquad \omega_{\mathcal N,(a,b),(c,d)} =\frac{\mathcal N(|a\rangle\langle c|)_{bd}}{|A|}.Ccpp​(N,n,ϵ)≤σ≥0∥σTB​∥1​≤1​inf​nDHϵ​(ωN⊗n​∥σ⊗n)​,ωN,(a,b),(c,d)​=∣A∣N(∣a⟩⟨c∣)bd​​.

The comparison matrix σ\sigmaσ is on A×BA\times BA×B and is not required to have trace one; its partial transpose has entries σ(a,b),(c,d)TB=σ(a,d),(c,b)\sigma^{T_B}_{(a,b),(c,d)}=\sigma_{(a,d),(c,b)}σ(a,b),(c,d)TB​​=σ(a,d),(c,b)​. Tensor powers have entries given by products of the corresponding single-copy entries, and ∥X∥1=Re⁡Tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{X^\dagger X}∥X∥1​=ReTrX†X​. The testing quantity is −log⁡2β-\log_2\beta−log2​β if

β=inf⁡0≤T≤IRe⁡Tr⁡(Tω)≥1−ϵRe⁡Tr⁡(Tτ)\beta=\inf_{\substack{0\le T\le I\\ \operatorname{Re}\operatorname{Tr}(T\omega)\ge1-\epsilon}} \operatorname{Re}\operatorname{Tr}(T\tau)β=0≤T≤IReTr(Tω)≥1−ϵ​inf​ReTr(Tτ)

is positive, and +∞+\infty+∞ otherwise, with (ω,τ)(\omega,\tau)(ω,τ) here equal to the two displayed tensor powers. The quantity CcppC_{\mathrm{cpp}}Ccpp​ is the extended-real supremum of rates RRR realized by positive dimensions M,qM,qM,q, a channel encoding MMM dimensions into An×[q]A^n\times[q]An×[q], and a channel decoding [q]×Bn[q]\times B^n[q]×Bn into MMM dimensions, with log⁡2M/n≥R\log_2M/n\ge Rlog2​M/n≥R and entanglement fidelity at least 1−ϵ1-\epsilon1−ϵ after applying N\mathcal NN independently to the nnn channel-input factors. Fidelity is the overlap of the effective channel’s output on half of M−1/2∑i∣i,i⟩M^{-1/2}\sum_i|i,i\rangleM−1/2∑i​∣i,i⟩ with that same maximally entangled state. The decoder must admit separate isometric embeddings into positive dimensions a,ba,ba,b, followed by a two-factor map L\mathcal LL, tracing out the first factor, and a channel on the second. The map L\mathcal LL is a limit of total maps of finite protocols arranged in a continuing sequence: the first has a positive number of rounds, and each successor extends each history by one round; a round consists of a countably indexed completely positive instrument at one factor and outcome-dependent channels at the other, with summable branch maps and trace-preserving total. Convergence is in the supremum trace norm on density inputs with a reference of the same dimension as the joint input.

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