Distillation of Greenberger-Horne-Zeilinger states by combinatorial methods
arXiv:1805.09096 · doi:10.1109/TIT.2019.2908646
Abstract
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 local operations and classical operation (SLOCC), resulting in an asymptotically vanishing success probability. In contrast, our new protocol works with asymptotically vanishing error.
26 pages, 2 figures; v2: updated to match published version
References in corpus (7)
- Quantum information can be negative
- Leftover Hashing Against Quantum Side Information
- Entanglement of assistance and multipartite state distillation
- Tensor Rank and Stochastic Entanglement Catalysis for Multipartite Pure States
- Tripartite entanglement transformations and tensor rank
- Asymptotic tensor rank of graph tensors: beyond matrix multiplication
- On the entanglement concentration of three-partite states