Related papers: Bipartite entanglement and hypergraph states
Given a bipartite quantum state (in arbitrary dimension) and a decomposition of it as a superposition of two others, we find bounds on the entanglement of the superposition state in terms of the entanglement of the states being superposed.…
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…
In recent years considerable progress has been made towards developing a general theory of quantum entanglement. In particular, criteria to decide whether a given quantum state is entangled are of high theoretical and practical interest.…
The bipartite entanglement of a pure quantum state is known to be characterized by its Schmidt decomposition. In particular the state is maximally entangled when all the Schmidt coefficients are equal. We point out a convenient method which…
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…
We construct multipartite graph states whose dimension is the power of a prime number. This is realized by the finite field, as well as the generalized controlled-NOT quantum circuit acting on two qudits. We propose the standard form of…
We introduce and analyze graph-associated entanglement cost, a generalization of the entanglement cost of quantum states to multipartite settings. We identify a necessary and sufficient condition for any multipartite entangled state to be…
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…
We study the entanglement between a certain qubit and the remaining system in rank- 2 mixed states prepared on the quantum computer. The protocol, which we propose for this purpose, is based on the relation of geometric measure of…
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…
The entanglement content of superpositions of quantum states is investigated based on a measure called {\it concurrence}. Given a bipartite pure state in arbitrary dimension written as the quantum superposition of two other such states, we…
We classify multipartite entangled states in the 2 x 2 x n (n >= 4) quantum system, for example the 4-qubit system distributed over 3 parties, under local filtering operations. We show that there exist nine essentially different classes of…
We present a new approach to the analysis of entanglement in smooth bipartite continuous-variable states. One or both parties perform projective filterings via preliminary measurements to determine whether the system is located in some…
A classification of multipartite entanglement in qubit systems is introduced for pure and mixed states. The classification is based on the robustness of the said entanglement against partial trace operation. Then we use current machine…
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 is explored for bi-partite and multi-partite pure and mixed states.…
As quantum computing technology slowly matures and the number of available qubits on a QPU gradually increases, interest in assessing the capabilities of quantum computing hardware in a scalable manner is growing. One of the key properties…
Entanglement concurrence is an important bipartite entanglement measure that has found wide applications in quantum technologies. In this work, inspired by unified entropy, we introduce a two-parameter family of entanglement measures,…
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 introduce a homology-based technique for the analysis of multiqubit state vectors. In our approach, we associate state vectors to data sets by introducing a metric-like measure in terms of bipartite entanglement, and investigate the…
We study the entanglement of a multipartite quantum state. An inequality between the bipartite concurrence and the multipartite concurrence is obtained. More effective lower and upper bounds of the multipartite concurrence are obtained. By…