Uniform PGM success from a real Gram matrix
ProvedQAlgorithms.pgmSuccess_uniform_real_gramLet and be finite sets, and let for each . Suppose the Gram matrix is real: a real matrix satisfies after inclusion into . Write and give every vector weight . Then the pretty good measurement success quantity satisfies
Here denotes the th diagonal entry of the positive semidefinite matrix square root of . The inverse square root in the PGM definition is the spectral pseudoinverse, with value zero at the zero eigenvalue. This identity connects state identification to Gram matrix estimates and applies to the PAC and agnostic hard ensembles.
Formalization Note This is the uniform-prior, real-Gram specialization of the Gram identity in §7.3.2. The identity is homogeneous and therefore also applies to vectors without a unit-norm assumption. If is empty both sides are zero, with the convention .
import Definitions.Def_QAlgorithms_Defs_BooleanFourier set_option autoImplicit false open scoped BigOperators
theorem QAlgorithms.pgmSuccess_uniform_real_gram {O ι : Type*}
[Fintype O] [DecidableEq O] [Fintype ι] [DecidableEq ι]
(ψ : O → EuclideanSpace ℂ ι) (G : Matrix O O ℝ)
(hG : ∀ i j, inner ℂ (ψ i) (ψ j) = (G i j : ℂ)) :
QAlgorithms.pgmSuccess (fun _ : O => (Fintype.card O : ℝ)⁻¹) ψ =
(Fintype.card O : ℝ)⁻¹ * ∑ i, (QAlgorithms.psdSqrt G i i)^2 := by
sorry