§3.2 (3.25): optimal equal-prior discrimination
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.helstromAll 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. Here is squared algebraic fidelity, is squared generalized fidelity, is purified distance, and .
For normalized ρ,τ, max_{effects M} (TrρM+Trτ(I−M))/2=(1+Δ(ρ,τ))/2, attained by a spectral projector.
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#3.helstrom
§3.2 (3.25): optimal equal-prior discrimination, arXiv:1504.00233v5, PDF p.43. -/
theorem helstrom [Nonempty I] (r s : paperMat I) (hr : IsDensityMatrix r) (hs : IsDensityMatrix s) :
(∃ M : paperMat I, IsEffect M ∧ ((r*M).trace.re+(s*(1-M)).trace.re)/2 = (1+paperDelta r s)/2) ∧
∀ M : paperMat I, IsEffect M → ((r*M).trace.re+(s*(1-M)).trace.re)/2 ≤ (1+paperDelta r s)/2 := 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 indexed by , each with trace . Define
There exists a matrix satisfying and such that
and every matrix satisfying these same two positivity conditions has the left-hand side at most .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.