Details
| Original language | English |
|---|---|
| Title of host publication | 2022 IEEE International Symposium on Information Theory, ISIT 2022 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 2219-2224 |
| Number of pages | 6 |
| ISBN (electronic) | 9781665421591 |
| Publication status | Published - 2022 |
| Externally published | Yes |
| Event | 2022 IEEE International Symposium on Information Theory, ISIT 2022 - Espoo, Finland Duration: 26 Jun 2022 → 1 Jul 2022 |
Publication series
| Name | IEEE International Symposium on Information Theory - Proceedings |
|---|---|
| Volume | 2022-June |
| ISSN (Print) | 2157-8095 |
Abstract
Quantum capacities are fundamental quantities that are notoriously hard to compute and can exhibit surprising properties such as superadditivity. Thus a vast amount of literature is devoted to finding close and computable bounds on these capacities. We add a new viewpoint by giving operationally motivated bounds on several capacities, including the quantum capacity and private capacity of a channel and the one-way distillable entanglement and private key of a bipartite state. Our bounds themselves are generally given by certain capacities of the complementary channel or state. As a tool to obtain these bounds we discuss partial orders on quantum channels, such as the less noisy and the more capable order. Our bounds help to further understand the interplay between different capacities and give operational limitations on superadditivity properties and the difference between capacities. They can also be used as a new approach towards numerically bounding capacities, as discussed with some examples.
ASJC Scopus subject areas
- Mathematics(all)
- Theoretical Computer Science
- Computer Science(all)
- Information Systems
- Mathematics(all)
- Modelling and Simulation
- Mathematics(all)
- Applied Mathematics
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
2022 IEEE International Symposium on Information Theory, ISIT 2022. Institute of Electrical and Electronics Engineers Inc., 2022. p. 2219-2224 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2022-June).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - Bounding quantum capacities via partial orders and complementarity
AU - Hirche, Christoph
AU - Leditzky, Felix
N1 - Funding Information: This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreement No. H2020-MSCA-IF-2020-101025848.
PY - 2022
Y1 - 2022
N2 - Quantum capacities are fundamental quantities that are notoriously hard to compute and can exhibit surprising properties such as superadditivity. Thus a vast amount of literature is devoted to finding close and computable bounds on these capacities. We add a new viewpoint by giving operationally motivated bounds on several capacities, including the quantum capacity and private capacity of a channel and the one-way distillable entanglement and private key of a bipartite state. Our bounds themselves are generally given by certain capacities of the complementary channel or state. As a tool to obtain these bounds we discuss partial orders on quantum channels, such as the less noisy and the more capable order. Our bounds help to further understand the interplay between different capacities and give operational limitations on superadditivity properties and the difference between capacities. They can also be used as a new approach towards numerically bounding capacities, as discussed with some examples.
AB - Quantum capacities are fundamental quantities that are notoriously hard to compute and can exhibit surprising properties such as superadditivity. Thus a vast amount of literature is devoted to finding close and computable bounds on these capacities. We add a new viewpoint by giving operationally motivated bounds on several capacities, including the quantum capacity and private capacity of a channel and the one-way distillable entanglement and private key of a bipartite state. Our bounds themselves are generally given by certain capacities of the complementary channel or state. As a tool to obtain these bounds we discuss partial orders on quantum channels, such as the less noisy and the more capable order. Our bounds help to further understand the interplay between different capacities and give operational limitations on superadditivity properties and the difference between capacities. They can also be used as a new approach towards numerically bounding capacities, as discussed with some examples.
UR - http://www.scopus.com/inward/record.url?scp=85136291856&partnerID=8YFLogxK
U2 - 10.1109/ISIT50566.2022.9834698
DO - 10.1109/ISIT50566.2022.9834698
M3 - Conference contribution
AN - SCOPUS:85136291856
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2219
EP - 2224
BT - 2022 IEEE International Symposium on Information Theory, ISIT 2022
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2022 IEEE International Symposium on Information Theory, ISIT 2022
Y2 - 26 June 2022 through 1 July 2022
ER -