Distillation of Greenberger-Horne-Zeilinger States by Combinatorial Methods

Research output: Contribution to journalJournal articleResearchpeer-review


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.
Original languageEnglish
JournalIEEE Transactions on Information Theory
Issue number9
Pages (from-to)5945-5958
Publication statusPublished - 2019

    Research areas

  • Quantum entanglement, local operations and classical communication, multipartite entanglement distillation

Number of downloads are based on statistics from Google Scholar and www.ku.dk

No data available

ID: 230842862