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

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.

LaTeX, 27 pages, submitted to Journal Mathematical Physics

Cited by in corpus (2)

• A perspective on multiparameter quantum metrology: from theoretical tools to applications in quantum imaging
• Tight Cramér-Rao type bounds for multiparameter quantum metrology through conic programming