A Linear Programming Approach to Attainable Cramer-Rao type Bounds and Randomness Condition
Quantum Physics
2007-05-23 v1
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.
Cite
@article{arxiv.quant-ph/9704044,
title = {A Linear Programming Approach to Attainable Cramer-Rao type Bounds and Randomness Condition},
author = {Masahito Hayashi},
journal= {arXiv preprint arXiv:quant-ph/9704044},
year = {2007}
}
Comments
LaTeX, 27 pages, submitted to Journal Mathematical Physics