Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Arbitrarily many uses can fail to detect positive quantum capacity

Open
QAlgorithms.Papers.Independent.Intakenext100.P70.arbitrarilyManyUses

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let n≥1n\geq1n≥1 be an integer. For a finite-dimensional quantum channel C\mathcal CC, write

Q(t)(C)=1tmax⁡ρIcoh(C⊗t,ρ),Q(C)=sup⁡t≥1Q(t)(C),Q^{(t)}(\mathcal C)=\frac1t\max_{\rho} I_{\mathrm{coh}}(\mathcal C^{\otimes t},\rho),\qquad Q(\mathcal C)=\sup_{t\geq1}Q^{(t)}(\mathcal C),Q(t)(C)=t1​ρmax​Icoh​(C⊗t,ρ),Q(C)=t≥1sup​Q(t)(C),

where the maximization ranges over all positive semidefinite, trace-one joint input matrices, including entangled inputs. Entropies and rates are in bits, and QQQ is the unassisted quantum capacity.

There exist positive finite-dimensional input and output registers, a completely positive trace-preserving channel C\mathcal CC between them, and an integer t>nt>nt>n such that

Q(n)(C)=0,Q(t)(C)>0,Q(C)>0.Q^{(n)}(\mathcal C)=0,\qquad Q^{(t)}(\mathcal C)>0,\qquad Q(\mathcal C)>0.Q(n)(C)=0,Q(t)(C)>0,Q(C)>0.

The register dimensions may depend on nnn. This shows that no fixed finite number of channel uses suffices to detect positive quantum capacity for every channel.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P70
Formal statement
namespace QAlgorithms.Papers.Independent.Intakenext100.P70

noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P22
  (Op coherentInformation singleUseInformation quantumCapacity mixed)

/-- Abstract/introduction, PDF pp.1--2; proved on p.11: no finite block length detects
positive capacity for every channel. Dimensions may grow with n; all inputs are optimized. -/
theorem arbitrarilyManyUses (n : ℕ) (hn : 0 < n) :
    ∃ a b : ℕ, 0 < a ∧ 0 < b ∧ ∃ Phi : Superop (Fin a) (Fin b),
      IsChannel Phi ∧ cubittBlockInformation Phi n = 0 ∧
      ∃ t : ℕ, n < t ∧ 0 < cubittBlockInformation Phi t ∧ 0 < quantumCapacity Phi := by sorry

end

end QAlgorithms.Papers.Independent.Intakenext100.P70
Source
Unbounded number of channel uses are required to see quantum capacity, arXiv:1408.5115v1, PDF p. 1, Abstract/introduction; proved by Supplementary Theorem, p.11
Read-back

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

For every natural number n>0n>0n>0, there exist positive natural numbers a,ba,ba,b, a map Φ\PhiΦ from complex a×aa\times aa×a matrices to complex b×bb\times bb×b matrices, and a natural number t>nt>nt>n, such that Φ\PhiΦ has a finite Kraus representation

Φ(X)=∑jEjXEj†,∑jEj†Ej=Ia,\Phi(X)=\sum_j E_jXE_j^\dagger,\qquad \sum_jE_j^\dagger E_j=I_a,Φ(X)=j∑​Ej​XEj†​,j∑​Ej†​Ej​=Ia​,

and

Bn(Φ)=0,Bt(Φ)>0,Q(Φ)>0.B_n(\Phi)=0,\qquad B_t(\Phi)>0,\qquad Q(\Phi)>0.Bn​(Φ)=0,Bt​(Φ)>0,Q(Φ)>0.

Here

Bℓ(Φ)=1ℓsup⁡ρ⪰0, tr⁡ρ=1[S(Φ⊗ℓ(ρ))−S((id⊗Φ⊗ℓ)(∣vρ⟩⟨vρ∣))],Q(Φ)=sup⁡ℓ∈N, ℓ>0Bℓ(Φ).B_\ell(\Phi)=\frac1\ell \sup_{\rho\succeq0,\ \operatorname{tr}\rho=1} \left[S\bigl(\Phi^{\otimes\ell}(\rho)\bigr) -S\bigl((\mathrm{id}\otimes\Phi^{\otimes\ell}) (|v_\rho\rangle\langle v_\rho|)\bigr)\right], \qquad Q(\Phi)=\sup_{\ell\in\mathbb N,\ \ell>0}B_\ell(\Phi).Bℓ​(Φ)=ℓ1​ρ⪰0, trρ=1sup​[S(Φ⊗ℓ(ρ))−S((id⊗Φ⊗ℓ)(∣vρ​⟩⟨vρ​∣))],Q(Φ)=ℓ∈N, ℓ>0sup​Bℓ​(Φ).

For a density matrix indexed by a finite set LLL, the purification used here has coordinates vρ(i,j)=(ρ)j,iv_\rho(i,j)=(\sqrt\rho)_{j,i}vρ​(i,j)=(ρ​)j,i​; the extension id⊗Ψ\mathrm{id}\otimes\Psiid⊗Ψ applies Ψ\PsiΨ to each matrix block with fixed reference indices. The tensor map is defined entrywise by

(Φ⊗ℓ(X))y,y′=∑x,x′Xx,x′∏i<ℓ(Φ(∣xi⟩⟨xi′∣))yi,yi′.\bigl(\Phi^{\otimes\ell}(X)\bigr)_{y,y'} =\sum_{x,x'}X_{x,x'}\prod_{i<\ell} \bigl(\Phi(|x_i\rangle\langle x_i'|)\bigr)_{y_i,y_i'}.(Φ⊗ℓ(X))y,y′​=x,x′∑​Xx,x′​i<ℓ∏​(Φ(∣xi​⟩⟨xi′​∣))yi​,yi′​​.

Finally, S(Z)=−Re⁡tr⁡f(Z)S(Z)=-\operatorname{Re}\operatorname{tr}f(Z)S(Z)=−Retrf(Z), with f(u)=ulog⁡2uf(u)=u\log_2uf(u)=ulog2​u applied by continuous functional calculus. Thus the claimed zero concerns precisely the normalized supremum for nnn tensor factors; the declaration makes no separate assertion for each smaller positive number of factors.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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