Related papers: Practical construction of positive maps which are …
The problem of conditions on the initial correlations between the system and the environment that lead to completely positive (CP) or not-completely positive (NCP) maps has been studied by various authors. Two lines of study may be…
We introduce a property of a matrix-valued linear map $\Phi$ that we call its "non-m-positive dimension" (or "non-mP dimension" for short), which measures how large a subspace can be if every quantum state supported on the subspace is…
Using Grothendieck approach to the tensor product of locally convex spaces we review a characterization of positive maps as well as Belavkin-Ohya characterization of PPT states. Moreover, within this scheme, \textit{ a generalization of the…
We define extension maps as maps that extend a system (through adding ancillary systems) without changing the state in the original system. We show, using extension maps, why a completely positive operation on an initially entangled system…
We give a criterion for a positive mapping on the space of operators on a Hilbert space to be indecomposable. We show that this criterion can be applied to two families of positive maps. These families of maps can then be used to form…
From the physical point of view entanglement witnesses define a universal tool for analysis and classification of quantum entangled states. From the mathematical point of view they provide highly nontrivial generalization of positive…
We investigate linear maps between matrix algebras that remain positive under tensor powers, i.e., under tensoring with $n$ copies of themselves. Completely positive and completely co-positive maps are trivial examples of this kind. We show…
We present an alternative approach to unveil a different kind of entanglement in bipartite quantum states whose diagonal zero patterns in suitable matrix representations admit a nice description in terms of triangle-free graphs. Upon…
We present a formalism to detect genuine multipartite entanglement by considering projection map which is a positive but not completely positive map. Projection map has been motivated by the no-pancake theorem which repudiates the existence…
Probabilistic circuits (PCs) are a class of tractable probabilistic models that allow efficient, often linear-time, inference of queries such as marginals and most probable explanations (MPE). However, marginal MAP, which is central to many…
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…
Entanglement plays a crucial role in quantum physics and is the key resource in quantum information processing. However, entanglement detection and quantification are believed to be hard due to the operational impracticality of existing…
Purity testing protocols (PTPs), i.e., protocols that decide with high probability whether or not a distributed bipartite quantum state is maximally entangled, have been proven to be a useful tool in many quantum communication applications.…
Quantum entanglement is a fundamental property of quantum mechanics and plays a crucial role in quantum computation and information. We study entanglement via the lens of computational complexity by considering quantum generalizations of…
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 describe a quantum algorithm for preparing states that encode solutions of non-homogeneous linear partial differential equations. The algorithm is a continuous-variable version of matrix inversion: it efficiently inverts differential…
When applying eigenvalue decomposition on the quadratic term matrix in a type of linear equally constrained quadratic programming (EQP), there exists a linear mapping to project optimal solutions between the new EQP formulation where $Q$ is…
PENLAB is an open source software package for nonlinear optimization, linear and nonlinear semidefinite optimization and any combination of these. It is written entirely in MATLAB. PENLAB is a young brother of our code PENNON \cite{pennon}…
In \cite{CMW19}, the authors introduced $k$-entanglement breaking linear maps to understand the entanglement breaking property of completely positive maps on taking composition. In this article, we do a systematic study of $k$-entanglement…
Quantum simulation is a powerful tool to study the properties of quantum systems. The dynamics of open quantum systems are often described by Completely Positive (CP) maps, for which several quantum simulation schemes exist. We present a…