Related papers: Extended Reduction Criterion and Lattice States
It has been shown that effective lowering of dimension underlies ground-state space structure and properties of two-dimensional lattice systems with a long-range interparticle repulsion. On the basis of this fact a rigorous general…
Motivated by the Kronecker product approximation technique, we have developed a very simple method to assess the inseparability of bipartite quantum systems, which is based on a realigned matrix constructed from the density matrix. For any…
We present a large class of indecomposable exposed positive linear maps between three dimensional matrix algebras. We also construct two qutrit separable states with lengths ten in the interior of their dual faces. With these examples, we…
Employing a recently proposed separability criterion we develop analytical lower bounds for the concurrence and for the entanglement of formation of bipartite quantum systems. The separability criterion is based on a nondecomposable…
Finite tight frames play an important role in miscellaneous areas, including quantum information theory. Here we apply a class of tight frames, equiangular tight frames, to address the problem of detecting the entanglement of bipartite…
Two-particle lattice states are important for physics of magnetism, superconducting oxides, and cold quantum gases. The quantum-mechanical lattice problem is exactly solvable for finite-range interaction potentials. A two-body Schroedinder…
We find tight lower and upper bounds on the entanglement of a superposition of two bipartite states in terms of the entanglement of the two states constituting the superposition. Our upper bound is dramatically tighter than the one…
In a previous paper [Nijhoff,Puttock,2003], a 2-parameter extension of the lattice potential KdV equation was derived, associated with an elliptic curve. This comprises a rather complicated 3-component system on the quad lattice which…
We construct $3\otimes 3$ PPT entangled edge states with maximal ranks, to complete the classification of $3\otimes 3$ PPT entangled edge states by their types. The ranks of the states and their partial transposes are 8 and 6, respectively.…
Classification of entanglement in multipartite quantum systems is an open problem solved so far only for bipartite systems and for systems composed of three and four qubits. We propose here a coarse-grained classification of entanglement in…
We present a practical classification scheme for the four-partite entangled states under stochastic local operations and classical communication (SLOCC). By transforming a four-partite state into a triple-state set composed of two…
We study the normal form of multipartite density matrices. It is shown that the correlation matrix (CM) separability criterion can be improved from the normal form we obtained under filtering transformations. Based on CM criterion the…
We study the separability of permutationally symmetric quantum states. We show that for bipartite symmetric systems most of the relevant entanglement criteria coincide. However, we provide a method to generate examples of bound entangled…
We introduce an approach which allows a detailed structural and quantitative analysis of multipartite entanglement. The sets of states with different structures are convex and nested. Hence, they can be distinguished from each other using…
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 investigate several problems in entanglement theory from the perspective of convex optimization. This list of problems comprises (A) the decision whether a state is multi-party entangled, (B) the minimization of expectation values of…
The complete reducibility property for bipartite states reduced the separability problem to a proper subset of positive under partial transpose states and was used to prove several theorems inside and outside entanglement theory. So far…
We develop a strong and computationally simple entanglement criterion. The criterion is based on an elementary positive map Phi which operates on state spaces with even dimension N >= 4. It is shown that Phi detects many entangled states…
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 construct a family of bipartite states of arbitrary dimension whose eigenvalues of the partially transposed matrix can be inferred directly from the block structure of the global density matrix. We identify from this several subfamilies…