Example 6: depolarizing dilation subspaces have constant formation and cost
OpenQAlgorithms.Papers.Independent.Intakenext100.P60.depolarizing_constantLet and . Choose unitaries on with and . Put and for . Define the isometry
and its range . Let , , and , using . This is the minimum output entropy of the depolarizing channel.
Every density matrix supported on satisfies
For every positive integer , every convex mixture of product states on has formation . The tensor cut groups all output systems against all environment systems. Product factors may be mixed supported density matrices. This family gives explicitly computable entanglement costs.
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.10--11, Example 6: every supported state has the same cost and formation;
mixtures of n-fold product states have formation n times the same entropy. -/
theorem depolarizing_constant {d : ℕ} (D : DepolarizingData d) :
(∀ rho : Op (Fin d × Fin (d ^ 2)), IsDensityMatrix rho →
HasRangeIn (dilationSpace (depolarizingDilation D)) rho →
formationCostBits rho = depolarizingEntropyBits D ∧ formation rho = depolarizingEntropyBits D) ∧
(∀ n : ℕ, 0 < n → ∀ m : ℕ, ∀ mu : Fin m → ℝ,
(∀ j, 0 ≤ mu j) → (∑ j, mu j) = 1 →
∀ rho : Fin m → Fin n → Op (Fin d × Fin (d ^ 2)),
(∀ j i, IsDensityMatrix (rho j i)) →
(∀ j i, HasRangeIn (dilationSpace (depolarizingDilation D)) (rho j i)) →
formation (productMixture n m mu rho) = n * depolarizingEntropyBits 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 and let consist of , a real parameter , and matrices , , satisfying , , and . Define
and , where , , and . Every positive semidefinite trace-one matrix on whose every column belongs to satisfies both and . Moreover, for every integer , every , every with , and every family of positive semidefinite trace-one matrices on the same bipartite space whose columns all belong to , one has
Here is the real infimum of over all finite decompositions with , , and ; , , uses spectral functional calculus, and . The quantity is the real infimum of all such that, for every , there exist integers , , and a finite local protocol with and . Here , is the grouped -fold power of the projector onto , relabels both bases by their fixed finite enumerations, and grouped powers multiply one-copy entries and reindex strings through the fixed bijections to power-dimensional index sets. A finite local protocol is recursively built from identity maps and local finite Kraus families satisfying , with branch-dependent further protocols and a sum of unnormalized branch outputs. Formation permits and does not demand growing block lengths. In the second assertion is excluded, while is quantified over but cannot satisfy the unit-sum hypothesis; zero individual mixture weights and the endpoints of the parameter interval remain included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.