A Linear Programming Approach to Attainable Cramer-Rao type Bounds and Randomness Condition
classification
🪐 quant-ph
keywords
approachconditioncramer-raotypeboundlinearprogrammingattainable
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.