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

Simple item page
dc.creatorHayashi, Masahito
dc.date1997-04-27
dc.date.accessioned2026-07-07T06:14:15Z
dc.date.available2026-07-07T06:14:15Z
dc.descriptionThe 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.
dc.descriptionLaTeX, 27 pages, submitted to Journal Mathematical Physics
dc.identifierhttps://arxiv.org/abs/quant-ph/9704044
dc.identifierhttp://arxiv.org/abs/quant-ph/9704044
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/93390
dc.subjectQuantum Physics
dc.titleA Linear Programming Approach to Attainable Cramer-Rao type Bounds and Randomness Condition
dc.typetext

Files

Collections

arXiv