Operational formation and distillation measures
OpenQAlgorithms.Papers.Independent.Support50.P42.mixed_operational_measuresFor a normalized density on positive finite local dimensions, let be the infimum of nonnegative eventual singlet-consumption rates for preparing by local protocols with vanishing global error. Let be the supremum of eventual singlet-production rates from with the same global accuracy convention. Formation rates form a nonempty set bounded below, zero distillation is feasible, and distillation rates are bounded above. For pure inputs and local output ensembles,
The expectation inequalities hold for finite adaptive local protocols, including mixed output branches. This uses the paper's operational formation measure, not the later single-copy convex roof; no mixed-state reversibility is claimed.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P42
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P42
open scoped BigOperators Matrix ComplexConjugate
open MeasureTheory ProbabilityTheory
attribute [local instance] Classical.propDecidable Classical.decEq
-- Reuse the exact accepted objects, without introducing same-name aliases.
open Information100.P21 (Op Vec FiniteLOCC)
open Dependency50.P42 (dimensionedPower singlets)
open Dependency50.P48 (pureFidelity)
open Gap48.P32 (pairOfState)
open Next46.P39 (rectAct)
/-- PDF p.17: operational formation and distillation reduce to pure-state
entropy and cannot increase in expectation under local protocols. Feasibility
and boundedness guards are conclusions, never optimizer hypotheses. -/
theorem mixed_operational_measures :
(∀ s : Shared, {R | FormationRate s R}.Nonempty ∧ BddBelow {R | FormationRate s R} ∧
SingletDistillationRate s 0 ∧ BddAbove {R | SingletDistillationRate s R} ∧
(IsPureShared s → formationCost s=ent s ∧ singletDistillable s=ent s)) ∧
(∀ (s : Shared) (out : List (ℝ × Shared)), LocalTree s out →
(out.map fun w => w.1*formationCost w.2).sum ≤ formationCost s ∧
(out.map fun w => w.1*singletDistillable w.2).sum ≤ singletDistillable s) := by sorry
end QAlgorithms.Papers.Independent.Support50.P42
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For a bipartite state with positive finite local dimensions and positive semidefinite trace-one matrix , let , where , with zero eigenvalues contributing zero. Define its formation-rate set to consist of real such that, for every , all sufficiently large natural admit a natural and a finite recursive LOCC map with
define its singlet-distillation-rate set to consist of real such that, for every , all sufficiently large admit a natural and finite recursive LOCC with
Here is the reindexed -fold tensor power of the antisymmetric singlet projector, , is the reindexed tensor power using the fixed local string-to-index equivalences, and . Write for the real infimum of the formation-rate set and for the real supremum of the distillation-rate set. For every , the formation-rate set is nonempty and bounded below, zero is a singlet-distillation rate, and the distillation-rate set is bounded above; if for a unit vector , then . Moreover, for every and every finite weighted state list obtainable by the recursive local-instrument rules,
In these definitions, finite LOCC maps are generated by identities and complete finite local Kraus measurements with outcome-dependent recursive continuations. The weighted-list rules start with , branch using a local instrument whose nonnegative outcome weights sum to one and whose weighted output states equal its Kraus branches, and allow replacing a list of states with common dimensions by their weighted mixture; subsequent branch weights multiply. No purity assumption is imposed on states in the last two inequalities, and the sums count list entries with their multiplicities.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.