Tight uniform continuity bound for a family of entropies
July 13, 2017 · Declared Dead · 🏛 arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Eric P. Hanson, Nilanjana Datta
arXiv ID
1707.04249
Category
quant-ph: Quantum Computing
Cross-listed
cs.IT,
math-ph
Citations
14
Venue
arXiv.org
Last Checked
5 months ago
Abstract
We prove a tight uniform continuity bound for a family of entropies which includes the von Neumann entropy, the Tsallis entropy and the $α$-Rényi entropy, $S_α$, for $α\in (0,1)$. We establish necessary and sufficient conditions for equality in the continuity bound and prove that these conditions are the same for every member of the family. Our result builds on recent work in which we constructed a state which was majorized by every state in a neighbourhood ($\varepsilon$-ball) of a given state, and thus was the minimal state in majorization order in the $\varepsilon$-ball. This minimal state satisfies a particular semigroup property, which we exploit to prove our bound.
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