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

Frontiers of Physics

The entanglement of several graph states

Xiaoyu Chen

Published Apr 22, 2012• 4 citations
Publisher

Abstract

We exactly evaluate the entanglement of a six vertex and a nine vertex graph states which correspond to non “two-colorable” graphs. to non “two-colorable” graphs. The upper bound of entanglement for five vertex ring graph state is improved to 2. is improved to 2.9275, less than the upper bound determined by local operations and classical communication. communication. An upper bound of entanglement is proposed based on the definition of graph state. state.

DOI
10.1007/s11467-012-0249-9

Related papers

The entanglement of some non-two-colorable graph states

Xiaoyu Chen, Li-zhen Jiang

We exactly evaluate the entanglement of a six vertex and a nine vertex graph states which correspond to non ''two-colorable'' graphs. The upper bound of entanglement for five vertices ring graph state is improved to 2.9275, less than upper bound determined by LOCC. An upper bound of entanglement is proposed based on the definition of graph state.

arXiv:0906.5130•Jun 28, 2009•1 citation

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•12 citations

Entanglement and local information access for graph states

Damian Markham, Akimasa Miyake, S. Virmani

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.

arXiv:quant-ph/0609102•New Journal of Physics•Jun 29, 2007•66 citations

Entanglement of Graph Qutrit States

Haitao Li, Xiaoyu Chen

The number of inequivalent classes of up to 8-qutrit graph states is 1002, with 239 decomposable graphs and 763 indecomposable graphs. Apparently, the former can be decomposed to several indecomposable parts. For qubit graph states, the upper and lower bounds of entanglement have been given. If the two bounds don't coincide, the entanglement can be calculated by iterative method. For qutrit graph states, their lower bounds can be found through the local complementation operations. But its hard to find the upper bound because the qutrit graph states have 2 basis states which are GHZ state and W state. Fortunately, the iterative method can also be used here. In this paper, we calculated the entanglement of all the 1002 graph states. Through researching the results, we found the similar feature with graph qubit states that the decimal part of entanglement is stable.

International Conference on Intelligence Science and Information Engineering•Aug 1, 2011•3 citations

Entanglement of 9-qubit graph states

Sui Yan, Xiaoyu Chen

The entanglement of graph states can be calculated by adopting Iterative algorithm. The number of inequivalent classes of 9-qubit graph states is 440. All 440 local inequivalent graphs are classified as two categories: graphs with equal upper LOCC entanglement bound and lower bipartite entanglement

International ICST Conference on Communications and Networking in China•Jan 1, 2010•0 citations

Determing the entanglement of quantum nonbinary graph states

Jian Xu, Xiaoyu Chen, Haitao Li

Graph states are multipartite entangled states that correspond to mathematical graphs, where the vertices of the graph now play the role of quantum multilevel systems and edges represent interactions of the systems. Graph states are the basis of quantum error correction and one-way quantum computer. We systematically study the entanglement of non-binary graph states. Using iterative algorithm and entanglement bounds, we calculate the entanglement of all the ternary graph states up to nine vertices and parts of quaternary and quinary graph states modulo local unitary transformations and graph isomorphisms. The entanglement measure can be the geometric measure, the measure of relative entropy of entanglement or the measure of logarithmic robustness. We classify the graph states according to the entanglement values obtained. The closest product states obtained in the calculations are studied.

Acta Physica Sinica•Jan 1, 2012•2 citations
We exactly evaluate the entanglement of a six vertex and a nine vertex graph states which correspond to non “two-colorable” graphs. to non “two-colorable” graphs. The upper bound of entanglement for five vertex ring graph state is improved to 2. is improved to 2.9275, less than the upper bound determined by local operations and classical communication. communication. An upper bound of entanglement is proposed based on the definition of graph state. state.
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 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.
The number of inequivalent classes of up to 8-qutrit graph states is 1002, with 239 decomposable graphs and 763 indecomposable graphs. Apparently, the former can be decomposed to several indecomposable parts. For qubit graph states, the upper and lower bounds of entanglement have been given. If the two bounds don't coincide, the entanglement can be calculated by iterative method. For qutrit graph states, their lower bounds can be found through the local complementation operations. But its hard to find the upper bound because the qutrit graph states have 2 basis states which are GHZ state and W state. Fortunately, the iterative method can also be used here. In this paper, we calculated the entanglement of all the 1002 graph states. Through researching the results, we found the similar feature with graph qubit states that the decimal part of entanglement is stable.
Graph states are multipartite entangled states that correspond to mathematical graphs, where the vertices of the graph now play the role of quantum multilevel systems and edges represent interactions of the systems. Graph states are the basis of quantum error correction and one-way quantum computer. We systematically study the entanglement of non-binary graph states. Using iterative algorithm and entanglement bounds, we calculate the entanglement of all the ternary graph states up to nine vertices and parts of quaternary and quinary graph states modulo local unitary transformations and graph isomorphisms. The entanglement measure can be the geometric measure, the measure of relative entropy of entanglement or the measure of logarithmic robustness. We classify the graph states according to the entanglement values obtained. The closest product states obtained in the calculations are studied.