Guesswork of a Quantum Ensemble

The guesswork of a quantum ensemble quantifies the minimum number of guesses needed in average to correctly guess the state of the ensemble, when only one state can be queried at a time. Here, we derive analytical solutions of the guesswork problem subject to a finite set of conditions, including th...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on information theory Vol. 68; no. 5; pp. 3139 - 3143
Main Authors Dall'Arno, Michele, Buscemi, Francesco, Koshiba, Takeshi
Format Journal Article
LanguageEnglish
Published New York IEEE 01.05.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Exact solutions
Guesswork
Informatics
Licenses
Probability distribution
Q measurement
quantum measurements
quantum state discrimination
quantum states
Qubit
Qubits (quantum computing)
Online AccessGet full text

Cover

More Information
Summary:The guesswork of a quantum ensemble quantifies the minimum number of guesses needed in average to correctly guess the state of the ensemble, when only one state can be queried at a time. Here, we derive analytical solutions of the guesswork problem subject to a finite set of conditions, including the analytical solution for any qubit ensemble with uniform probability distribution. As explicit examples, we compute the guesswork for any qubit regular polygonal and polyhedral ensemble.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2022.3146463