Adversarial guesswork with quantum side information

June 22, 2023 Β· Declared Dead Β· πŸ› Quantum information & computation

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Baasanchimed Avirmed, Kaito Niinomi, Michele Dall'Arno arXiv ID 2306.12633 Category quant-ph: Quantum Computing Cross-listed cs.IT Citations 3 Venue Quantum information & computation Last Checked 5 months ago
Abstract
The guesswork of a classical-quantum channel quantifies the cost incurred in guessing the state transmitted by the channel when only one state can be queried at a time, maximized over any classical pre-processing and minimized over any quantum post-processing. For arbitrary-dimensional covariant classical-quantum channels, we prove the invariance of the optimal pre-processing and the covariance of the optimal post-processing. In the qubit case, we compute the optimal guesswork for the class of so-called highly symmetric informationally complete classical-quantum channels.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted