Conditional min-entropy bounds from classical branches
OpenQAlgorithms.Papers.Independent.Intakenext100.P63.classical_branches_minEntropyLet be a nonzero finite-dimensional space and let be finite and nonempty. Take a probability vector and normalized densities for every label, including zero-weight labels. Set . For , , and a set satisfying ,
Smoothing always ranges over normalized states within half trace-norm distance of the original state, and conditional min-entropy optimizes a normalized reference density. The retained set has positive probability and is nonempty. Radii at least one remain defined. These bounds pass uncertainty on individual retained branches to a classical conditioning register.
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, Remark 8: normalized classical branches, including zero-weight labels.
Smoothing uses half trace norm; the retained set has positive probability. -/
theorem classical_branches_minEntropy {A J : Type}
[Fintype A] [DecidableEq A] [Nonempty A]
[Fintype J] [DecidableEq J] [Nonempty J]
(q : J → ℝ) (hq : IsDistribution q) (rho : J → Mat A)
(hrho : ∀ j, IsDensityMatrix (rho j)) (eps delta : ℝ)
(he : 0 ≤ eps) (hd0 : 0 ≤ delta) (hd1 : delta < 1)
(T : Finset J) (hT : ∑ j ∈ Tᶜ, q j ≤ delta) :
(sInf (Set.range (fun j => stateMinBits (rho j))) ≤ conditionalMinBits (qcBranchDensity q rho)) ∧
(sInf {h | ∃ j ∈ T, h = traceSmoothStateMinBits eps (rho j)} ≤
traceSmoothConditionalMinBits (eps + delta) (qcBranchDensity q rho)) := 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 finite nonempty types with decidable equality, let be nonnegative with , and let every be a positive semidefinite complex matrix on with trace . Fix real numbers and , and a subset satisfying . Define the block diagonal density matrix
Write and
where acts on , the supremum is extended real, and the real conversion sends either infinity to . For either real-valued quantity , its trace-distance smoothing is , where ; denote these smoothings by and , respectively. Then
The first infimum includes branches with . The tail-mass hypothesis and force to be nonempty. There is no upper bound on or on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.