IID ensemble uncertainty against collective measurements
OpenQAlgorithms.Papers.Independent.Intakenext100.P63.iid_collective_uncertaintyLet be a probability vector with , and let every be a normalized density on a nonzero finite-dimensional environment . Set and . View as a POVM on and let be its minimum output Shannon entropy there. Let be IID with law ; for any finite collective POVM on , define . For ,
For sufficiently large , uniformly over ,
All entropies are in bits; smoothing is over normalized joint densities at half trace-norm distance. The preparation labels are independent; Eve's measurement need not be a product measurement. Zero prior weights and rank-deficient average states remain allowed.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P63
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P63
open QAlgorithms Filter
open QAlgorithms.Papers.Independent.Information100.P63 (Mat)
open QAlgorithms.Papers.Independent.Information100.P04 (Measurement)
open QAlgorithms.Papers.Independent.Information100.P27 (shannon labelInformation)
open QAlgorithms.Papers.Independent.Information100.P71 (channelPower dilationMap SupportIncluded)
open QAlgorithms.Papers.Independent.Bridge50.P47 (SymmetricIndex universalSymmetricDilation)
open QAlgorithms.Learning (IsDistribution)
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.9, Corollary 9: IID labels and arbitrary collective environment POVMs.
The associated minimum is on supp(rho-bar); d counts labels, not Eve's outcomes. -/
theorem iid_collective_uncertainty {E : Type} [Fintype E] [DecidableEq E] [Nonempty E]
(d : ℕ) (hd : 0 < d) (p : Fin d → ℝ) (hp : IsDistribution p)
(rho : Fin d → Mat E) (hrho : ∀ i, IsDensityMatrix (rho i))
(eps : ℝ) (he0 : 0 < eps) (he1 : eps < 1) :
(∀ delta : ℝ, 0 < delta → delta < 1 → ∀ n : ℕ,
∀ Q : Measurement (Fin n → E),
(n : ℝ) * (associatedMinimum p rho - delta) -
16 * (Real.logb 2 d) ^ 2 / delta * Real.logb 2 (1 / eps) ≤
traceSmoothConditionalMinBits eps (classicalJoint (iidJoint p rho n Q))) ∧
(∃ n0 : ℕ, ∀ n ≥ n0, ∀ Q : Measurement (Fin n → E),
(n : ℝ) * associatedMinimum p rho -
8 * Real.logb 2 d * Real.sqrt ((n : ℝ) * Real.logb 2 (1 / eps)) ≤
traceSmoothConditionalMinBits eps (classicalJoint (iidJoint p rho n Q))) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P63
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite nonempty type with decidable equality, let be a natural number, let sum to , and let be positive semidefinite complex matrices on with trace . Fix . Set , for the continuous functional calculus function , with , and . Define
For a measurement on , having any positive finite number of positive semidefinite effects summing to the identity, define
and let be the diagonal matrix on with diagonal . For a matrix on a product , define as the real conversion of the extended real supremum of all for which some density matrix on satisfies , with either infinity converted to , and define
For every , every , and every such ,
Moreover, there exists such that for all and all such ,
Zero prior weights are permitted. The first bound includes , using singleton configuration spaces and empty products equal to ; has no stipulated lower bound.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.