Example 7: the displayed C3⊗C6 subspace has formation and cost 3/2
OpenQAlgorithms.Papers.Independent.Intakenext100.P60.example_sevenIn let be the span of the three unit vectors
The last environment indices are the ordinary integers .
Every density matrix supported on obeys
This worked deduction uses the Vidal--Dür--Cirac subspace [33] and Shor's entanglement-breaking channel additivity theorem [29].
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 pp.12--13, Example 7: every supported state has cost=formation=3/2 bits.
The subspace is credited to Vidal--Dur--Cirac [33], the capacity input to Shor [29]. -/
theorem example_seven (rho : Op (Fin 3 × Fin 6)) (hrho : IsDensityMatrix rho)
(hsupport : HasRangeIn (dilationSpace exampleSevenDilation) rho) :
formationCostBits rho = 3 / 2 ∧ formation rho = 3 / 2 := 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 every complex matrix on that is positive semidefinite with trace , suppose every column of belongs to the complex linear span of the three vectors
where each ket is a coordinate unit vector. Then both the formation cost in bits and the formation quantity equal . Here the formation quantity is the infimum of over all finite ensembles with , , , and , where , counting eigenvalues with multiplicity and taking . The formation cost in bits is the infimum over real such that, for every , there exist natural numbers , with , and a finite local-operation-and-classical-communication map satisfying
where and ; tensor copies are grouped by subsystem and relabelled by the fixed finite-index bijections in the definitions. Such finite maps are generated from identity maps by finite local Kraus families satisfying , followed by outcome-dependent maps of the same kind, with the resulting branches summed. The definition permits , meaning no singlets, and requires only one suitable positive block length for each pair . No rank condition on is imposed beyond the stated column-span condition.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.