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:quant-ph/0609102 · New Journal of Physics

Entanglement and local information access for graph states

Damian Markham, Akimasa Miyake, S. Virmani

Published Jun 29, 2007• 62 citations
arXivHTMLPDF

Abstract

We exactly evaluate a number of multipartite entanglement measures for a class of graph states, including d -dimensional cluster states ( d = 1,2,3), the Greenberger–Horne–Zeilinger states, and some related mixed states. The entanglement measures that we consider are continuous, 'distance from separable states' measures, including the relative entropy, the so-called geometric measure, and robustness of entanglement. We also show that for our class of graph states these entanglement values give an operational interpretation as the maximal number of graph states distinguishable by local operations and classical communication (LOCC), as well as supplying a tight bound on the fixed letter classical capacity under LOCC decoding.

DOI
10.1088/1367-2630/9/6/194

Related papers

Efficient detection of multipartite entanglement structure

You Zhou, Qi Zhao, Xiao Yuan +1 more

Recently, there are tremendous developments on the number of controllable qubits in several quantum computing systems. For these implementations, it is crucial to determine the entanglement structure of the prepared multipartite quantum state as a basis for further information processing tasks. In reality, evaluation of a multipartite state is in general a very challenging task owing to the exponential increase of the Hilbert space with respect to the number of system components. In this work, we propose a systematic method using very few local measurements to detect multipartite entanglement structures based on the graph state --- one of the most important classes of quantum states for quantum information processing. Thanks to the close connection between the Schmidt coefficient and quantum entropy in graph states, we develop a family of efficient witness operators to detect the entanglement between subsystems under any partitions and hence the entanglement intactness. We show that the number of local measurements equals to the chromatic number of the underlying graph, which is a constant number, independent of the number of qubits. In reality, the optimization problem involved in the witnesses can be challenging with large system size. For several widely-used graph states, such as 1-D and 2-D cluster states and the Greenberger-Horne-Zeilinger state, by taking advantage of the area law of entanglement entropy, we derive analytical solutions for the witnesses, which only employ two local measurements. Our method offers a standard tool for entanglement structure detection to benchmark multipartite quantum systems.

•Apr 10, 2019•0 citations

Comparison of different definitions of the geometric measure of entanglement

Lin Chen, Martin Aulbach, Michal Hajdušek

Several inequivalent definitions of the geometric measure of entanglement (GM) have been introduced and studied in the past. Here we review several known and new definitions, with the qualifying criterion being that for pure states the measure is a linear or logarithmic function of the maximal fidelity with product states. The entanglement axioms and properties of the measures are studied, and qualitative and quantitative comparisons are made between all definitions. Streltsov et al. [New J. Phys. 12, 123004 (2010)] proved the equivalence of two linear definitions of GM, whereas we show that the corresponding logarithmic definitions are distinct. Certain classes of states such as ``maximally correlated states'' and isotropic states are particularly valuable for this analysis. A little-known GM definition is found to be the first one to be both normalized and weakly monotonous, thus being a prime candidate for future studies of multipartite entanglement. We also find that a large class of graph states, which includes all cluster states, have a ``universal'' closest separable state that minimizes the quantum relative entropy, the Bures distance, and the trace distance.

arXiv:1308.0806•Physical Review A•Apr 7, 2014•34 citations

Multipartite entanglement measure for all discrete systems

Beatrix C. Hiesmayr, Marcus Huber

Via a multidimensional complementarity relation we derive an operational entanglement measure for any discrete quantum system, i.e., for any multidimensional and multipartite system. This measure admits a separation into different classes of entanglement obtained by using a flip operator $2,3,\dots{},n$ times, defining a $m$-flip concurrence. This operator sum has the practical feature to allow one to calculate for mixed states bounds on this $m$-flip concurrence. Moreover, the information content of an $n$-partite multidimensional system admits a simple and intuitive interpretation in terms of single particle obtainable information, entanglement, and information due to lack of classical knowledge of the quantum state under investigation. Explicitly, the three qubit system is analyzed and, e.g., the physical difference in entanglement of the W state, the Greenberger-Horne-Zeilinger (GHZ) state, or a biseparable state is revealed.

