Bipartite entanglement and hypergraph states

From MaRDI portal
Publication:2018175

DOI10.1007/S11128-014-0890-ZzbMATH Open1311.81036arXiv1305.4250OpenAlexW2058688078MaRDI QIDQ2018175FDOQ2018175

Bingjian Shang, Yan-ru Bao, Ri Qu, Zong-shang Li, Juan Wang, Yi Ping Ma, D. Song

Publication date: 13 April 2015

Published in: Quantum Information Processing (Search for Journal in Brave)

Abstract: We investigate some properties of multipartite entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing the concurrence between two specific qubits of a hypergraph state by using the so-called Hamming weights of several special subhypergraphs of the corresponding hypergraph. Then we quantify and characterize bipartite entanglement between each qubit pair of several special hypergraph states in terms of the concurrence obtained by using the above approach. Our main results include that (i) a graph g has a component with the vertex set {i,j} if and only if the qubit pair labeled by {i,j} of the graph state |g> is entangled; and (ii) each qubit pair of a special hypergraph state is entangled like the generalized W state.


Full work available at URL: https://arxiv.org/abs/1305.4250




Recommendations




Cites Work


Cited In (7)





This page was built for publication: Bipartite entanglement and hypergraph states

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018175)