Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1805.09096 · IEEE Transactions on Information Theory

Distillation of Greenberger–Horne–Zeilinger States by Combinatorial Methods

Péter Vrana, Matthias Christandl

Published Apr 1, 2019• 6 citations
arXivHTMLPDF

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 LOCC (SLOCC), resulting in an asymptotically vanishing success probability. In contrast, our new protocol works with an asymptotically vanishing error.

DOI
10.1109/tit.2019.2908646

Related papers

Obtaining a W State from a Greenberger-Horne-Zeilinger State via Stochastic Local Operations and Classical Communication with a Rate Approaching Unity

Nengkun Yu, Cheng Guo, Runyao Duan

We introduce a notion of the entanglement transformation rate to characterize the asymptotic comparability of two multipartite pure entangled states under stochastic local operations and classical communication (SLOCC). For two well known SLOCC inequivalent three-qubit states |GHZ⟩=(1/2)(|000⟩+|111⟩) and |W⟩=(1/3)(|100⟩+|010⟩+|001⟩), we show that the entanglement transformation rate from |GHZ⟩ to |W⟩ is exactly 1. That means that we can obtain one copy of the W state from one copy of the Greenberg-Horne-Zeilinger (GHZ) state by SLOCC, asymptotically. We then apply similar techniques to obtain a lower bound on the entanglement transformation rates from an N-partite GHZ state to a class of Dicke states, and prove the tightness of this bound for some special cases which naturally generalize the |W⟩ state. A new lower bound on the tensor rank of the matrix permanent is also obtained by evaluating the tensor rank of Dicke states.

arXiv:1309.4833•Physical Review Letters•Apr 21, 2014•65 citations

Multi-User Distillation of Common Randomness and Entanglement From Quantum States

Farzin Salek, Andreas Winter

The tasks of converting noisy multipartite quantum correlations into noiseless classical and quantum ones using local operations and classical communications (LOCC) are studied. For the former, known as common randomness (CR) distillation, two novel lower bounds on the "distillable common randomness", an operational measure of the total genuine (classical) correlations in a quantum state, are obtained. Our proof relies on a generalization of communication for omniscience (CO) [Csiszár and Narayan, IEEE Trans. Inf. Theory 50: 3047-3061, 2004]. For the latter, we derive two lower bounds on the rate at which Greenberger-Horne-Zeilinger (GHZ) states can be asymptotically distilled from any given pure state under LOCC. Our approach consists in "making coherent" the proposed CR distillation protocols and recycling of resources [Devetak, Harrow and Winter, IEEE Trans. Inf. Theory 54:4587-4618, 2008]. The first lower bound is identical to a recent result by Vrana and Christandl [IEEE Trans. Inf. Theory 65:5945-5958, 2019], which is based on a combinatorial approach to achieve the same rate. Our second lower bound generalises and improves upon this result, and unifies a number of other known lower bounds on GHZ distillation. Full details in the long version [1].

arXiv:2008.04964•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2020•18 citations

Relation between the Greenberger-Horne-Zeilinger–entanglement cost of preparing a multipartite pure state and its quantum discord

Seung-Ho Yang, Hyunseok Jeong

We investigate how much amount of Greenberger-Horne-Zeilinger (GHZ) entanglement is required in order to prepare a given multipartite state by local operations and classical communication (LOCC). We present a LOCC procedure that asymptotically converts GHZ states into an arbitrary multipartite pure state, whose conversion rate is given by the multipartite discord of the state. This reveals that the GHZ-entanglement cost of preparing a pure state is not higher than the multipartite discord of the state. It also provides an operational interpretation of multipartite discord for pure states, namely, the consumption rate of GHZ entanglement in the devised procedure.

arXiv:1504.03604•Physical Review A•Aug 10, 2015•5 citations

Distillation of Secret Key and GHZ States from Multipartite Mixed States

Farzin Salek, Andreas Winter

