A Linear Programming Approach to Attainable Cramer-Rao type Bounds and Randomness Condition

1997/04/27 by Masahito Hayashi, Hayashi, Masahito
Chemistry · Mathematics · Physics and Astronomy · #Advanced Mathematical Identities #FOS: Physical sciences #History and advancements in chemistry #Point processes and geometric inequalities #Quantum Physics (quant-ph) #quant-ph

paper · pdf · doi:10.48550/arxiv.quant-ph/9704044

LaTeX, 27 pages, submitted to Journal Mathematical Physics

arxiv created 1997/04/27 · openalex publication_date 1997/04/27 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The author studies the Cramer-Rao type bound by a linear programming approach. By this approach, he found a necessary and sufficient condition that the Cramer-Rao type bound is attained by a random measurement. In a spin 1/2 system, this condition is satisfied.

Related

• A Linear Programming Approach to Attainable Cramér-Rao type Bounds and Randomness Condition II
• Computing the Cramer-Rao bound of Markov random field parameters:\n Application to the Ising and the Potts models
• A geometer's view of the the Cramér-Rao bound on estimator variance
• A general method for lower bounds on fluctuations of random variables
• Cramér-Rao-type Bound and Stam's Inequality for Discrete Random Variables