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:1107.4863 · Physical Review A

Multiparticle entanglement in graph-diagonal states: Necessary and sufficient conditions for four qubits

Otfried Gühne, Bastian Jungnitsch, Tobias Moroder, Yaakov S. Weinstein

Published Nov 18, 2011• 28 citations
arXivHTMLPDF

Abstract

The characterization of genuine multiparticle entanglement is important for entanglement theory as well as experimental studies related to quantum-information theory. Here, we completely characterize genuine multiparticle entanglement for four-qubit states diagonal in the cluster-state basis. In addition, we give a complete characterization of multiparticle entanglement for all five-qubit graph states mixed with white noise, for states diagonal in the basis corresponding to the five-qubit $\mathsf{Y}$-shaped graph, and for a family of graph states with an arbitrary number of qubits.

DOI
10.1103/physreva.84.052319

Related papers

Genuine entanglement of four-qubit cluster diagonal states

Xiaoyu Chen, Ping Yu, Li-zhen Jiang +1 more

We reduce the necessary and sufficient biseparable conditions of four-qubit cluster diagonal states to concise forms. Only 4 out of the 15 parameters are proved to be relevant in specifying the genuine entanglement of the states. Using the relative entropy of entanglement as entanglement measure, we analytically find the genuine entanglement of all the four-qubit cluster diagonal states. The formulas for the genuine entanglement are of five kinds, for seven different parameter regions of genuinely entangled states.

arXiv:1204.5512•Physical Review A•Jan 22, 2013•8 citations

Separability criteria for genuine multiparticle entanglement

Otfried Gühne, Michael Seevinck

We present a method to derive separability criteria for different classes of multiparticle entanglement, especially genuine multiparticle entanglement. The resulting criteria are necessary and sufficient for certain families of states. This, for example, completely solves the problem of classifying N -qubit Greenberger–Horne–Zeilinger states mixed with white noise according to their separability and entanglement properties. Further, the criteria are superior to all known entanglement criteria for many other families; also they allow the detection of bound entanglement. We next demonstrate that they are easily implementable in experiments and discuss applications to the decoherence of multiparticle entangled states.

arXiv:0905.1349•New Journal of Physics•May 5, 2010•317 citations

Multiparty entanglement in graph states

M. Hein, Jens Eisert, Hans J. Briegel

Graph states are multiparticle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of distributed quantum systems that play a significant role in quantum error correction, multiparty quantum communication, and quantum computation within the framework of the one-way quantum computer. We characterize and quantify the genuine multiparticle entanglement of such graph states in terms of the Schmidt measure, to which we provide upper and lower bounds in graph theoretical terms. Several examples and classes of graphs will be discussed, where these bounds coincide. These examples include trees, cluster states of different dimensions, graphs that occur in quantum error correction, such as the concatenated [7,1,3]-CSS code, and a graph associated with the quantum Fourier transform in the one-way computer. We also present general transformation rules for graphs when local Pauli measurements are applied, and give criteria for the equivalence of two graphs up to local unitary transformations, employing the stabilizer formalism. For graphs of up to seven vertices we provide complete characterization modulo local unitary transformations and graph isomorphisms.

arXiv:quant-ph/0307130•Physical Review A•Jun 9, 2004•1,035 citations

Entanglement witnesses for graph states: General theory and examples

Bastian Jungnitsch, Tobias Moroder, Otfried Gühne

We present a general theory for the construction of witnesses that detect genuine multipartite entanglement in graph states. First, we present explicit witnesses for all graph states of up to six qubits which are better than all criteria so far. Therefore, lower fidelities are required in experiments that aim at the preparation of graph states. Building on these results, we develop analytical methods to construct two different types of entanglement witnesses for general graph states. For many classes of states, these operators exhibit white noise tolerances that converge to 1 when increasing the number of particles. We illustrate our approach for states such as the linear and the 2D cluster state. Finally, we study an entanglement monotone motivated by our approach for graph states.

arXiv:1106.1114•Physical Review A•Sep 8, 2011•81 citations

Criteria for Genuine Multiparticle Quantum Correlations

Bastian Jungnitsch

Entanglement is deemed a valuable resource for quantum computing and lies at the heart of quantum information. At the same time, current experiments are venturing into the realm of quantum systems consisting of many particles. In this book, different aspects of entanglement and non-locality in multiparticle systems are investigated. First, it presents an approach for an experimental verification of non-locality and entanglement with a high statistical significance. Second, a criterion for genuine multiparticle entanglement is introduced. Furthermore, this criterion also allows for a way of quantifying multiparticle entanglement. Analytical criteria for entanglement in a special class of quantum states, so-called graph states, are presented. These criteria turn out to be also necessary for entanglement in certain cases. Finally, ways of generalizing a non-local hidden-variable model proposed by Leggett are shown.

