Proposition V.2: average monotonicity under LOCC
OpenQAlgorithms.Papers.Independent.Support50.P09.squashed_LOCC_averageFor a normalized state with finite nonzero local systems, define
Entropies are in bits. The infimum ranges over all normalized extensions and every positive finite dimension of , with no dimension bound or attainment assumption. One-party inputs use this same entropy expression and have value zero.
Let a finite adaptive LOCC protocol applied to have terminal normalized states and probabilities . Local dimensions may change with the branch, and classical transcripts may be forgotten. Then
Zero-probability branches use arbitrary normalized states with the subnormalized equation , without dividing by .
This retains the proposition’s average monotonicity, including selective and deterministic finite-round operations.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P09
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P09
open QAlgorithms.Papers.Independent.Claimed50.P33
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Proposition V.2, PDF pp.16–17: AVERAGE monotonicity for finite adaptive
LOCC, including branch-dependent dimensions and forgotten transcripts.
Zero-probability outcomes use subnormalized equations, not division by zero. -/
theorem squashed_LOCC_average {m : ℕ} (hm : 0 < m) :
IsAdaptiveLOCCMonotone (fun s : FiniteState m => halfExtensionSquashed .total s.rho) := by sorry
end QAlgorithms.Papers.Independent.Support50.P09
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive natural number , consider states consisting of positive integer local dimensions and a positive semidefinite matrix of trace . For any such -party density matrix, define
where ranges over positive integer environment dimensions, and for , with . For every initial state and every finite list of weighted output states obtainable by the following inductive rules, one has
The rules allow stopping with the single output ; applying a finite local instrument and then choosing a further such procedure separately for each outcome; and replacing an output list whose states all have the same local dimensions by its weighted mixture, with weight . A permitted local instrument has some party , finitely many outcomes , weights summing to , and density matrices ; all dimensions other than party 's agree with those of the input. Each outcome has a finite family of matrices from the input space of party to its output space. Writing for their action on party with identity action on every other party, they satisfy and . Branch weights multiply along successive instruments. The mixture rule requires equality of all matrix entries with the weighted sum. Zero-weight branches and are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.