A Linear Programming Approach to Attainable Cramér-Rao Type Bounds

Masahito Hayashi ()
Additional contact information
Masahito Hayashi: Kyoto University, Department of Mathematics

A chapter in Quantum Communication, Computing, and Measurement, 1997, pp 99-108 from Springer

Abstract: Abstract The author studies the relation between the attainable Cramér-Rao type bound and the duality theorem in the infinite dimensional linear programming. By this approach, the attainable Cramér-Rao type bound for a 3-parameter spin 1/2 model is explicitly derived.

Keywords: Density Operator; Random Measurement; Real Hilbert Space; Duality Theorem; Fisher Information Matrix (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4615-5923-8_11

Ordering information: This item can be ordered from
http://www.springer.com/9781461559238

DOI: 10.1007/978-1-4615-5923-8_11

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().