Details
| Originalsprache | Englisch |
|---|---|
| Titel des Sammelwerks | IEEE International Symposium on Information Theory |
| Untertitel | ISIT 2024 - Proceedings |
| Herausgeber (Verlag) | Institute of Electrical and Electronics Engineers Inc. |
| Seiten | 557-562 |
| Seitenumfang | 6 |
| ISBN (elektronisch) | 9798350382846 |
| ISBN (Print) | 979-8-3503-8285-3 |
| Publikationsstatus | Veröffentlicht - 7 Juli 2024 |
| Veranstaltung | 2024 IEEE International Symposium on Information Theory, ISIT 2024 - Athens, Griechenland Dauer: 7 Juli 2024 → 12 Juli 2024 |
Abstract
Contraction coefficients give a quantitative strengthening of the data processing inequality. As such, they have many natural applications whenever closer analysis of information processing is required. However, it is often challenging to calculate these coefficients. As a remedy we discuss a quantum generalization of Doeblin coefficients. These give an efficiently computable upper bound on many contraction coefficients. We prove several properties and discuss generalizations and applications. In particular, we give additional stronger bounds. One especially for PPT channels and one for general channels based on a constraint relaxation. Additionally, we introduce reverse Doeblin coefficients that bound certain expansion coefficients.
ASJC Scopus Sachgebiete
- Mathematik (insg.)
- Theoretische Informatik
- Informatik (insg.)
- Information systems
- Mathematik (insg.)
- Modellierung und Simulation
- Mathematik (insg.)
- Angewandte Mathematik
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
IEEE International Symposium on Information Theory: ISIT 2024 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2024. S. 557-562.
Publikation: Beitrag in Buch/Bericht/Sammelwerk/Konferenzband › Aufsatz in Konferenzband › Forschung › Peer-Review
}
TY - GEN
T1 - Quantum Doeblin coefficients
T2 - 2024 IEEE International Symposium on Information Theory, ISIT 2024
AU - Hirche, Christoph
N1 - Publisher Copyright: © 2024 IEEE.
PY - 2024/7/7
Y1 - 2024/7/7
N2 - Contraction coefficients give a quantitative strengthening of the data processing inequality. As such, they have many natural applications whenever closer analysis of information processing is required. However, it is often challenging to calculate these coefficients. As a remedy we discuss a quantum generalization of Doeblin coefficients. These give an efficiently computable upper bound on many contraction coefficients. We prove several properties and discuss generalizations and applications. In particular, we give additional stronger bounds. One especially for PPT channels and one for general channels based on a constraint relaxation. Additionally, we introduce reverse Doeblin coefficients that bound certain expansion coefficients.
AB - Contraction coefficients give a quantitative strengthening of the data processing inequality. As such, they have many natural applications whenever closer analysis of information processing is required. However, it is often challenging to calculate these coefficients. As a remedy we discuss a quantum generalization of Doeblin coefficients. These give an efficiently computable upper bound on many contraction coefficients. We prove several properties and discuss generalizations and applications. In particular, we give additional stronger bounds. One especially for PPT channels and one for general channels based on a constraint relaxation. Additionally, we introduce reverse Doeblin coefficients that bound certain expansion coefficients.
UR - http://www.scopus.com/inward/record.url?scp=85202883094&partnerID=8YFLogxK
U2 - 10.48550/arXiv.2405.00105
DO - 10.48550/arXiv.2405.00105
M3 - Conference contribution
AN - SCOPUS:85202883094
SN - 979-8-3503-8285-3
SP - 557
EP - 562
BT - IEEE International Symposium on Information Theory
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 7 July 2024 through 12 July 2024
ER -