English
Related papers

Related papers: Another dual formulation of the separability probl…

200 papers

We consider the entanglement marginal problem, which consists of deciding whether a number of reduced density matrices are compatible with an overall separable quantum state. To tackle this problem, we propose hierarchies of semidefinite…

Quantum Physics · Physics 2021-11-30 Miguel Navascues , Flavio Baccari , Antonio Acin

A group of symmetric operators are introduced to carry out the separability criterion for bipartite and multipartite quantum states. Every symmetric operator, represented by a symmetric matrix with only two nonzero elements, and their…

Quantum Physics · Physics 2012-12-04 Jie-Hui Huang , Li-Yun Hu , Lei Wang , Shi-Yao Zhu

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…

Quantum Physics · Physics 2007-05-23 Kai Chen , Ling-An Wu

Inspired by the realignment or computable cross norm criterion, we present a new result about the characterization of quantum entanglement. Precisely, an interesting class of inequalities satisfied by all separable states of a bipartite…

Quantum Physics · Physics 2008-07-29 Paolo Aniello , Cosmo Lupo

Clarifying the relation between the whole and its parts is crucial for many problems in science. In quantum mechanics, this question manifests itself in the quantum marginal problem, which asks whether there is a global pure quantum state…

Quantum Physics · Physics 2021-02-18 Xiao-Dong Yu , Timo Simnacher , Nikolai Wyderka , H. Chau Nguyen , Otfried Gühne

Schmidt decomposition is a widely employed tool of quantum theory which plays a key role for distinguishable particles in scenarios such as entanglement characterization, theory of measurement and state purification. Yet, it is held not to…

Quantum Physics · Physics 2017-03-29 Stefania Sciara , Rosario Lo Franco , Giuseppe Compagno

In this paper, based on a matrix norm, we first present a ball of separable unnormalized states around the identity matrix for the bipartite quantum system, which is larger than the separable ball in Frobenius norm. Then the proposed ball…

Quantum Physics · Physics 2015-09-02 Shu-Qian Shen , Ming Li , Lei Li

Usual separability criteria applicable to distinguishable particles are not applicable to identical particles. Here we show that Partial transposition and symmetrization (or anti symmetrization) of density matrix of bipartite boson systems…

Quantum Physics · Physics 2015-01-26 Pranav P. , M. Ravendranadhan

It is well known that the Schmidt decomposition exists for all pure states of a two-party quantum system. We demonstrate that there are two ways to obtain an analogous decomposition for arbitrary rank-1 operators acting on states of a…

Quantum Physics · Physics 2020-02-17 Christopher Eltschka , Jens Siewert

We investigate the problem of finding the optimal convex decomposition of a bipartite quantum state into a separable part and a positive remainder, in which the weight of the separable part is maximal. This weight is naturally identified…

Quantum Physics · Physics 2010-07-28 Guo Chuan Thiang

We give a direct tensor decomposition for any density matrix into Hermitian operators. Based upon the decomposition we study when the mixed states are separable and generalize the separability indicators to multi-partite states and show…

Quantum Physics · Physics 2015-05-13 Xiaofen Huang , Naihuan Jing

One of the most important questions in quantum information theory is the so-called separability problem. It involves characterizing the set of separable (or, equivalently entangled) states among mixed states of a multipartite quantum…

Quantum Physics · Physics 2014-12-16 Michał Oszmaniec

We investigate the space of quantum operations, as well as the larger space of maps which are positive, but not completely positive. A constructive criterion for decomposability is presented. A certain class of unistochastic operations,…

Quantum Physics · Physics 2007-05-23 Karol Zyczkowski , Ingemar Bengtsson

We present a framework for deciding whether a quantum state is separable or entangled using covariance matrices of locally measurable observables. This leads to the covariance matrix criterion as a general separability criterion. We…

Quantum Physics · Physics 2008-12-03 Oleg Gittsovich , Otfried Gühne , Philipp Hyllus , Jens Eisert

In this paper, we consider a subclass of quantum states in the multipartite system, namely, the supersymmetric states. We investigate the problem whether they admit the symmetrically separable decomposition, i.e., each term in this…

Quantum Physics · Physics 2019-01-23 Qian Lilong , Chu Delin

In a recent paper, Amini et al. introduce a general framework to prove duality theorems between special decompositions and their dual combinatorial object. They thus unify all known ad-hoc proofs in one single theorem. While this…

Discrete Mathematics · Computer Science 2009-10-20 Laurent Lyaudet , Frédéric Mazoit , Stephan Thomasse

We present a review of the problem of finding out whether a quantum state of two or more parties is entangled or separable. After a formal definition of entangled states, we present a few criteria for identifying entangled states and…

Quantum Physics · Physics 2017-01-10 Sreetama Das , Titas Chanda , Maciej Lewenstein , Anna Sanpera , Aditi Sen De , Ujjwal Sen

We study the separability of bipartite quantum systems in arbitrary dimensions based on the Bloch representation of density matrices. We present two separability criteria for quantum states in terms of the matrices $T_{\alpha\beta}(\rho)$…

Quantum Physics · Physics 2023-05-11 Xue-Na Zhu , Jing Wang , Gui Bao , Ming Li , Shu-Qian Shen , Shao-Ming Fei

We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…

Logic in Computer Science · Computer Science 2023-06-22 Khadijeh Keshvardoost , Bartek Klin , Sławomir Lasota , Joanna Ochremiak , Szymon Toruńczyk

This paper studies the problem of decomposing a low-rank matrix into a factor with binary entries, either from $\{\pm 1\}$ or from $\{0,1\}$, and an unconstrained factor. The research answers fundamental questions about the existence and…

Data Structures and Algorithms · Computer Science 2019-08-01 Richard Kueng , Joel A. Tropp