English
Related papers

Related papers: Global geometric difference between separable and …

200 papers

Let $H$ and $K$ be (finite or infinite dimensional) complex Hilbert spaces. A characterization of positive completely bounded normal linear maps from ${\mathcal B}(H)$ into ${\mathcal B}(K)$ is given, which particularly gives a…

Quantum Physics · Physics 2010-08-24 Jinchuan Hou

The problem of bound entanglement detection is a challenging aspect of quantum information theory for higher dimensional systems. Here, we propose an indecomposable positive map for two-qutrit systems, which is shown to generate a class of…

The problem of determining whether a given quantum state is entangled lies at the heart of quantum information processing, which is known to be an NP-hard problem in general. Despite the proposed many methods such as the positive partial…

Quantum Physics · Physics 2018-07-18 Sirui Lu , Shilin Huang , Keren Li , Jun Li , Jianxin Chen , Dawei Lu , Zhengfeng Ji , Yi Shen , Duanlu Zhou , Bei Zeng

We show that multipartite quantum states that have a positive partial transpose with respect to all bipartitions of the particles can outperform separable states in linear interferometers. We introduce a powerful iterative method to find…

Quantum Physics · Physics 2025-04-01 Géza Tóth , Tamás Vértesi

We analyze the separability properties of density operators supported on $\C^2\otimes \C^N$ whose partial transposes are positive operators. We show that if the rank of $\rho$ equals N then it is separable, and that bound entangled states…

Quantum Physics · Physics 2009-10-31 B. Kraus , J. I. Cirac , S. Karnas , M. Lewenstein

Every dXd bipartite system is shown to have a large family of undistillable states with nonpositive partial transpose (NPPT). This family subsumes the family of conjectured NPPT bound entangled Werner states. In particular, all one-copy…

Quantum Physics · Physics 2007-05-23 Rajiah Simon

Genuine high-dimensional entanglement, i.e. the property of having a high Schmidt number, constitutes a resource in quantum communication, overcoming limitations of low-dimensional systems. States with a positive partial transpose (PPT), on…

Quantum Physics · Physics 2018-11-21 Marcus Huber , Ludovico Lami , Cécilia Lancien , Alexander Müller-Hermes

Quantum states are the key mathematical objects in quantum mechanics, and entanglement lies at the heart of the nascent fields of quantum information processing and computation. However, there has not been a general, necessary and…

Quantum Physics · Physics 2024-10-10 Bang-Hai Wang

We consider the method of alternating projections for finding a point in the intersection of two closed sets, possibly nonconvex. Assuming only the standard transversality condition (or a weaker version thereof), we prove local linear…

Optimization and Control · Mathematics 2016-08-12 D. Drusvyatskiy , A. D. Ioffe , A. S. Lewis

In this paper, we consider a system of homogeneous algebraic equations in complex variables and their conjugates, which arise naturally from the range criterion for separability of PPT states. We examine systematically these equations to…

Quantum Physics · Physics 2015-06-02 Young-Hoon Kiem , Seung-Hyeok Kye , Joohan Na

We study separability properties in a 5-dimensional set of states of quantum systems composed of three subsystems of equal but arbitrary finite Hilbert space dimension d. These are the states, which can be written as linear combinations of…

Quantum Physics · Physics 2009-11-06 T. Eggeling , R. F. Werner

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

Power symmetric matrices defned and studied by R. Sinkhorn (1981) and their generalization by R.B. Bapat, S.K. Jain and K. Manjunatha Prasad (1999) have been utilized to give positive block matrices with trace one possessing positive…

Dynamical Systems · Mathematics 2016-01-19 Ajit Iqbal Singh

In this article, we study the class of PPT blocks. We introduce several inequalities, related to this class, with an emphasis on comparing the main diagonal and the off-diagonal components of a 2 by 2 PPT block.

Rings and Algebras · Mathematics 2023-03-07 Mohammad Alakhrass

We present a general scheme that allows for construction of scalar separability criteria from positive but not completely positive maps. The concept is based on a decomposition of every positive map $\Lambda$ into a difference of two…

Quantum Physics · Physics 2008-02-13 Remigiusz Augusiak , Julia Stasińska

We analyze entanglement and nonlocal properties of the convex set of symmetric $N$-qubits states which are diagonal in the Dicke basis. First, we demonstrate that within this set, positivity of partial transposition (PPT) is necessary and…

Quantum Physics · Physics 2017-05-03 Ruben Quesada , Swapan Rana , Anna Sanpera

We construct a parameterized family of $n\otimes n$ PPT (positive partial transpose) states of corank one for each $n\ge 3$. With a suitable choice of parameters, we show that they are $n\otimes n$ PPT entangled edge states of corank one…

Quantum Physics · Physics 2020-06-29 Jinwon Choi , Young-Hoon Kiem , Seung-Hyeok Kye

In this paper, a class of indecomposable positive finite rank elementary operators of order $(n,n)$ are constructed. This allows us to give a simple necessary and sufficient criterion for separability of pure states in bipartite systems of…

Quantum Physics · Physics 2011-07-05 Xiaofei Qi , Jinchuan Hou

Entangled quantum states can be given a separable decomposition if we relax the restriction that the local operators be quantum states. Motivated by the construction of classical simulations and local hidden variable models, we construct…

Quantum Physics · Physics 2015-11-11 Hussain Anwar , Sania Jevtic , Oliver Rudolph , Shashank Virmani

Given two triangulations of a convex polygon, computing the minimum number of flips required to transform one to the other is a long-standing open problem. It is not known whether the problem is in P or NP-complete. We prove that two…

Computational Geometry · Computer Science 2012-05-14 Anna Lubiw , Vinayak Pathak