Proposition 4: strict Holevo loss under partial trace, discrete and continuous cases
OpenQAlgorithms.Papers.Independent.Gap48.P45.partialTrace_strictHolevoLossAll physical Hilbert spaces are nonzero complex separable Hilbert spaces, with finite dimensions included. States are positive trace-class operators of trace one, channels are completely positive and trace preserving on the entire trace class, and logarithms are natural. Inner products are conjugate-linear in the first argument. Let and . For a discrete ensemble with faithful average and finite , assume a single finite integer bounds every constituent rank. For a generalized Borel ensemble with faithful average and finite , assume a single such finite bounds ranks on the entire topological support. Respectively,
These are two separate cases. The dimension is that of the discarded factor; when it is one, the rank hypotheses are impossible for normalized states.
This result gives strict information loss under a partial trace at a faithful ensemble average.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P45
noncomputable section
open Filter MeasureTheory
open scoped BigOperators ENNReal Topology
attribute [local instance] Classical.propDecidable Classical.decEq
attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus
namespace QAlgorithms.Papers.Independent.Gap48.P45
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsTraceClass IsTraceClassChannel traceSize traceClosure rankOne productCoeff tensorApply)
open QAlgorithms.Papers.Independent.Frontier18.P01 (Channel Complementary traceFirst traceSecond)
open QAlgorithms.Papers.Independent.Frontier18.P07
(GeneralizedEnsemble averageCoefficients extendedEntropyNats extendedRelativeEntropyNats ensembleHolevo pureStates finiteEnsembleCapacity)
open QAlgorithms.Papers.Independent.Frontier18.P18
(operatorCoeff boundedOperator conjugateCoeff ReversibleOn IsometricallyEquivalent
IsParsevalFrame IsKrausRepresentation)
open QAlgorithms.Papers.Independent.Claimed50.P16 (tensorRankLE)
open QAlgorithms.Papers.Independent.Next46.P31 (positiveSquareRoot)
open QAlgorithms.Papers.Independent.Next46.P42 (minimumOutputEntropy)
/-- Proposition 4, PDF p.22, BOTH A and B. The bound is uniformly finite and
uses the discarded E dimension; B imposes it on topological support. -/
theorem partialTrace_strictHolevoLoss
{B E : Type} [Countable B] [Countable E] [Nonempty B] [Nonempty E] :
(∀ e : DiscreteEnsemble (B × E), FullRank (discreteAverageCoefficients e) →
(∃ r : ℕ, (r : ℕ∞) < dimensionCount E ∧
∀ i, operatorRank (boundedOperator (e.state i).coefficients) ≤ r) →
discreteHolevo (id : Matrix (B × E) (B × E) ℂ → Matrix (B × E) (B × E) ℂ) e < ⊤ →
discreteHolevo (traceSecond (I := B) (J := E)) e <
discreteHolevo (id : Matrix (B × E) (B × E) ℂ → Matrix (B × E) (B × E) ℂ) e) ∧
(∀ mu : GeneralizedEnsemble (B × E), FullRank (averageCoefficients mu) →
(∃ r : ℕ, (r : ℕ∞) < dimensionCount E ∧
∀ rho ∈ (mu : Measure (State (B × E))).support,
operatorRank (boundedOperator rho.coefficients) ≤ r) →
ensembleHolevo (id : Matrix (B × E) (B × E) ℂ → Matrix (B × E) (B × E) ℂ) mu < ⊤ →
ensembleHolevo (traceSecond (I := B) (J := E)) mu <
ensembleHolevo (id : Matrix (B × E) (B × E) ℂ → Matrix (B × E) (B × E) ℂ) mu) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P45
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be countable, nonempty types and . A trace-class coefficient matrix admits with ; let be the infimum of these sums, with empty infimum . States additionally have real, nonnegative finite-coordinate quadratic forms and summable real diagonal of sum , and carry the topology generated by -balls and its Borel measurable structure. Let be a chosen bounded operator with coordinate matrix , or if none exists, and . Write for the algebraic dimension of its range, replacing any infinite value by , and for the cardinality of with the same convention. Call full rank when implies . Define the partial trace
For matrices on any relevant index type, define as the supremum over finite coordinate sets of
where and . The first assertion concerns every ensemble of states on , where and converges. Its average is the specified reconstructed matrix
and . If is full rank, there exists with and for every , and , then . The rank bound applies even at zero-weight indices. The second assertion concerns every Borel probability measure on states of , with coordinatewise average and . If is full rank, there exists with and for every , and , then . This rank bound is on the entire topological support. Neither part explicitly requires ; if is infinite, its dimensional inequality permits every finite .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.