arXiv:0712.0346•Physical Review A•Jul 22, 2008•45 citations

Operational Multipartite Entanglement Measures

Katharina Schwaiger, David Sauerwein, Martí Cuquet +2 more

We introduce two operational entanglement measures that are applicable for arbitrary multipartite (pure or mixed) states. One of them characterizes the potentiality of a state to generate other states via local operations assisted by classical communication and the other characterizes the simplicity of generating the state at hand. We show how these measures can be generalized to two classes of entanglement measures. Moreover, we compute the new measures for pure few-partite systems and use them to characterize the entanglement contained in a three-qubit state. We identify the Greenberger-Horne-Zeilinger and W state as the most powerful pure three-qubit states regarding state manipulation.

arXiv:1503.00615•Physical Review Letters•Oct 7, 2015•68 citations

Entanglement of graph states up to eight qubits

Xiaoyu Chen

The entanglement of graph states up to eight qubits is calculated in the regime of iteration calculation. The entanglement measures could be the relative entropy of entanglement, the logarithmic robustness or the geometric measure. All 146 local inequivalent graphs are classified as two categories: graphs with identical upper LOCC entanglement bound and lower bipartite entanglement bound, graphs with unequal bounds. The late may displays non-integer entanglement. The precision of iteration calculation of the entanglement is less than $10^{-14}$.

arXiv:0909.1603•Journal of Physics B Atomic Molecular and Optical Physics•Apr 6, 2010•13 citations

Relations between bipartite entanglement measures

Katharina Schwaiger, Barbara Kraus

We investigate the entanglement of bipartite systems from an operational point of view. Main emphasis is put on bipartite pure states in the single copy regime. First, we present an operational characterization of bipartite pure state entanglement, viewing the state as a multipartite state. Then, we investigate the properties and relations of two classes of operational bipartite and multipartite entanglement measures, the so-called source and the accessible entanglement. The former measures how easy it is to generate a given state via local operations and classical communication (LOCC) from some other state, whereas the latter measures the potentiality of a state to be convertible to other states via LOCC. We investigate which parameter regime is physically available, i.e. for which values of these measures does there exist a bipartite pure state. Moreover, we determine, given some state, which parameter regime can be accessed by it and from which parameter regime it can be accessed. We show that this regime can be determined analytically using the Positivstellensatz. We compute the boundaries of these sets and the boundaries of the corresponding source and accessible sets. Furthermore, we relate these results to other entanglement measures and compare their behaviors.

