A Linear Programming Approach to Attainable Cramér-Rao type Bounds and Randomness Condition II

2001/02/23 by Masahito Hayashi, Hayashi, Masahito
Engineering · Physics and Astronomy · #FOS: Physical sciences #Quantum Physics (quant-ph) #graph theory and CDMA systems #quant-ph

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

It is a corrected version of ``A Linear Programming Approach to Attainable Cramér-Rao type Bounds and Randomness Condition''e-print quant-ph/9704044, (1997)

arxiv created 2001/02/23 · openalex publication_date 2001/02/23 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The author studies the Cramér-Rao type bound by a linear programming approach. By this approach, he found a necessary and sufficient condition that the Cramér-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 Cramer-Rao type Bounds and Randomness Condition
• 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