7.1
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.quantum_chernoffAll quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Tildes denote sandwiched Rényi quantities and bars denote Petz quantities. Their trace functionals are and ; the divergences include division by inside the logarithm. Matrix powers vanish on the kernel, including power zero. The notation means support inclusion. The upward conditional entropy optimizes the negative divergence over normalized reference states on the conditioning system; the downward entropy uses the actual marginal. The notation denotes conditional von Neumann entropy. In hypothesis testing, and , with . The value minimizes the first error subject to the second being at most .
For any two normalized states, lim_n −(1/n)log min_{0≤T≤I}(α_n(T;ρ)+β_n(T;σ))/2 = max_{0≤s≤1} −log Tr ρ^s σ^(1−s), with endpoint support projections and extended infinity when orthogonal.
This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
noncomputable section
open Filter
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P07
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J A B C D X Y Z : Type*}
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]
variable [Fintype Z] [DecidableEq Z]
/-- NODE paper:1504.00233#7.1
7.1, arXiv:1504.00233v5, PDF p.114. -/
theorem quantum_chernoff [Nonempty I] (r s : paperMat I) (hr : IsDensityMatrix r) (hs : IsDensityMatrix s) :
∃ a ∈ Set.Icc (0:ℝ) 1,
(∀ b ∈ Set.Icc (0:ℝ) 1, -paperLogE (paperRenyiQ false r s b) ≤ -paperLogE (paperRenyiQ false r s a)) ∧
Tendsto (fun n : ℕ => ((1/(n:ℝ):ℝ):EReal)*(-paperLogE (paperSymmetricError (paperTensorPower r n) (paperTensorPower s n))))
atTop (nhds (-paperLogE (paperRenyiQ false r s a))) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite nonempty index type with decidable equality, and let be positive semidefinite complex matrices on , each of trace one. For real , let denote functional calculus with the function zero at zero and elsewhere, so in particular vanishes on the kernel of . Define
where is extended real. For any two matrices of the same size, define
where this infimum is real-valued. Define tensor powers entrywise by for . There exists a real such that for every real , and
in the extended-real topology. The optimization includes both endpoint orders , with the specified zero-at-zero power convention; zero arguments of give after negation. The sequence is defined also at : its tensor powers use empty products and its real reciprocal is zero, with the resulting multiplication interpreted in the extended reals.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.