Distillation of Greenberger-Horne-Zeilinger States by Combinatorial Methods
Publikation: Bidrag til tidsskrift › Tidsskriftartikel › fagfællebedømt
Dokumenter
- OA-Distillation of Greenberger-Horne-Zeilinger States by Combinatorial Methods
Accepteret manuskript, 455 KB, PDF-dokument
We prove a lower bound on the rate of Greenberger-Horne-Zeilinger states distillable from pure multipartite states by local operations and classical communication (LOCC). Our proof is based on a modification of a combinatorial argument used in the fast matrix multiplication algorithm of Coppersmith and Winograd. Previous use of methods from algebraic complexity in quantum information theory concerned transformations with stochastic LOCC (SLOCC), resulting in an asymptotically vanishing success probability. In contrast, our new protocol works with an asymptotically vanishing error.
Originalsprog | Engelsk |
---|---|
Tidsskrift | IEEE Transactions on Information Theory |
Vol/bind | 65 |
Udgave nummer | 9 |
Sider (fra-til) | 5945-5958 |
ISSN | 0018-9448 |
DOI | |
Status | Udgivet - 2019 |
Antal downloads er baseret på statistik fra Google Scholar og www.ku.dk
Ingen data tilgængelig
ID: 230842862