# Classical computation of quantum guesswork

@article{DallArno2021ClassicalCO, title={Classical computation of quantum guesswork}, author={Michele Dall’Arno and Francesco Buscemi and Takeshi Koshiba}, journal={ArXiv}, year={2021}, volume={abs/2112.01666} }

The guesswork quantifies the minimum number of queries needed to guess the state of a quantum ensemble if one is allowed to query only one state at a time. Previous approaches to the computation of the guesswork were based on standard semi-definite programming techniques and therefore lead to approximated results. In contrast, our main result is an algorithm that, upon the input of any qubit ensemble over a discrete ring and with uniform probability distribution, after finitely many steps…

## References

SHOWING 1-10 OF 24 REFERENCES

Minimum guesswork discrimination between quantum states

- Computer ScienceQuantum Inf. Comput.
- 2015

This work takes Massey's guesswork as the underlying optimization criterion and studies the problem of minimum guesswork discrimination in discriminating non-orthogonal quantum states, and gives the necessary and sufficient condition under which making no measurement at all would be the optimal strategy.

Guesswork, Large Deviations, and Shannon Entropy

- Computer ScienceIEEE Transactions on Information Theory
- 2013

It is shown that, when appropriately scaled, as the password length grows, the logarithm of the guesswork satisfies a large deviation principle (LDP), providing direct estimates of the Guesswork distribution when passwords are long.

Guessing Subject to Distortion

- Computer ScienceIEEE Trans. Inf. Theory
- 1998

This work investigates the problem of guessing a random vector X within distortion level D and proposes an asymptotically optimal guessing scheme that is universal both with respect to the information source and the value of /spl rho/.

Improved Bounds on Lossless Source Coding and Guessing Moments via Rényi Measures

- Computer ScienceIEEE Transactions on Information Theory
- 2018

Upper and lower bounds on the optimal guessing moments of a random variable taking values on a finite set when side information may be available are provided, similar to Arikan’s bounds, but expressed in terms of the Arimoto-Rényi conditional entropy.

Guessing Revisited: A Large Deviations Approach

- MathematicsIEEE Transactions on Information Theory
- 2011

If the sequence of distributions of the information spectrum satisfies the large deviation property with a certain rate function, then the limiting guessing exponent exists and is a scalar multiple of the Legendre-Fenchel dual of the rate function.

Tight Bounds on the Rényi Entropy via Majorization with Applications to Guessing and Compression

- Computer ScienceEntropy
- 2018

A tight lower bound on the Rényi entropy of a discrete random variable with a finite support is derived as a function of the size of the support, and the ratio of the maximal to minimal probability masses.

Guessing and entropy

- Computer Science, MathematicsProceedings of 1994 IEEE International Symposium on Information Theory
- 1994

It is shown that the average number of successive guesses, E[G], required with an optimum strategy until one correctly guesses the value of a discrete random X, is underbounded by the entropy H(X) in…

Guessing Under Source Uncertainty

- Computer ScienceIEEE Transactions on Information Theory
- 2006

This paper considers the problem of guessing the realization of a finite alphabet source when some side information is provided and determines the min-sup value, which measures the richness of the uncertainty set.

An inequality on guessing and its application to sequential decoding

- Computer ScienceIEEE Trans. Inf. Theory
- 1996

The present approach enables the determination of the cutoff rate of sequential decoding in a simple manner and yields the (previously unknown) cutoff rate region of sequential decode for multiaccess channels.

Joint Source-Channel Coding and Guessing with Application to Sequential Decoding

- Computer ScienceIEEE Trans. Inf. Theory
- 1998

Using the close relationship between guessing and sequential decoding, a tight lower bound is given to the complexity of sequential decoding in joint source-channel coding systems, complementing earlier works by Koshelev and Hellman.