Entropic measure and hypergraph states
arXiv:1305.0662 · doi:10.1007/s11128-013-0646-1
Abstract
We investigate some properties of the entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing local entropic measure on qubit t of a hypergraph state by using the Hamming weight of the so-called t-adjacent subhypergraph. Then we quantify and characterize the entanglement of hypergraph states in terms of local entropic measures obtained by using the above approach. Our results show that a class of n-qubit hypergraph states can not be converted into any graph state under local unitary transformations.
11 pages; 1 figure
References in corpus (9)
- Multi-party entanglement in graph states
- Criticality, the area law, and the computational power of PEPS
- Graphical calculus for Gaussian pure states
- Quantum Error Correcting Codes Using Qudit Graph States
- Multipartite entanglement in quantum algorithms
- Encoding Hypergraphs into Quantum States
- Encoding graphs into quantum states: an axiomatic approach
- Relationship among locally maximally entanglable states, W states and hypergraph states under local unitary transformations
- Multipartite Entanglement and Hypergraph states of three qubits