Degradable channels, less noisy channels, and quantum statistical morphisms: an equivalence relation
November 28, 2015 Β· Declared Dead Β· π Problems of Information Transmission
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Francesco Buscemi
arXiv ID
1511.08893
Category
quant-ph: Quantum Computing
Cross-listed
cs.IT,
math.ST
Citations
37
Venue
Problems of Information Transmission
Last Checked
6 months ago
Abstract
Two partial orderings among communication channels, namely, `being degradable into' and `being less noisy than,' are reconsidered in the light of recent results about statistical comparisons of quantum channels. Though our analysis covers at once both classical and quantum channels, we also provide a separate treatment of classical noisy channels, and show how, in this case, an alternative self-contained proof can be constructed, with its own particular merits with respect to the general result.
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