Details
Originalsprache | Englisch |
---|---|
Titel des Sammelwerks | 2014 IEEE International Symposium on Information Theory, ISIT 2014 |
Herausgeber (Verlag) | Institute of Electrical and Electronics Engineers Inc. |
Seiten | 536-540 |
Seitenumfang | 5 |
ISBN (Print) | 9781479951864 |
Publikationsstatus | Veröffentlicht - 2014 |
Veranstaltung | 2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, HI, USA / Vereinigte Staaten Dauer: 29 Juni 2014 → 4 Juli 2014 |
Publikationsreihe
Name | IEEE International Symposium on Information Theory - Proceedings |
---|---|
ISSN (Print) | 2157-8095 |
Abstract
Proving achievability of protocols in quantum Shannon theory usually does not consider the efficiency at which the goal of the protocol can be achieved. Nevertheless it is known that protocols such as coherent state merging are efficiently achievable at optimal rate.We aim to investigate this fact further in a general one-shot setting, by considering certain classes of decoupling theorems and give exact rates for these classes. Moreover we compare results of general decoupling theorems using Haar distributed unitaries with those using smaller sets of operators, in particular ε-approximate 2-designs. We also observe the behavior of our rates in special cases such as ε approaching zero and the asymptotic limit.
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
2014 IEEE International Symposium on Information Theory, ISIT 2014. Institute of Electrical and Electronics Engineers Inc., 2014. S. 536-540 6874890 (IEEE International Symposium on Information Theory - Proceedings).
Publikation: Beitrag in Buch/Bericht/Sammelwerk/Konferenzband › Aufsatz in Konferenzband › Forschung › Peer-Review
}
TY - GEN
T1 - Efficient achievability for quantum protocols using decoupling theorems
AU - Hirche, Christoph
AU - Morgan, Ciara
PY - 2014
Y1 - 2014
N2 - Proving achievability of protocols in quantum Shannon theory usually does not consider the efficiency at which the goal of the protocol can be achieved. Nevertheless it is known that protocols such as coherent state merging are efficiently achievable at optimal rate.We aim to investigate this fact further in a general one-shot setting, by considering certain classes of decoupling theorems and give exact rates for these classes. Moreover we compare results of general decoupling theorems using Haar distributed unitaries with those using smaller sets of operators, in particular ε-approximate 2-designs. We also observe the behavior of our rates in special cases such as ε approaching zero and the asymptotic limit.
AB - Proving achievability of protocols in quantum Shannon theory usually does not consider the efficiency at which the goal of the protocol can be achieved. Nevertheless it is known that protocols such as coherent state merging are efficiently achievable at optimal rate.We aim to investigate this fact further in a general one-shot setting, by considering certain classes of decoupling theorems and give exact rates for these classes. Moreover we compare results of general decoupling theorems using Haar distributed unitaries with those using smaller sets of operators, in particular ε-approximate 2-designs. We also observe the behavior of our rates in special cases such as ε approaching zero and the asymptotic limit.
UR - http://www.scopus.com/inward/record.url?scp=84906535764&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2014.6874890
DO - 10.1109/ISIT.2014.6874890
M3 - Conference contribution
AN - SCOPUS:84906535764
SN - 9781479951864
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 536
EP - 540
BT - 2014 IEEE International Symposium on Information Theory, ISIT 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2014 IEEE International Symposium on Information Theory, ISIT 2014
Y2 - 29 June 2014 through 4 July 2014
ER -