Bound entangled states give exactly the unassisted capacity
OpenQAlgorithms.Papers.Independent.Support50.P39.boundEntangledCapacityLet be a positive semidefinite density operator of trace one on two nonzero finite dimensional complex registers and , 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 for the operational supremum of classical bits per transmitted qubit: first choose integers and ; a block of channel uses sends a system of dimension and consumes copies. For each error tolerance and rate slack, all sufficiently large positive admit encoders for all -bit messages and one common decoder whose success is at least for every message. The normalized rate is , with vanishing error and arbitrarily small rate slack.
Suppose is bound entangled: it is inseparable and cannot be distilled to singlets by local quantum operations and two-way classical communication. Then
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.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P39
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let and be finite, nonempty types with decidable equality, and let be a complex matrix on . Assume that is positive semidefinite with trace , that it has no representation with , nonnegative real weights summing to , and positive semidefinite trace-one matrices , and that the following witnesses do not exist: a positive integer , a complex matrix with rows indexed by and columns by , and a complex matrix with rows indexed by and columns by , for which
and is not positive semidefinite. Here , and ; the matrices have no additional normalization requirement. A channel means a map with finitely many Kraus matrices satisfying . Define to consist of all real for which there exist integers such that, for every and every , some has the following property: for every with , there exist , channels indexed by all -bit strings , and positive semidefinite matrices on , with
Applying on Alice here means applying it to each Alice matrix block with Bob's indices fixed; is permitted. The declaration asserts that the real supremum of this set of rates is exactly :
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.