We consider two related problems of extracting correlation from a given multipartite mixed quantum state: the first is the distillation of a conference key when the state is shared between a number of legal players and an eavesdropper; the eavesdropper, apart from starting off with this quantum side information, also observes the public communication between the players. The second is the distillation of Greenberger-Horne-Zeilinger (GHZ) states by means of LOCC from the given mixed state. These problem settings extend our previous paper [FS & AW, IEEE Trans. Inf. Theory 68(2):976-988, 2022], and we generalise its results: using a quantum version of the task of communication for omniscience, we derive a novel lower bound on the distillable secret key from any multipartite quantum state by means of a so-called non-interacting communication protocol. Secondly, by making the secret key distillation protocol coherent, we derive novel lower bounds on the distillation rate of GHZ states. Full details in the long version [1].

IEEE International Symposium on Information Theory (ISIT)•Jun 26, 2022•2 citations

Practical scheme for efficient distillation of GHZ states

Áron Rozgonyi, Gábor Széchenyi, Orsolya Kálmán +1 more

We develop an efficient local operation and classical communication (LOCC) scheme for the distillation of Greenberger-Horne-Zeilinger (GHZ) states from tripartite systems subjected to both coherent and incoherent errors. The proposed method employs an iterative process that applies a postselection-based non-linear transformation to increase the entanglement of 3-qubit states. In contrast to traditional distillation protocols that require an exponential number of initial states as a resource, our method achieves subexponential convergence towards a pure GHZ state. The proposed scheme is practical in the sense that it employs a small set of relatively simple unitary operations and projective measurements in the computational basis. We systematically develop a double-iteration protocol by providing a mathematical framework for the transformation processes involved, emphasizing the role of unitary operations in correcting arbitrary small errors in the initial states. Through analytical derivations and numerical simulations, we demonstrate the protocol's ability to progressively eliminate noise and improve fidelity over subsequent iterations. Significantly, our protocol not only corrects for small arbitrary distortions in the GHZ states but also maintains operational simplicity, making it feasible for practical quantum computing applications.

arXiv:2501.12268•Jan 21, 2025•0 citations

Distillable entanglement is continuous

Lukas Schmitt, David Sutter

We prove continuity of distillable entanglement, the optimal asymptotic rate at which copies of a bipartite state can be converted into maximally entangled pairs by local operations and classical communication (LOCC) with vanishing error. We establish an explicit asymptotic continuity bound that holds for arbitrary bipartite states and depends logarithmically on the system dimension. This bound has the same structure as known continuity bounds for conditional entropy, entanglement cost, and relative entropy of entanglement. Our proof constructs an explicit LOCC protocol that converts either of two arbitrary bipartite states into the other at an ebit cost that vanishes as their trace distance tends to zero.

