dorsal/arxiv
View SchemaA Linear Programming Approach to Attainable Cramer-Rao type Bounds and Randomness Condition
| Authors | Masahito Hayashi |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9704044 |
| URL | https://arxiv.org/abs/quant-ph/9704044 |
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.
{
"annotation_id": "dcf97420-0587-4b2f-814a-f5e3a8d74fb1",
"date_created": "2026-03-02T18:02:40.784000Z",
"date_modified": "2026-03-02T18:02:40.784000Z",
"file_hash": "17b1885cc07a42a0f58bf8aebfbb916565b104907b902b97ff0eebfeb20141fb",
"private": false,
"record": {
"abstract": "The author studies the Cramer-Rao type bound by a linear programming\napproach. By this approach, he found a necessary and sufficient condition that\nthe Cramer-Rao type bound is attained by a random measurement. In a spin 1/2\nsystem, this condition is satisfied.",
"arxiv_id": "quant-ph/9704044",
"authors": [
"Masahito Hayashi"
],
"categories": [
"quant-ph"
],
"title": "A Linear Programming Approach to Attainable Cramer-Rao type Bounds and Randomness Condition",
"url": "https://arxiv.org/abs/quant-ph/9704044"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "3c2927a9-2941-4df9-a14d-d0ee9abc5904",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}