Related papers: Generating Non-Decomposable Maps with Differentiab…
Recently, a lot of attention has been devoted to finding physically realisable operations that realise as closely as possible certain desired transformations between quantum states, e.g. quantum cloning, teleportation, quantum gates, etc.…
Positive maps are useful for detecting entanglement in quantum information theory. Any entangled state can be detected by some positive map. In this paper, the relation between positive block matrices and completely positive…
We study $k$-positive linear maps on matrix algebras and address two problems, (i) characterizations of $k$-positivity and (ii) generation of non-decomposable $k$-positive maps. On the characterization side, we derive optimization-based…
Semidefinite programs (SDPs) are a framework for exact or approximate optimization that have widespread application in quantum information theory. We introduce a new method for using reductions to construct integrality gaps for SDPs. These…
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…
Semidefinite programming (SDP) is a powerful framework from convex optimization that has striking potential for data science applications. This paper develops a provably correct randomized algorithm for solving large, weakly constrained SDP…
We study dynamical semigroups of positive, but not completely positive maps on finite-dimensional bipartite systems and analyze properties of their generators in relation to non-decomposability and bound-entanglement. An example of…
This paper investigates the properties of Choi polynomials and their fundamental role in the theory of positive linear maps between matrix algebras. By focusing on Hermitian symmetric biquadratic forms, we establish a connection between the…
This article introduces PnCP, a MATLAB toolbox for constructing positive maps which are not completely positive. We survey optimization and sum of squares relaxation techniques to find the most numerically efficient methods for this…
We introduce a new family of indecomposable positive linear maps based on entangled quantum states. Central to our construction is the notion of an unextendible product basis. The construction lets us create indecomposable positive linear…
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…
The problem of entanglement detection is a long standing problem in quantum information theory. One of the primary procedures of detecting entanglement is to find the suitable positive but non-completely positive maps. Here we try to give a…
In this paper we describe a new connection between UPB (unextendable product bases) and P (positive) maps which are not CP (completely positive). We show that inner automorphisms of the set of P maps which are not CP, produce extremal…
A family of linear positive maps in the algebra of $3 \times 3$ complex matrices proposed recently in Bera et al. arXiv:2212.03807 is further analyzed. It provides a generalization of a seminal Choi nondecomposable extremal map in $M_3$. We…
Physical transformations are described by linear maps that are completely positive and trace preserving (CPTP). However, maps that are positive (P) but not completely positive (CP) are instrumental to derive separability/entanglement…
We use open quantum system techniques to construct one-parameter semigroups of positive maps and apply them to study the entanglement properties of a class of 16-dimensional density matrices, representing states of a 4x4 bipartite system.
We apply random matrix and free probability techniques to the study of linear maps of interest in quantum information theory. Random quantum channels have already been widely investigated with spectacular success. Here, we are interested in…
Exposed positive maps in matrix algebras define a dense subset of extremal maps. We provide a class of indecomposable positive maps in the algebra of 2n x 2n complex matrices with n>1. It is shown that these maps are exposed and hence…
It is well-known that by adding integrality constraints to the semidefinite programming (SDP) relaxation of the max-cut problem, the resulting integer semidefinite program is an exact formulation of the problem. In this paper we show…
This paper presents a comprehensive exploration of semi-definite programming (SDP) techniques within the context of quantum information. It examines the mathematical foundations of convex optimization, duality, and SDP formulations,…