Related papers: Matrix Pencils and Entanglement Classification
In this paper we consider the conditions under which a given ensemble of two-qubit states can be optimally distinguished by local operations and classical communication (LOCC). We begin by completing the \emph{perfect} distinguishability…
Recently, a toolkit of highly symmetric techniques employing matrix inequalities has been developed to detect entanglement in various ways. Here we unifiedly explain in detail these methods, and expand them to a new family of positive maps…
We address some of the most commonly raised questions about entanglement, especially with regard to so-called occupation number entanglement. To answer unambiguously whether entanglement can exist in a one-atom delocalized state, we propose…
By using a matrix technique, which allows to identify directly the ladder operators, the Penning trap coherent states are derived as eigenstates of the appropriate annihilation operators. These states are compared with the ones obtained…
The task of classifying the entanglement properties of a multipartite quantum state poses a remarkable challenge due to the exponentially increasing number of ways in which quantum systems can share quantum correlations. Tackling such…
It is shown that local distinguishability of orthogonal mixed states can be completely characterized by local distinguishability of their supports irrespective of entanglement and mixedness of the states. This leads to two kinds of upper…
Using a generalization of Cayley's hyperdeterminant as a new measure of tripartite fermionic entanglement we obtain the SLOCC classification of three-fermion systems with six single particle states. A special subclass of such three-fermion…
We characterize entanglement subject to its definition over real and complex, composite quantum systems. In particular, a method is established to assess quantum correlations with respect to a selected number system, illuminating the deeply…
Ensembles containing orthogonal product states are found to be indistinguishable under local operations and classical communication (LOCC), thereby showing irreversibility in the preparation and distinguishing processes, which is commonly…
The Computable Cross Norm (CCN), or realignment criterion, is a widely used method for entanglement detection in quantum systems; however, it typically provides only a necessary condition. In this work, we advance the applicability of the…
The "folding algorithm"\cite{fold1} is a matrix product state algorithm for simulating quantum systems that involves a spatial evolution of a matrix product state. Hence, the computational effort of this algorithm is controlled by the…
We consider special quantum systems containing both distinguishable and identical constituents. It is shown that for these systems the Freudenthal construction based on cubic Jordan algebras naturally defines entanglement measures invariant…
We show that the set of $n \times n$ complex symmetric matrix pencils of rank at most $r$ is the union of the closures of $\lfloor r/2\rfloor +1$ sets of matrix pencils with some, explicitly described, complete eigenstructures. As a…
An ensemble of product states is said to exhibit "quantum nonlocality without entanglement" if the states cannot be optimally discriminated by local operations and classical communication (LOCC). We show that this property can depend on the…
We study a quantum theory based on two assumptions: In the intrinsic frame of reference of an isolated, macroscopic system, (i) the system has no global motion and is not entangled with any other system, (ii) time evolution of statevectors…
Analyzing the properties of entanglement in many-particle spin-1/2 systems is generally difficult because the system's Hilbert space grows exponentially with the number of constituent particles, $N$. Fortunately, it is still possible to…
We develop a new method for entanglement detection in bipartite quantum states by using the violation of the rank-1-generated property of matrices. The positive-semidefinite matrices form a convex cone that has extremal elements of rank 1.…
When a quantum system is distributed to spatially separated parties, it is natural to consider how the system evolves when the parties perform local quantum operations with classical communication (LOCC). However, the structure of LOCC…
We introduce a generalization of the set of completely positive matrices that we call "pairwise completely positive" (PCP) matrices. These are pairs of matrices that share a joint decomposition so that one of them is necessarily positive…
For the certification and benchmarking of medium-size quantum devices efficient methods to characterize entanglement are needed. In this context, it has been shown that locally randomized measurements on a multiparticle quantum system can…