§5: strong-superadditivity instances from depolarizing dilation subspaces
OpenQAlgorithms.Papers.Independent.Intakenext100.P60.depolarizing_superadditivityLet . For each take an Example 6 depolarizing dilation with dimension , parameter , identity-containing orthogonal unitary error basis, and actual Kraus-block range . The error basis obeys ; the weights are and for . Let be any unit vector in and let be its actual marginal on the th output-environment pair. Put , and . Then
The entanglement of the joint vector uses the cut of all outputs versus all environments. This is a special strong-superadditivity family, using King's cited minimum-output-entropy additivity result [21], rather than an assertion of the general conjecture.
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.8: strong superadditivity for pure states in a tensor product of the actual
Example 6 subspaces. King [21] supplies the cited minimum-output-entropy additivity input.
The middle sum is the explicit Smin spectrum from p.10; local marginals are constructed. -/
theorem depolarizing_superadditivity {n : ℕ} (hn : 0 < n) (d : Fin n → ℕ)
(D : ∀ i, DepolarizingData (d i))
(psi : EuclideanSpace ℂ ((∀ i, Fin (d i)) × (∀ i, Fin (d i ^ 2))))
(hpsi : ‖psi‖ = 1)
(hsupport : (fun q => psi q) ∈ dilationSpace (jointDepolarizing D)) :
(∑ i, depolarizingEntropyBits (D i)) ≤ pureEntropyBits psi ∧
(∑ i, depolarizingEntropyBits (D i)) =
∑ i, formation (pairMarginal (pureDensity psi) i) := 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 natural number, let for , and for every let consist of , a real parameter , and matrices , , satisfying , , and . Put
where and . Let be a complex Euclidean vector on the indexing space with , and assume its coordinate function belongs to the complex linear span of the columns of . For each , set , , and , using . Then
Here , , and
For any finite matrix , , where is applied through spectral functional calculus. For a bipartite matrix , is the real infimum of over all finite families with , , , and . The theorem excludes but includes all allowed parameter endpoints and any resulting zero weights.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.