Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bound entangled states give exactly the unassisted capacity

Open
QAlgorithms.Papers.Independent.Support50.P39.boundEntangledCapacity

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ρAB\rho_{AB}ρAB​ be a positive semidefinite density operator of trace one on two nonzero finite dimensional complex registers AAA and BBB, whose dimensions may differ. Alice and Bob receive arbitrarily many independent copies of this one fixed state for free. Alice may send quantum systems to Bob through a noiseless channel; there is no free classical communication or feedback. Arbitrary local CPTP encodings, ancillas, disposal, and joint decoding are allowed. Entropies use logarithms to base two.

Write Csd(ρ)C_{\rm sd}(\rho)Csd​(ρ) for the operational supremum of classical bits per transmitted qubit: first choose integers d≥2d\ge2d≥2 and n≥1n\ge1n≥1; a block of kkk channel uses sends a system of dimension dkd^kdk and consumes nknknk copies. For each error tolerance and rate slack, all sufficiently large positive kkk admit encoders for all mmm-bit messages and one common decoder whose success is at least 1−ϵ1-\epsilon1−ϵ for every message. The normalized rate is m/(klog⁡2d)m/(k\log_2d)m/(klog2​d), with vanishing error and arbitrarily small rate slack.

Suppose ρ\rhoρ is bound entangled: it is inseparable and cannot be distilled to singlets by local quantum operations and two-way classical communication. Then

Csd(ρ)=1.C_{\rm sd}(\rho)=1.Csd​(ρ)=1.

Thus bound entanglement gives no dense-coding advantage. Distillation here defines the resource class; it does not add free classical communication to the dense-coding protocol.

Formalization Note The exact finite-copy two-qubit local-filter characterization of distillability is used, as established in the paper's Ref. 11. This includes every nondistillable entangled state, rather than only PPT states. Local images need remain nondistillable, but may become separable.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P39
Formal statement
namespace QAlgorithms.Papers.Independent.Support50.P39

noncomputable section

open QAlgorithms

open Filter Topology

open scoped Matrix ComplexConjugate ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

/-- arXiv:quant-ph/0106080v3, PDF pp.1,3: ALL bound entangled states have
capacity exactly one, including the unassisted baseline. Distillability is
unrestricted LOCC distillability, characterized by the source's cited Ref. 11.
A local image need only remain nondistillable; the source's claim that every
image remains entangled is not used (discarding can yield a separable state). -/
theorem boundEntangledCapacity {A B : Type*} [Fintype A] [Fintype B]
    [DecidableEq A] [DecidableEq B] [Nonempty A] [Nonempty B]
    (rho : Matrix (A × B) (A × B) ℂ) (hbound : IsBoundEntangled rho) :
    denseCodingCapacity rho = 1 := by sorry

end

end QAlgorithms.Papers.Independent.Support50.P39
Source
Classical capacity of a noiseless quantum channel assisted by noisy entanglement, arXiv:quant-ph/0106080v3, PDF p. 3, Section 1, consequence after Eq. (4)
Read-back

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

Let AAA and BBB be finite, nonempty types with decidable equality, and let ρ\rhoρ be a complex matrix on A×BA\times BA×B. Assume that ρ\rhoρ is positive semidefinite with trace 111, that it has no representation ρ=∑j=0q−1wjAj⊗Bj\rho=\sum_{j=0}^{q-1}w_jA_j\otimes B_jρ=∑j=0q−1​wj​Aj​⊗Bj​ with q∈Nq\in\mathbb Nq∈N, nonnegative real weights summing to 111, and positive semidefinite trace-one matrices Aj,BjA_j,B_jAj​,Bj​, and that the following witnesses do not exist: a positive integer sss, a complex matrix FFF with rows indexed by {0,1}\{0,1\}{0,1} and columns by AsA^sAs, and a complex matrix GGG with rows indexed by {0,1}\{0,1\}{0,1} and columns by BsB^sBs, for which

X=(F⊗G)ρ[s](F⊗G)†,Re⁡tr⁡X>0,X=(F\otimes G)\rho^{[s]}(F\otimes G)^\dagger, \qquad \operatorname{Re}\operatorname{tr}X>0,X=(F⊗G)ρ[s](F⊗G)†,RetrX>0,

and XTAX^{T_A}XTA​ is not positive semidefinite. Here ρ(a,b),(a′,b′)[s]=∏t=0s−1ρ(at,bt),(at′,bt′)\rho^{[s]}_{(a,b),(a',b')}=\prod_{t=0}^{s-1}\rho_{(a_t,b_t),(a'_t,b'_t)}ρ(a,b),(a′,b′)[s]​=∏t=0s−1​ρ(at​,bt​),(at′​,bt′​)​, and (XTA)(i,j),(i′,j′)=X(i′,j),(i,j′)(X^{T_A})_{(i,j),(i',j')}=X_{(i',j),(i,j')}(XTA​)(i,j),(i′,j′)​=X(i′,j),(i,j′)​; the matrices F,GF,GF,G have no additional normalization requirement. A channel means a map Φ(Y)=∑j=0q−1EjYEj†\Phi(Y)=\sum_{j=0}^{q-1}E_jYE_j^\daggerΦ(Y)=∑j=0q−1​Ej​YEj†​ with finitely many Kraus matrices satisfying ∑jEj†Ej=I\sum_jE_j^\dagger E_j=I∑j​Ej†​Ej​=I. Define Rρ\mathcal R_\rhoRρ​ to consist of all real R≥0R\ge0R≥0 for which there exist integers d≥2,n>0d\ge2,n>0d≥2,n>0 such that, for every 0<ϵ<10<\epsilon<10<ϵ<1 and every δ>0\delta>0δ>0, some K∈NK\in\mathbb NK∈N has the following property: for every k≥Kk\ge Kk≥K with k>0k>0k>0, there exist m∈Nm\in\mathbb Nm∈N, channels Ex:Ank→{0,…,dk−1}\mathcal E_x:A^{nk}\to\{0,\ldots,d^k-1\}Ex​:Ank→{0,…,dk−1} indexed by all mmm-bit strings xxx, and positive semidefinite matrices MxM_xMx​ on {0,…,dk−1}×Bnk\{0,\ldots,d^k-1\}\times B^{nk}{0,…,dk−1}×Bnk, with

m≥(R−δ)klog⁡2d,∑xMx=I,Re⁡tr⁡ ⁣(Mx(Ex⊗id)(ρ[nk]))≥1−ϵfor every x.m\ge(R-\delta)k\log_2d,\qquad \sum_xM_x=I,\qquad \operatorname{Re}\operatorname{tr}\!\left(M_x(\mathcal E_x\otimes\mathrm{id})(\rho^{[nk]})\right)\ge1-\epsilon \quad\text{for every }x.m≥(R−δ)klog2​d,x∑​Mx​=I,Retr(Mx​(Ex​⊗id)(ρ[nk]))≥1−ϵfor every x.

Applying Ex\mathcal E_xEx​ on Alice here means applying it to each Alice matrix block with Bob's indices fixed; m=0m=0m=0 is permitted. The declaration asserts that the real supremum of this set of rates is exactly 111:

sup⁡Rρ=1.\sup\mathcal R_\rho=1.supRρ​=1.
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