Guesswork of a Quantum Ensemble

DOI10.1109/TIT.2022.3146463MaRDI QIDQ5088453zbMATH OpenOpenAlexFDO

Authors Michele Dall'arno, Francesco Buscemi, Takeshi Koshiba

Publication date 13 July 2022

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2012.09350

zbMATH Keywords

analytical solutions of guesswork problemqubit ensemble with uniform probability distribution

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

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.

Recommendations

• Quantumness of quantum ensembles
• Quantifying the quantumness of an ensemble of quantum states
• scientific article
• Quantumness of ensembles via coherence
• Gaussian ensembles distributions from mixing quantum systems
• Approximation of quantum assemblages
• Guesswork With Quantum Side Information
• The quantum canonical ensemble
• Estimating the efficiency of ensemble quantum computing
• Estimation of Gaussian quantum states

Cited in

(3)

• scientific article; zbMATH DE number 5953468 (Why is no real title available?)
• ‘Lazy’ quantum ensembles
• How quantum is a quantum ensemble?

This page was built for publication: Guesswork of a Quantum Ensemble

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088453)