Bipartite entanglement and hypergraph states

Bipartite entanglement and hypergraph states 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 result includes that a graph g has a component with the vertex set $$\{i,j\}$$ { i , j } if and only if the qubit pair labeled by $$\{i,j\}$$ { i , j } of the graph state $$|g\rangle$$ | g ⟩ is entangled. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Bipartite entanglement and hypergraph states

, Volume 14 (2) – Nov 30, 2014
12 pages

/lp/springer_journal/bipartite-entanglement-and-hypergraph-states-QYJgv7AMX0
Publisher
Springer Journals
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1007/s11128-014-0890-z
Publisher site
See Article on Publisher Site

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 result includes that a graph g has a component with the vertex set $$\{i,j\}$$ { i , j } if and only if the qubit pair labeled by $$\{i,j\}$$ { i , j } of the graph state $$|g\rangle$$ | g ⟩ is entangled.

Journal

Quantum Information ProcessingSpringer Journals

Published: Nov 30, 2014

DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month Explore the DeepDyve Library Search Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly Organize Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place. Access Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals. Your journals are on DeepDyve Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more. All the latest content is available, no embargo periods. DeepDyve Freelancer DeepDyve Pro Price FREE$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations