1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1109/TIT.2011.2169544
DC FieldValue
dc.titleHow many copies are needed for state discrimination?
dc.contributor.authorHarrow, A.W.
dc.contributor.authorWinter, A.
dc.date.accessioned2014-11-28T05:02:53Z
dc.date.available2014-11-28T05:02:53Z
dc.date.issued2012-01
dc.identifier.citationHarrow, A.W., Winter, A. (2012-01). How many copies are needed for state discrimination?. IEEE Transactions on Information Theory 58 (1) : 1-2. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2011.2169544
dc.identifier.issn00189448
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/112566
dc.description.abstractA theorem has been proved to understand the fact that how many copies of the unknown quantum state does one need to be able to distinguish the coset state with high reliability. It is proved that for every distribution there exists a POVM attaining success probability. By using the game-theoretic trick, it has been proved that the existence of a measurement with worst-case.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/TIT.2011.2169544
dc.sourceScopus
dc.subjectPretty-good measurement
dc.subjectquantum detection
dc.subjectquantum state discrimination
dc.subjectworst-case minimum-error quantum detection
dc.typeOthers
dc.contributor.departmentCENTRE FOR QUANTUM TECHNOLOGIES
dc.description.doi10.1109/TIT.2011.2169544
dc.description.sourcetitleIEEE Transactions on Information Theory
dc.description.volume58
dc.description.issue1
dc.description.page1-2
dc.description.codenIETTA
dc.identifier.isiut000298989200001
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.