Related papers: Direct evaluation of pure graph state entanglement
The geometric measure of entanglement of a pure state, defined by its distance to the set of pure separable states, is extended to multipartite mixed states. We characterize the nearest disentangled mixed state to a given mixed state with…
We propose a method to generate entanglement measures systematically by using the irreducible decomposition of some copies of a state under the local unitary (LU) transformations. It is applicable to general multipartite systems. We show…
The quantification and classification of quantum entanglement is a very important and still open question of quantum information theory. In this paper, we describe an entanglement measure for multipartite pure states (the minimum of…
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…
The degree to which a pure quantum state is entangled can be characterized by the distance or angle to the nearest unentangled state. This geometric measure of entanglement, already present in a number of settings [A. Shimony, Ann. NY.…
We investigate the properties of different levels of entanglement in graph states which correspond to connected graphs. Combining the operational definition of graph states and the postulates of entanglement measures, we prove that in…
Grid states form a discrete set of mixed quantum states that can be described by graphs. We characterize the entanglement properties of these states and provide methods to evaluate entanglement criteria for grid states in a graphical way.…
We consider graph states of arbitrary number of particles undergoing generic decoherence. We present methods to obtain lower and upper bounds for the system's entanglement in terms of that of considerably smaller subsystems. For an…
We revisit the genuine multipartite entanglement by a simplified method, which only involves the Schmidt decomposition and local unitary transformation. We construct a local unitary equivalent class of the tri-qubit quantum state, then use…
Statistical verification of a quantum state aims to certify whether a given unknown state is close to the target state with confidence. So far, sample-optimal verification protocols based on local measurements have been found only for…
The degree to which a pure quantum state is entangled can be characterized by the distance or angle to the nearest unentangled state. This geometric measure of entanglement, already present in a number of settings (see Shimony 1995 and…
Bipartite maximally entangled states have the property that the largest Schmidt coefficient reaches its lower bound. However, for multipartite states the standard Schmidt decomposition generally does not exist. We use a generalized Schmidt…
We present an alternative approach to unveil a different kind of entanglement in bipartite quantum states whose diagonal zero patterns in suitable matrix representations admit a nice description in terms of triangle-free graphs. Upon…
A simple entanglement measure for multipartite pure states is formulated based on the partial entropy of a series of reduced density matrices. Use of the proposed new measure to distinguish disentangled, partially entangled, and maximally…
We provide methods for computing the geometric measure of entanglement for two families of pure states with both experimental and theoretical interests: symmetric multiqubit states with non-negative amplitudes in the Dicke basis and…
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…
Graph states are versatile resources for quantum computation and quantum-enhanced measurement. Their generation illustrates a high level of control over entanglement. We report on the generation of continuous-variable graph states of atomic…
We study the entanglement properties of quantum hypergraph states of $n$ qubits, focusing on multipartite entanglement. We compute multipartite entanglement for hypergraph states with a single hyperedge of maximum cardinality, for…
We show that pure states of multipartite quantum systems are multiseparable (i.e. give separable density matrices on tracing any party) if and only if they have a generalized Schmidt decomposition. Implications of this result for the…
The most efficient automated way to construct a large class of quantum photonic experiments is via abstract representation of graphs with certain properties. While new directions were explored using Artificial intelligence and SAT solvers…