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

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

1997-04-27

arxiv.org/abs/quant-ph/9704044v1

Physics

Quantum Physics

LaTeX, 27 pages, submitted to Journal Mathematical Physics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Linear Programming Approach to Attainable Cramer-Rao type Bounds and Randomness Condition does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Linear Programming Approach to Attainable Cramer-Rao type Bounds and Randomness Condition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Linear Programming Approach to Attainable Cramer-Rao type Bounds and Randomness Condition will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-293126