A Linear Programming Approach to Attainable Cramér-Rao type Bounds and Randomness Condition II
Abstract
Description
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.
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)
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)