Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 3139-3143 |
Number of pages | 5 |
Journal | IEEE Transactions on Information Theory |
Volume | 68 |
Issue number | 5 |
DOIs | |
Publication status | Published - 2022 May 1 |
Keywords
- Guesswork
- Quantum measurements
- Quantum state discrimination
- Quantum states
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences