|
| related topics |
| {let, theorem, proof} |
| {information, entropy, channel} |
| {measurement, state, measurements} |
| {time, decoherence, evolution} |
|
A Linear Programming Approach to Attainable Cramer-Rao type Bounds and
Randomness Condition
Masahito Hayashi
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.
- oai_identifier:
- oai:arXiv.org:quant-ph/9704044
- categories:
- quant-ph
- comments:
- LaTeX, 27 pages, submitted to Journal Mathematical Physics
- arxiv_id:
- quant-ph/9704044
- created:
- 1997-04-27
Full article ▸
|
|
| related documents |
| 0605239v4 |
| 0410120v1 |
| 0410229v1 |
| 0405081v1 |
| 0503159v2 |
| 0307139v1 |
| 0605090v1 |
| 0212096v1 |
| 0701143v2 |
| 0308151v2 |
| 0512241v1 |
| 0401053v1 |
| 0610235v2 |
| 0003070v1 |
| 9711062v1 |
| 9503013v1 |
| 0308142v2 |
| 0702212v1 |
| 0206169v2 |
| 0105017v2 |
| 0101030v3 |
| 0701037v2 |
| 0309057v1 |
| 9912114v2 |
| 0012111v1 |
|