arXiv:1701.08679•Quantum Information and Computation•Feb 1, 2018•4 citations
We exactly evaluate a number of multipartite entanglement measures for a class of graph states, including d -dimensional cluster states ( d = 1,2,3), the Greenberger–Horne–Zeilinger states, and some related mixed states. The entanglement measures that we consider are continuous, 'distance from separable states' measures, including the relative entropy, the so-called geometric measure, and robustness of entanglement. We also show that for our class of graph states these entanglement values give an operational interpretation as the maximal number of graph states distinguishable by local operations and classical communication (LOCC), as well as supplying a tight bound on the fixed letter classical capacity under LOCC decoding.
Recently, there are tremendous developments on the number of controllable qubits in several quantum computing systems. For these implementations, it is crucial to determine the entanglement structure of the prepared multipartite quantum state as a basis for further information processing tasks. In reality, evaluation of a multipartite state is in general a very challenging task owing to the exponential increase of the Hilbert space with respect to the number of system components. In this work, we propose a systematic method using very few local measurements to detect multipartite entanglement structures based on the graph state --- one of the most important classes of quantum states for quantum information processing. Thanks to the close connection between the Schmidt coefficient and quantum entropy in graph states, we develop a family of efficient witness operators to detect the entanglement between subsystems under any partitions and hence the entanglement intactness. We show that the number of local measurements equals to the chromatic number of the underlying graph, which is a constant number, independent of the number of qubits. In reality, the optimization problem involved in the witnesses can be challenging with large system size. For several widely-used graph states, such as 1-D and 2-D cluster states and the Greenberger-Horne-Zeilinger state, by taking advantage of the area law of entanglement entropy, we derive analytical solutions for the witnesses, which only employ two local measurements. Our method offers a standard tool for entanglement structure detection to benchmark multipartite quantum systems.
Several inequivalent definitions of the geometric measure of entanglement (GM) have been introduced and studied in the past. Here we review several known and new definitions, with the qualifying criterion being that for pure states the measure is a linear or logarithmic function of the maximal fidelity with product states. The entanglement axioms and properties of the measures are studied, and qualitative and quantitative comparisons are made between all definitions. Streltsov et al. [New J. Phys. 12, 123004 (2010)] proved the equivalence of two linear definitions of GM, whereas we show that the corresponding logarithmic definitions are distinct. Certain classes of states such as ``maximally correlated states'' and isotropic states are particularly valuable for this analysis. A little-known GM definition is found to be the first one to be both normalized and weakly monotonous, thus being a prime candidate for future studies of multipartite entanglement. We also find that a large class of graph states, which includes all cluster states, have a ``universal'' closest separable state that minimizes the quantum relative entropy, the Bures distance, and the trace distance.
Via a multidimensional complementarity relation we derive an operational entanglement measure for any discrete quantum system, i.e., for any multidimensional and multipartite system. This measure admits a separation into different classes of entanglement obtained by using a flip operator 2,3,…,n2,3,\dots{},n2,3,…,n times, defining a mmm-flip concurrence. This operator sum has the practical feature to allow one to calculate for mixed states bounds on this mmm-flip concurrence. Moreover, the information content of an nnn-partite multidimensional system admits a simple and intuitive interpretation in terms of single particle obtainable information, entanglement, and information due to lack of classical knowledge of the quantum state under investigation. Explicitly, the three qubit system is analyzed and, e.g., the physical difference in entanglement of the W state, the Greenberger-Horne-Zeilinger (GHZ) state, or a biseparable state is revealed.
We introduce two operational entanglement measures that are applicable for arbitrary multipartite (pure or mixed) states. One of them characterizes the potentiality of a state to generate other states via local operations assisted by classical communication and the other characterizes the simplicity of generating the state at hand. We show how these measures can be generalized to two classes of entanglement measures. Moreover, we compute the new measures for pure few-partite systems and use them to characterize the entanglement contained in a three-qubit state. We identify the Greenberger-Horne-Zeilinger and W state as the most powerful pure three-qubit states regarding state manipulation.
The entanglement of graph states up to eight qubits is calculated in the regime of iteration calculation. The entanglement measures could be the relative entropy of entanglement, the logarithmic robustness or the geometric measure. All 146 local inequivalent graphs are classified as two categories: graphs with identical upper LOCC entanglement bound and lower bipartite entanglement bound, graphs with unequal bounds. The late may displays non-integer entanglement. The precision of iteration calculation of the entanglement is less than 10−1410^{-14}10−14.
We investigate the entanglement of bipartite systems from an operational point of view. Main emphasis is put on bipartite pure states in the single copy regime. First, we present an operational characterization of bipartite pure state entanglement, viewing the state as a multipartite state. Then, we investigate the properties and relations of two classes of operational bipartite and multipartite entanglement measures, the so-called source and the accessible entanglement. The former measures how easy it is to generate a given state via local operations and classical communication (LOCC) from some other state, whereas the latter measures the potentiality of a state to be convertible to other states via LOCC. We investigate which parameter regime is physically available, i.e. for which values of these measures does there exist a bipartite pure state. Moreover, we determine, given some state, which parameter regime can be accessed by it and from which parameter regime it can be accessed. We show that this regime can be determined analytically using the Positivstellensatz. We compute the boundaries of these sets and the boundaries of the corresponding source and accessible sets. Furthermore, we relate these results to other entanglement measures and compare their behaviors.