§4, equation (9): additivity implies a product optimal output
OpenQAlgorithms.Papers.Independent.Intakenext100.P60.optimal_output_productLet and be trace-preserving completely positive channels with arbitrary Hilbert input spaces and finite positive-dimensional output spaces. Suppose
For any normalized finite pure ensembles attaining these three Holevo suprema, denote their average output density matrices by , and , respectively. The joint channel is the actual tensor channel on the completed Hilbert tensor product, allowing entangled inputs of arbitrary Schmidt rank. Then
This is a consequence of the stated additivity premise, with attainment assumed only for the three ensembles being compared.
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.6, (9): conditional on capacity additivity, any three attaining ensembles
have the stated product output. The joint channel and all its entangled inputs are
constructed using the completed Hilbert tensor product. -/
theorem optimal_output_product {H K : Type*} [NormedAddCommGroup H]
[InnerProductSpace ℂ H] [CompleteSpace H] [NormedAddCommGroup K]
[InnerProductSpace ℂ K] [CompleteSpace K] {d e : ℕ} (hd : 0 < d) (he : 0 < e)
(T : FiniteOutputDualChannel H d) (S : FiniteOutputDualChannel K e)
(hadd : signalCapacity (tensorDualOutput T S) =
signalCapacity (pureOutput T) + signalCapacity (pureOutput S))
(a : SignalEnsemble H) (b : SignalEnsemble K)
(c : SignalEnsemble (UniformSpace.Completion (H ⊗[ℂ] K)))
(ha : signalHolevo (pureOutput T) a = signalCapacity (pureOutput T))
(hb : signalHolevo (pureOutput S) b = signalCapacity (pureOutput S))
(hc : signalHolevo (tensorDualOutput T S) c = signalCapacity (tensorDualOutput T S)) :
signalBarycenter (tensorDualOutput T S) c =
Matrix.kronecker (signalBarycenter (pureOutput T) a) (signalBarycenter (pureOutput S) b) := 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 complete complex inner product spaces with their normed additive group structures, and let be natural numbers. Let and be complex linear and unital, each satisfying , or its counterpart, for every finite positive semidefinite block matrix and every corresponding family of vectors. Define
and, on the completion of , define
where the hat denotes continuous extension to the completion. For any of these output functions , a signal ensemble consists of finitely many unit vectors with nonnegative real weights summing to ; its average output is , its value is , and its capacity is the real supremum of these values, with defined by continuous functional calculus. Assume . For every ensemble on , ensemble on , and ensemble on the completed tensor product satisfying , , and , the theorem asserts
Zero ensemble weights are permitted; the existence of these ensembles requires unit vectors in their respective spaces.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.