TY - JOUR
T1 - Guesswork of a Quantum Ensemble
AU - Dall'arno, Michele
AU - Buscemi, Francesco
AU - Koshiba, Takeshi
N1 - Publisher Copyright:
© 1963-2012 IEEE.
PY - 2022/5/1
Y1 - 2022/5/1
N2 - 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.
AB - 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.
KW - Guesswork
KW - Quantum measurements
KW - Quantum state discrimination
KW - Quantum states
UR - http://www.scopus.com/inward/record.url?scp=85123712847&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85123712847&partnerID=8YFLogxK
U2 - 10.1109/TIT.2022.3146463
DO - 10.1109/TIT.2022.3146463
M3 - Article
AN - SCOPUS:85123712847
SN - 0018-9448
VL - 68
SP - 3139
EP - 3143
JO - IRE Professional Group on Information Theory
JF - IRE Professional Group on Information Theory
IS - 5
ER -