Upper bounds on the Holevo quantity arising from the fundamental entropic inequality
June 05, 2025 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
M. E. Shirokov
arXiv ID
2506.05335
Category
quant-ph: Quantum Computing
Cross-listed
cs.IT,
math-ph
Citations
0
Venue
arXiv.org
Last Checked
5 months ago
Abstract
We show how the fundamental entropic inequality proved recently in [arXiv:2408.15306] can be applied to obtain a useful relation for the Holevo quantity of discrete and continuous ensembles of quantum states. This relation gives a tight upper bound on the Holevo quantity of a given ensemble $ΞΌ$ expressed in terms of the Holevo quantities of two auxiliary ensembles $ΞΌ_+$ and $ΞΌ_-$ produced by $ΞΌ$. Among others, this implies quite accurate upper bounds on the Holevo quantity of a discrete ensemble of quantum states expressed via the probabilities and the metric characteristics of an ensemble.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Quantum Computing
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Quantum machine learning: a classical perspective
R.I.P.
π»
Ghosted
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
R.I.P.
π»
Ghosted
ProjectQ: An Open Source Software Framework for Quantum Computing
R.I.P.
π»
Ghosted
Quantum Recommendation Systems
R.I.P.
π»
Ghosted
Traffic flow optimization using a quantum annealer
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted