Bipartite entanglement and hypergraph states
| Autor: | Yi-ping Ma, Juan Wang, Yan-ru Bao, Dawei Song, Bing-jian Shang, Ri Qu, Zong-shang Li |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Hypergraph
Mathematics::Combinatorics Statistical and Nonlinear Physics Concurrence Quantum Physics Quantum entanglement Graph state Multipartite entanglement Theoretical Computer Science Electronic Optical and Magnetic Materials Combinatorics Computer Science::Discrete Mathematics Modeling and Simulation Qubit Signal Processing Bipartite graph Electrical and Electronic Engineering Mathematics Quantum computer |
| Zdroj: | Quantum Information Processing. 14:547-558 |
| ISSN: | 1573-1332 1570-0755 |
| DOI: | 10.1007/s11128-014-0890-z |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink