Details
| Originalsprache | Englisch |
|---|---|
| Titel des Sammelwerks | 10th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2015 |
| Herausgeber/-innen | Salman Beigi, Robert Konig |
| Herausgeber (Verlag) | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
| Seiten | 191-205 |
| Seitenumfang | 15 |
| ISBN (elektronisch) | 9783939897965 |
| Publikationsstatus | Veröffentlicht - 1 Nov. 2015 |
| Extern publiziert | Ja |
| Veranstaltung | 10th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2015 - Brussels, Belgien Dauer: 20 Mai 2015 → 22 Mai 2015 |
Publikationsreihe
| Name | Leibniz International Proceedings in Informatics, LIPIcs |
|---|---|
| Band | 44 |
| ISSN (Print) | 1868-8969 |
Abstract
Unitary 2-designs are random unitary matrices which, in contrast to their Haar-distributed counterparts, have been shown to be efficiently realized by quantum circuits. Most notably, unitary 2-designs are known to achieve decoupling, a fundamental primitive of paramount importance in quantum Shannon theory. Here we prove that unitary 2-designs can be implemented approximately using random diagonal-unitaries.
ASJC Scopus Sachgebiete
- Informatik (insg.)
- Software
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
10th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2015. Hrsg. / Salman Beigi; Robert Konig. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2015. S. 191-205 (Leibniz International Proceedings in Informatics, LIPIcs; Band 44).
Publikation: Beitrag in Buch/Bericht/Sammelwerk/Konferenzband › Aufsatz in Konferenzband › Forschung › Peer-Review
}
TY - GEN
T1 - Implementing unitary 2-designs using random diagonal-unitary matrices
AU - Nakata, Yoshifumi
AU - Hirche, Christoph
AU - Morgan, Ciara
AU - Winter, Andreas
PY - 2015/11/1
Y1 - 2015/11/1
N2 - Unitary 2-designs are random unitary matrices which, in contrast to their Haar-distributed counterparts, have been shown to be efficiently realized by quantum circuits. Most notably, unitary 2-designs are known to achieve decoupling, a fundamental primitive of paramount importance in quantum Shannon theory. Here we prove that unitary 2-designs can be implemented approximately using random diagonal-unitaries.
AB - Unitary 2-designs are random unitary matrices which, in contrast to their Haar-distributed counterparts, have been shown to be efficiently realized by quantum circuits. Most notably, unitary 2-designs are known to achieve decoupling, a fundamental primitive of paramount importance in quantum Shannon theory. Here we prove that unitary 2-designs can be implemented approximately using random diagonal-unitaries.
KW - Commuting quantum circuits
KW - Unitary 2-designs
UR - http://www.scopus.com/inward/record.url?scp=84959059745&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.TQC.2015.191
DO - 10.4230/LIPIcs.TQC.2015.191
M3 - Conference contribution
AN - SCOPUS:84959059745
T3 - Leibniz International Proceedings in Informatics, LIPIcs
SP - 191
EP - 205
BT - 10th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2015
A2 - Beigi, Salman
A2 - Konig, Robert
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 10th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2015
Y2 - 20 May 2015 through 22 May 2015
ER -