相关论文: Fully multi-qubit entangled states

In [Science 340, 1205, 7 June (2013)], via polytopes Michael Walter et al. proposed a sufficient condition detecting the genuinely entangled pure states. In this paper, assume that a state with six non-zero coefficients is not a trivially…

The entanglement properties of a multiparty pure state are invariant under local unitary transformations. The stabilizer dimension of a multiparty pure state characterizes how many types of such local unitary transformations existing for…

Quantum hypergraph states extend the well-studied class of graph states by taking into account multi-qubit interactions through hyperedges. They provide a powerful framework to represent a family of quantum states with genuine multipartite…

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…

We introduce an entanglement criterion to exclude full separability of quantum states. We present numerical evidence that the criterion is necessary and sufficient for the class of GHZ diagonal three-qubit states and estimate the volume of…

Pure multiparticle quantum states are called absolutely maximally entangled if all reduced states obtained by tracing out at least half of the particles are maximally mixed. We provide a method to characterize these states for a general…

Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of…

Graph states, and the entanglement they posses, are central to modern quantum computing and communications architectures. Local complementation---the graph operation that links all local-Clifford equivalent graph states---allows us to…

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…

We investigate the geometry of the four qubit systems by means of algebraic geometry and invariant theory, which allows us to interpret certain entangled states as algebraic varieties. More precisely we describe the nullcone, i.e., the set…

The n-qubit real equally weighted states are employed in some quantum algorithms including Deutsch-Jozsa, Grover, Simon, and so on. We qualitatively investigate the entanglement properties of n-qubit real equally weighted states. Firstly,…

Characterizing the non-classical correlations of a complex many-body system is an important part of quantum technologies. A versatile tool for such a task is one that scales well with the size of the system and which can be both easily…

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 present a way of identifying all kinds of entanglement for three-qubit pure states in terms of the expectation values of Pauli operators. The necessary and sufficient conditions to classify the fully separable, biseparable, and genuine…

Contrary to A.Borras et al.'s [1] conjecture, a genuine maximally seven-qubit entangled state is presented. We find a seven-qubit state whose marginal density matrices for subsystems of 1,2- qubits are all completely mixed and for…

We study entanglement properties of hypergraph states in arbitrary finite dimension. We compute multipartite entanglement of elementary qudit hypergraph states, namely those endowed with a single maximum-cardinality hyperedge. We show that,…

Hypergraph states are multiqubit states whose combinatorial description and entanglement properties generalize the well-studied class of graph states. Graph states are important in applications such as measurement-based quantum computation…

All the states of N qubits can be classified into N-1 entanglement classes from 2-entangled to N-entangled (fully entangled) states. Each class of entangled states is characterized by an entanglement index that depends on the partition of…

Quantum entanglement plays an important role in quantum information processes, such as quantum computation and quantum communication. Experiments in laboratories are unquestionably crucial to increase our understanding of quantum systems…

The phase space for a system of $n$ qubits is a discrete grid of $2^{n} \times 2^{n}$ points, whose axes are labeled in terms of the elements of the finite field $\Gal{2^n}$ to endow it with proper geometrical properties. We analyze the…