Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Entropic measure and hypergraph states

Entropic measure and hypergraph states 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$$ t of a hypergraph state by using the Hamming weight of the so-called $$t$$ 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 full-rank hypergraph states of more than two qubits can not be converted into any graph state under local unitary transformations. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Loading next page...
 
/lp/springer_journal/entropic-measure-and-hypergraph-states-SwCidT7C02

References (25)

Publisher
Springer Journals
Copyright
Copyright © 2013 by Springer Science+Business Media New York
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
DOI
10.1007/s11128-013-0646-1
Publisher site
See Article on Publisher Site

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$$ t of a hypergraph state by using the Hamming weight of the so-called $$t$$ 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 full-rank hypergraph states of more than two qubits can not be converted into any graph state under local unitary transformations.

Journal

Quantum Information ProcessingSpringer Journals

Published: Oct 1, 2013

There are no references for this article.