Tensor Rank and Other Multipartite Entanglement Measures of Graph States

Abstract

Graph states play an important role in quantum information theory through their connection to measurement-based computing and error correction. Prior work has revealed elegant connections between the graph structure of these states and their multipartite entanglement content. We continue this line of investigation by identifying additional entanglement properties for certain types of graph states. From the perspective of tensor theory, we tighten both upper and lower bounds on the tensor rank of odd ring states ($|R_{2n+1}⟩$) to read $2^n+1\le rank(|R_{2n+1}⟩)\le 3\ast 2^{n-1}$. Next, we show that several multipartite extensions of bipartite entanglement measures are dichotomous for graph states based on the connectivity of the corresponding graph. Lastly, we give a simple graph rule for computing the n-tangle ${\tau }_n$.

9 + 5 pages, 5 figures

References in corpus (6)

• Multi-party entanglement in graph states
• Measure of genuine multipartite entanglement with computable lower bounds
• Fast simulation of stabilizer circuits using a graph state representation
• Quantum Error Correcting Codes Using Qudit Graph States
• Tensor Rank and Stochastic Entanglement Catalysis for Multipartite Pure States
• Tripartite entanglement transformations and tensor rank

Cited by in corpus (2)

• Localizing multipartite entanglement with local and global measurements
• Experimental measurement and a physical interpretation of quantum shadow enumerators