Entropic measure and hypergraph states

  • Authors:

  • Ri Qu;Yi-Ping Ma;Yan-Ru Bao;Juan Wang;Zong-Shang Li

  • Affiliations:

  • School of Computer Science and Technology, Tianjin University, Tianjin, China 300072 and Tianjin Key Laboratory of Cognitive Computing and Application, Tianjin, China 300072;School of Computer Science and Technology, Tianjin University, Tianjin, China 300072 and Tianjin Key Laboratory of Cognitive Computing and Application, Tianjin, China 300072;Tianjin Key Laboratory of Cognitive Computing and Application, Tianjin, China 300072 and School of Computer Science and Technology, Tianjin University, Tianjin, China 300072;School of Computer Science and Technology, Tianjin University, Tianjin, China 300072 and Tianjin Key Laboratory of Cognitive Computing and Application, Tianjin, China 300072;School of Computer Science and Technology, Tianjin University, Tianjin, China 300072 and Tianjin Key Laboratory of Cognitive Computing and Application, Tianjin, China 300072

  • Venue:
  • Quantum Information Processing
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

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.