•Mar 14, 2012•0 citations

Measures of genuine multipartite entanglement for graph states

Qun-Qun Guo, Xiaoyu Chen, Yun-Yun Wang

Graph states are special multipartite entangled states that have been proven useful in a variety of quantum information tasks. We address the issue of characterizing and quantifying the genuine multipartite entanglement of graph states up to eight qubits. The entanglement measures used are the geometric measure, the relative entropy of entanglement, and the logarithmic robustness, have been proved to be equal for the genuine entanglement of a graph state. We provide upper and lower bounds as well as an iterative algorithm to determine the genuine multipartite entanglement.

Chinese Physics B•May 1, 2014•19 citations
The characterization of genuine multiparticle entanglement is important for entanglement theory as well as experimental studies related to quantum-information theory. Here, we completely characterize genuine multiparticle entanglement for four-qubit states diagonal in the cluster-state basis. In addition, we give a complete characterization of multiparticle entanglement for all five-qubit graph states mixed with white noise, for states diagonal in the basis corresponding to the five-qubit Y\mathsf{Y}Y-shaped graph, and for a family of graph states with an arbitrary number of qubits.
We reduce the necessary and sufficient biseparable conditions of four-qubit cluster diagonal states to concise forms. Only 4 out of the 15 parameters are proved to be relevant in specifying the genuine entanglement of the states. Using the relative entropy of entanglement as entanglement measure, we analytically find the genuine entanglement of all the four-qubit cluster diagonal states. The formulas for the genuine entanglement are of five kinds, for seven different parameter regions of genuinely entangled states.
We present a method to derive separability criteria for different classes of multiparticle entanglement, especially genuine multiparticle entanglement. The resulting criteria are necessary and sufficient for certain families of states. This, for example, completely solves the problem of classifying N -qubit Greenberger–Horne–Zeilinger states mixed with white noise according to their separability and entanglement properties. Further, the criteria are superior to all known entanglement criteria for many other families; also they allow the detection of bound entanglement. We next demonstrate that they are easily implementable in experiments and discuss applications to the decoherence of multiparticle entangled states.
Graph states are multiparticle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of distributed quantum systems that play a significant role in quantum error correction, multiparty quantum communication, and quantum computation within the framework of the one-way quantum computer. We characterize and quantify the genuine multiparticle entanglement of such graph states in terms of the Schmidt measure, to which we provide upper and lower bounds in graph theoretical terms. Several examples and classes of graphs will be discussed, where these bounds coincide. These examples include trees, cluster states of different dimensions, graphs that occur in quantum error correction, such as the concatenated [7,1,3]-CSS code, and a graph associated with the quantum Fourier transform in the one-way computer. We also present general transformation rules for graphs when local Pauli measurements are applied, and give criteria for the equivalence of two graphs up to local unitary transformations, employing the stabilizer formalism. For graphs of up to seven vertices we provide complete characterization modulo local unitary transformations and graph isomorphisms.
We present a general theory for the construction of witnesses that detect genuine multipartite entanglement in graph states. First, we present explicit witnesses for all graph states of up to six qubits which are better than all criteria so far. Therefore, lower fidelities are required in experiments that aim at the preparation of graph states. Building on these results, we develop analytical methods to construct two different types of entanglement witnesses for general graph states. For many classes of states, these operators exhibit white noise tolerances that converge to 1 when increasing the number of particles. We illustrate our approach for states such as the linear and the 2D cluster state. Finally, we study an entanglement monotone motivated by our approach for graph states.
Entanglement is deemed a valuable resource for quantum computing and lies at the heart of quantum information. At the same time, current experiments are venturing into the realm of quantum systems consisting of many particles. In this book, different aspects of entanglement and non-locality in multiparticle systems are investigated. First, it presents an approach for an experimental verification of non-locality and entanglement with a high statistical significance. Second, a criterion for genuine multiparticle entanglement is introduced. Furthermore, this criterion also allows for a way of quantifying multiparticle entanglement. Analytical criteria for entanglement in a special class of quantum states, so-called graph states, are presented. These criteria turn out to be also necessary for entanglement in certain cases. Finally, ways of generalizing a non-local hidden-variable model proposed by Leggett are shown.
Graph states are special multipartite entangled states that have been proven useful in a variety of quantum information tasks. We address the issue of characterizing and quantifying the genuine multipartite entanglement of graph states up to eight qubits. The entanglement measures used are the geometric measure, the relative entropy of entanglement, and the logarithmic robustness, have been proved to be equal for the genuine entanglement of a graph state. We provide upper and lower bounds as well as an iterative algorithm to determine the genuine multipartite entanglement.