Proposition 15: optimal-cbit entangled ensemble preparation
OpenQAlgorithms.Papers.Independent.Intakenext100.P54.optimal_cbit_entangled_preparationLet be a finite probability ensemble of normalized bipartite vectors in fixed positive dimensions. Write and . There are one-way entangled preparation codes achieving
Achievability means that, for every positive error and rate slack, every sufficiently large blocklength admits one code with the stated cbit and ebit rates up to that slack and global average overlap at least one minus the error. Alice uses input-dependent CP instruments; Bob uses fixed message-dependent CPTP decoders. The joint output approximates the chosen product purification, including Alice's share. This is the optimal-cbit endpoint; its ebit rate is entropy of the average, not average entropy.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P54
noncomputable section
open scoped BigOperators Matrix ComplexConjugate ComplexOrder NNReal ENNReal
open MeasureTheory ProbabilityTheory
namespace QAlgorithms.Papers.Independent.Intakenext100.P54
open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)
open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)
open QAlgorithms.Papers.Independent.Dependency50.P07 (wordProb)
open QAlgorithms.Papers.Independent.Claimed50.P08 (classicalEntropy)
open QAlgorithms.Papers.Independent.Claimed50.P38 (tensorSuperop)
/-- Proposition 15, PDF pp.9–10: the optimal-cbit achievable corner retains Alice's
purification and consumes entropy of the AVERAGE Bob state in ebits. -/
theorem optimal_cbit_entangled_preparation {m a b : ℕ} (ha : 0 < a) (hb : 0 < b)
(E : BipartiteEnsemble m a b) :
BipartiteAchievable E (bobHolevo E) (bobAverageEntropy E) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P54
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , positive natural numbers , and ensemble of probabilities summing to and unit vectors , define , , by continuous functional calculus, , and . The theorem asserts and that, for every , there is a positive integer such that every admits positive integers , a natural number , matrices with for every length- word , and finite Kraus maps satisfying , such that
where and
The code may depend on , and the ensemble assumptions cannot hold when .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.