quant-pharXiv:2610.35722•Oct 27, 2026•0 citations
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.
We introduce a notion of the entanglement transformation rate to characterize the asymptotic comparability of two multipartite pure entangled states under stochastic local operations and classical communication (SLOCC). For two well known SLOCC inequivalent three-qubit states |GHZ⟩=(1/2)(|000⟩+|111⟩) and |W⟩=(1/3)(|100⟩+|010⟩+|001⟩), we show that the entanglement transformation rate from |GHZ⟩ to |W⟩ is exactly 1. That means that we can obtain one copy of the W state from one copy of the Greenberg-Horne-Zeilinger (GHZ) state by SLOCC, asymptotically. We then apply similar techniques to obtain a lower bound on the entanglement transformation rates from an N-partite GHZ state to a class of Dicke states, and prove the tightness of this bound for some special cases which naturally generalize the |W⟩ state. A new lower bound on the tensor rank of the matrix permanent is also obtained by evaluating the tensor rank of Dicke states.
The tasks of converting noisy multipartite quantum correlations into noiseless classical and quantum ones using local operations and classical communications (LOCC) are studied. For the former, known as common randomness (CR) distillation, two novel lower bounds on the "distillable common randomness", an operational measure of the total genuine (classical) correlations in a quantum state, are obtained. Our proof relies on a generalization of communication for omniscience (CO) [Csiszár and Narayan, IEEE Trans. Inf. Theory 50: 3047-3061, 2004]. For the latter, we derive two lower bounds on the rate at which Greenberger-Horne-Zeilinger (GHZ) states can be asymptotically distilled from any given pure state under LOCC. Our approach consists in "making coherent" the proposed CR distillation protocols and recycling of resources [Devetak, Harrow and Winter, IEEE Trans. Inf. Theory 54:4587-4618, 2008]. The first lower bound is identical to a recent result by Vrana and Christandl [IEEE Trans. Inf. Theory 65:5945-5958, 2019], which is based on a combinatorial approach to achieve the same rate. Our second lower bound generalises and improves upon this result, and unifies a number of other known lower bounds on GHZ distillation. Full details in the long version [1].
We investigate how much amount of Greenberger-Horne-Zeilinger (GHZ) entanglement is required in order to prepare a given multipartite state by local operations and classical communication (LOCC). We present a LOCC procedure that asymptotically converts GHZ states into an arbitrary multipartite pure state, whose conversion rate is given by the multipartite discord of the state. This reveals that the GHZ-entanglement cost of preparing a pure state is not higher than the multipartite discord of the state. It also provides an operational interpretation of multipartite discord for pure states, namely, the consumption rate of GHZ entanglement in the devised procedure.
We consider two related problems of extracting correlation from a given multipartite mixed quantum state: the first is the distillation of a conference key when the state is shared between a number of legal players and an eavesdropper; the eavesdropper, apart from starting off with this quantum side information, also observes the public communication between the players. The second is the distillation of Greenberger-Horne-Zeilinger (GHZ) states by means of LOCC from the given mixed state. These problem settings extend our previous paper [FS & AW, IEEE Trans. Inf. Theory 68(2):976-988, 2022], and we generalise its results: using a quantum version of the task of communication for omniscience, we derive a novel lower bound on the distillable secret key from any multipartite quantum state by means of a so-called non-interacting communication protocol. Secondly, by making the secret key distillation protocol coherent, we derive novel lower bounds on the distillation rate of GHZ states. Full details in the long version [1].
We develop an efficient local operation and classical communication (LOCC) scheme for the distillation of Greenberger-Horne-Zeilinger (GHZ) states from tripartite systems subjected to both coherent and incoherent errors. The proposed method employs an iterative process that applies a postselection-based non-linear transformation to increase the entanglement of 3-qubit states. In contrast to traditional distillation protocols that require an exponential number of initial states as a resource, our method achieves subexponential convergence towards a pure GHZ state. The proposed scheme is practical in the sense that it employs a small set of relatively simple unitary operations and projective measurements in the computational basis. We systematically develop a double-iteration protocol by providing a mathematical framework for the transformation processes involved, emphasizing the role of unitary operations in correcting arbitrary small errors in the initial states. Through analytical derivations and numerical simulations, we demonstrate the protocol's ability to progressively eliminate noise and improve fidelity over subsequent iterations. Significantly, our protocol not only corrects for small arbitrary distortions in the GHZ states but also maintains operational simplicity, making it feasible for practical quantum computing applications.
We prove continuity of distillable entanglement, the optimal asymptotic rate at which copies of a bipartite state can be converted into maximally entangled pairs by local operations and classical communication (LOCC) with vanishing error. We establish an explicit asymptotic continuity bound that holds for arbitrary bipartite states and depends logarithmically on the system dimension. This bound has the same structure as known continuity bounds for conditional entropy, entanglement cost, and relative entropy of entanglement. Our proof constructs an explicit LOCC protocol that converts either of two arbitrary bipartite states into the other at an ebit cost that vanishes as their trace distance tends to zero.