Every entangled pure state supplies capacity two
OpenQAlgorithms.Papers.Independent.Support50.P39.entangledPureCapacityLet 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.
Let have norm one, and assume is entangled. Then
This includes nonmaximal Schmidt spectra and unequal local dimensions. Unlimited copies and compression allow the optimal two-bit rate even when the entanglement entropy of one copy is arbitrarily small but positive. Product pure states are excluded.
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 p.8: every normalized entangled pure
resource has capacity two bits per transmitted qubit with unlimited copies,
including nonmaximal Schmidt spectra and unequal local dimensions.
Product pure states are excluded by inseparability, not by a maximality condition. -/
theorem entangledPureCapacity {A B : Type*} [Fintype A] [Fintype B]
[DecidableEq A] [DecidableEq B] [Nonempty A] [Nonempty B]
(psi : EuclideanSpace ℂ (A × B)) (hpsi : ‖psi‖ = 1)
(hent : ¬ QAlgorithms.Entanglement.IsSeparableDensity (pureDensity psi)) :
denseCodingCapacity (pureDensity psi) = 2 := 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 be finite, nonempty types with decidable equality, and let , with its Euclidean norm, satisfy . Define , and assume there are no , nonnegative real weights summing to , and positive semidefinite trace-one matrices on and on such that . A channel means a map with a finite family satisfying . Let denote the matrix on with entries . Define to contain precisely those real for which there exist integers such that, for every and every , there exists so that, for every with , there exist a natural number , channels indexed by all -bit strings , and positive semidefinite matrices on , satisfying
Here applying on Alice means applying it to each Alice matrix block with Bob's row and column fixed, and is allowed. The declaration asserts that the real supremum of this set is exactly :
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.