Related papers: Efficient Entanglement Measure for Graph States
Multi-qubit graph states generated by the action of controlled phase shift operators on a separable quantum state of a system, in which all the qubits are in arbitrary identical states, are examined. The geometric measure of entanglement of…
We propose a new classification for the entanglement in graph states based on generalized con- currence. The numerical results indicate that the eight different three-qubit graph states in three categories, 64 four-qubit graph states in…
The entanglement of graph states up to eight qubits is calculated in the regime of iteration calculation. The entanglement measures could be the relative entropy of entanglement, the logarithmic robustness or the geometric measure. All 146…
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…
We consider quantum graph states that can be mapped to directed weighted graphs, also known as directed networks. The geometric measure of entanglement of the states is calculated for the quantum graph states corresponding to arbitrary…
Graph states represent a significant class of multi-partite entangled quantum states with applications in quantum error correction, quantum communication, and quantum computation. In this work, we introduce a novel formalism called the…
We consider graph states generated by the action of controlled phase shift operators on a separable state of a multi-qubit system. The case when all the qubits are initially prepared in arbitrary states is investigated. We obtain the…
Computing entanglement of an arbitrary bipartite or multipartite mixed state is in general not an easy task as it usually involves complex optimization. Here we show that exploiting symmetries of certain mixed states, we can compute a…
We present a general theory for the construction of witnesses that detect genuine multipartite entanglement in graph states. First, we present explicit witnesses for all graph states of up to six qubits which are better than all criteria so…
Multiparty quantum states are useful for a variety of quantum information and computation protocols. We define a multiparty entanglement measure based on local measurements on a multiparty quantum state, and an entanglement measure averaged…
Quantifying experimentally created entanglement could in principle be accomplished by measuring the entire density matrix and calculating an entanglement measure of choice thereafter. Due to the tensor-structure of the Hilbert space, this…
The geometric measure of entanglement is the distance or angle between an entangled target state and the nearest unentangled state. Often one considers the geometric measure of entanglement for highly symmetric entangled states because it…
In this work we propose the geometric mean of bipartite concurrences as a genuine multipartite entanglement measure. This measure achieves the maximum value for absolutely maximally entangled states and has desirable properties for…
The following comment is based on an article by M. Jafarpour and L. Assadi [Eur. Phys. J. D 70, 62 (2016), doi:10.1140/epjd/e2016-60555-5] which with an exploitation of Scott measure (or generalized Meyer-Wallach measure) the entanglement…
Quantifying genuine entanglement is a crucial task in quantum information theory. Based on the geometric mean of bipartite $\alpha$-concurrences among all bipartitions, we present a class of well-defined genuine multipartite entanglement…
Graph states form a rich class of entangled states that exhibit important aspects of multi-partite entanglement. At the same time, they can be described by a number of parameters that grows only moderately with the system size. They have a…
We address the question of quantifying entanglement in pure graph states. Evaluation of multipartite entanglement measures is extremely hard for most pure quantum states. In this paper we demonstrate how solving one problem in graph theory,…
We propose a method for constructing multi-qubit entangled quantum states representing weighted tripartite graphs. An expression for the entanglement distance for multi-qubit states corresponding to arbitrary tripartite graph structures is…
This article proposes an efficient way of calculating the geometric measure of entanglement using tensor decomposition methods. The connection between these two concepts is explored using the tensor representation of the wavefunction.…
We give an explicit expression for the geometric measure of entanglement for three qubit states that are linear combinations of four orthogonal product states. It turns out that the geometric measure for these states has three different…