Entanglement and nonclassical properties of hypergraph states
arXiv:1404.6492 · doi:10.1088/1751-8113/47/33/335303
Abstract
Hypergraph states are multi-qubit states that form a subset of the locally maximally entangleable states and a generalization of the well--established notion of graph states. Mathematically, they can conveniently be described by a hypergraph that indicates a possible generation procedure of these states; alternatively, they can also be phrased in terms of a non-local stabilizer formalism. In this paper, we explore the entanglement properties and nonclassical features of hypergraph states. First, we identify the equivalence classes under local unitary transformations for up to four qubits, as well as important classes of five- and six-qubit states, and determine various entanglement properties of these classes. Second, we present general conditions under which the local unitary equivalence of hypergraph states can simply be decided by considering a finite set of transformations with a clear graph-theoretical interpretation. Finally, we consider the question whether hypergraph states and their correlations can be used to reveal contradictions with classical hidden variable theories. We demonstrate that various noncontextuality inequalities and Bell inequalities can be derived for hypergraph states.
29 pages, 5 figures, final version
References in corpus (11)
- Entanglement detection
- Multi-party entanglement in graph states
- Experimentally testable state-independent quantum contextuality
- Taming multiparticle entanglement
- Bell Inequalities for Graph States
- Entanglement purification protocols for all graph states
- Entanglement and nonclassical properties of hypergraph states
- Necessary and sufficient detection efficiency for the Mermin inequalities
- Purification to Locally Maximally Entangleable States
- Hypergraph states in Grover's quantum search algorithm
- Compact set of invariants characterizing graph states of up to eight qubits