A Linear Programming Approach to Attainable Cramér-Rao type Bounds and Randomness Condition II

Simple item page
dc.creatorHayashi, Masahito
dc.date2001-02-23
dc.date.accessioned2026-07-07T06:01:41Z
dc.date.available2026-07-07T06:01:41Z
dc.descriptionThe author studies the Cramér-Rao type bound by a linear programming approach. By this approach, he found a necessary and sufficient condition that the Cramér-Rao type bound is attained by a random measurement. In a spin 1/2 system, this condition is satisfied.
dc.descriptionIt is a corrected version of ``A Linear Programming Approach to Attainable Cramér-Rao type Bounds and Randomness Condition''e-print quant-ph/9704044, (1997)
dc.identifierhttps://arxiv.org/abs/quant-ph/0102120
dc.identifierhttp://arxiv.org/abs/quant-ph/0102120
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/89343
dc.subjectQuantum Physics
dc.titleA Linear Programming Approach to Attainable Cramér-Rao type Bounds and Randomness Condition II
dc.typetext

Files

Collections

arXiv