Quantum umlaut information
March 27, 2025 · Declared Dead · 🏛 arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Filippo Girardi, Aadil Oufkir, Bartosz Regula, Marco Tomamichel, Mario Berta, Ludovico Lami
arXiv ID
2503.21479
Category
quant-ph: Quantum Computing
Cross-listed
cs.IT,
math-ph
Citations
1
Venue
arXiv.org
Last Checked
5 months ago
Abstract
We study the quantum umlaut information, a correlation measure defined for bipartite quantum states $ρ_{AB}$ as a reversed variant of the quantum mutual information: $U(A;B)_ρ= \min_{σ_B} D(ρ_A\otimes σ_B\|ρ_{AB})$ in terms of the quantum relative entropy $D$. As in the classical case [Girardi et al., arXiv:2503.18910], this definition allows for a closed-form expression and has an operational interpretation as the asymptotic error exponent in the hypothesis testing task of deciding whether a given bipartite state is product or not. We generalise the umlaut information to quantum channels, where it also extends the notion of `oveloh information' [Nuradha et al., arXiv:2404.16101]. We prove that channel umlaut information is additive for classical-quantum channels, while we observe additivity violations for fully quantum channels. Inspired by recent results in entanglement theory, we then show as our main result that the regularised umlaut information constitutes a fundamental measure of the quality of classical information transmission over a quantum channel -- as opposed to the capacity, which quantifies the quantity of information that can be sent. This interpretation applies to coding assisted by activated non-signalling correlations, and the channel umlaut information is in general larger than the corresponding expression for unassisted communication as obtained by Dalai for the classical-quantum case [IEEE Trans. Inf. Theory 59, 8027 (2013)]. Combined with prior works on non-signalling--assisted zero-error channel capacities, our findings imply a dichotomy between the settings of zero-rate error exponents and zero-error communication. While our results are single-letter only for classical-quantum channels, we also give a single-letter bound for fully quantum channels in terms of the `geometric' version of umlaut information.
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