  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.
