Example 7: direct-sum family with constant formation and cost in [3/2,log 3]
OpenQAlgorithms.Papers.Independent.Intakenext100.P60.example_seven_mixturesIn let be the span of the three unit vectors
The last environment indices are the ordinary integers .
Let and . Choose complex with , and let be the span of the coherent direct-sum vectors in . Put , , , and . Every density matrix supported on satisfies
The endpoints correspond respectively to the original subspace and the maximally entangled constant-channel branch. The explicit constant is the entropy of the printed channel's spectrum .
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.13, Example 7 continuation: the direct-sum family, including both pure
branches, has constant cost and formation with the printed closed interval of values. -/
theorem example_seven_mixtures (c s : ℂ) (hcs : Complex.normSq c + Complex.normSq s = 1)
(rho : Op (Fin 3 × (Fin 6 ⊕ (Fin 3 × Fin 3)))) (hrho : IsDensityMatrix rho)
(hsupport : HasRangeIn (dilationSpace (exampleSevenMixtureDilation c s)) rho) :
formationCostBits rho = exampleSevenMixtureEntropy c ∧ formation rho = exampleSevenMixtureEntropy c ∧
3 / 2 ≤ exampleSevenMixtureEntropy c ∧ exampleSevenMixtureEntropy c ≤ Real.logb 2 3 := by sorry
end
end QAlgorithms.Papers.Independent.Intakenext100.P60
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all complex numbers satisfying , and every positive semidefinite trace-one complex matrix on , with the second subsystem indexed by the disjoint union , suppose every column of belongs to the complex linear span of
where the kets are coordinate unit vectors. Then
where , , , and . The formation quantity is the infimum of over all finite decompositions with , , and ; here , counting eigenvalues with multiplicity and setting . The formation cost in bits is the infimum of real such that, for every , some natural numbers and a finite local-operation-and-classical-communication map obey and , where , is the projector onto , and tensor powers are grouped and relabelled using the fixed finite-index bijections. These finite maps are generated from identities by finite local Kraus families with , outcome-dependent continuation, and summation over branches. Only one suitable positive block length is required for each . The hypotheses include the endpoint cases and , and impose no additional rank restriction on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.