Theorem 1, quantum Chernoff bound (seed announced in abstract)
OpenQAlgorithms.Papers.Independent.Intakenext100.P45.quantumChernoffLet be density operators on a finite-dimensional complex Hilbert space, and let fixed priors sum to one. Let be the minimum weighted error over all joint binary effects on IID copies. Then the extended rate limit exists and
Natural logarithms are used and . This identifies the optimal symmetric testing exponent, including orthogonal states.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P45
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P45
open QAlgorithms Filter
open scoped Matrix ComplexConjugate ComplexOrder ENNReal BigOperators Topology
open QAlgorithms.Papers.Independent.Information100.P07
(support positivePart positiveProjection IsProjection)
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)
open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)
open QAlgorithms.Papers.Independent.Dependency50.P28 (logNonnegativeExtended relativeEntropy)
open QAlgorithms.Papers.Independent.Claimed50.P15 (positiveMatrixRpow)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
/-- arXiv:0708.4282v1, PDF pp.1,9,12,13: Theorem 1, quantum Chernoff bound (seed announced in abstract). -/
theorem quantumChernoff (rho sigma : Mat I)
(hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
(p0 p1 : ℝ) (h0 : 0 < p0) (h1 : 0 < p1) (hp : p0+p1=1) :
HasRate (fun k => helstromError (copies (k+1) rho) (copies (k+1) sigma) p0 p1)
(chernoffDistance rho sigma) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P45
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every finite type with decidable equality, complex matrices indexed by that are positive semidefinite and have complex trace equal to , and real numbers satisfying , define for and otherwise. Write , with the square root defined by continuous functional calculus, and let have entries given by the products of their corresponding matrix entries. The theorem asserts the following convergence in the extended reals:
The matrix powers apply the total real power function through continuous functional calculus; in particular, at exponent zero a zero eigenvalue contributes . Zero or negative arguments of give , so the corresponding negative logarithm is . Singular density matrices and are included; an empty cannot satisfy the trace-one hypotheses.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.