§7: transitivity extends the conditional cost formula to every supported state
OpenQAlgorithms.Papers.Independent.Intakenext100.P60.transitive_costLet be a compact topological group with continuous unitary representations on a nonzero finite-dimensional space and on a nonzero finite-dimensional output space , both irreducible. Identify with the range of an isometry . Assume, for every and every operator on ,
Let , , , and , where is pure-state marginal entropy. An arbitrary ambient environment can be compressed to the finite component span without changing any supported state or entanglement value. The group action need not factor across the two parties.
Assume and that acts transitively on pure projectors on : for any unit vectors there is with . For every density matrix supported on ,
The transitivity condition concerns pure states up to global phase and leaves the zero vector outside its domain. It promotes the preceding orbit-mixture conclusion to all supported states.
Here is the infimum of average pure-state marginal entropy over normalized finite decompositions of the stated density matrix. is the asymptotic EPR preparation rate under deterministic two-way LOCC, and is the corresponding asymptotic distillation rate, in bits per copy. All entropies and logarithms are in bits.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P60
namespace QAlgorithms.Papers.Independent.Intakenext100.P60
open scoped Matrix ComplexConjugate ComplexOrder TensorProduct
noncomputable section
attribute [local instance] Classical.propDecidable Classical.decEq
-- Exact accepted matrix, normalized ensemble, convex roof, grouped copies and LOCC.
open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)
open QAlgorithms.Papers.Independent.Information100.P08 (PureEnsemble pureAverage formation)
open QAlgorithms.Papers.Independent.Information100.P80 (groupedPower)
open QAlgorithms.Papers.Independent.Gap48.P32 (twoWayDistillable)
/-- PDF p.12: transitivity extends (19) to every supported density matrix. The
projector cost premise is inherited from the preceding paragraph and retained. -/
theorem transitive_cost {G : Type*} [Group G] [TopologicalSpace G]
[IsTopologicalGroup G] [T2Space G] [CompactSpace G] {a b k : ℕ} (D : CovariantData G a b k)
(hcost : formationCostBits (projectorState D) = formation (projectorState D)) (htrans : PureTransitive D)
(rho : Op (Fin a × Fin b)) (hrho : IsDensityMatrix rho)
(hsupport : HasRangeIn (dilationSpace D.W) rho) :
formationCostBits rho = minimumEntanglement D ∧ formation rho = minimumEntanglement D := by sorry
end
end QAlgorithms.Papers.Independent.Intakenext100.P60
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a compact Hausdorff topological group and let comprise positive natural dimensions , an isometry , and entrywise continuous irreducible unitary representations on , respectively, satisfying for every ; irreducibility means that only zero and full complex subspaces are invariant. Define , with applied by continuous functional calculus, and let be the real infimum of over finite decompositions with , , and . Let be the real infimum of all real such that for every there exist natural numbers and a finite local protocol satisfying and , where projects onto , tensor powers are grouped by party using the fixed finite-basis relabelings in the definitions, zero copies give the scalar identity, and . These finite local protocols are generated from identities by finite local Kraus families satisfying , with branch-dependent finite continuations and summation over outcomes. Assume , and assume that for every unit some satisfies . For every positive semidefinite trace-one matrix on whose every column belongs to the complex linear span of the columns of , the theorem asserts
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.