Gluings of completely positive maps (CPMs) are defined and investigated. As a brief description of this concept consider a pair of `evolution machines', each with the ability to evolve the internal state of a `particle' inserted into its input. Each of these machines is characterized by a channel describing the operation the internal state has experienced when the particle is returned at the output. Suppose a particle is put in a superposition between the input of the first and the second machine. Here it is shown that the total evolution caused by a pair of such devices is not uniquely determined by the channels of the two machines. Such `global' channels describing the machine pair are examples of gluings of the two single machine channels. Under the limiting assumption that all involved Hilbert spaces are finite-dimensional, an expression which generates all subspace preserving gluings of a given pair of CPMs, is derived. The nature of the non-uniqueness of gluings and its relation to a proposed definition of subspace locality, is discussed.
A dynamical map is a map which takes one density operator to another. Such a map can be written in an operator-sum representation (OSR) using a spectral decomposition. The method of the construction applies to more general maps which need not be completely positive. The OSR not unique; there is a freedom to choose the set of operators in the OSR differently, yet still obtain the same map. Here we identify all maps which are equivalent to a given map. Whereas the freedom for completely positive maps is unitary, the freedom for maps which are not necessarily completely positive is pseudo-unitary…
We investigate completely positive maps for an open system interacting with its environment. The families of the initial states for which the reduced dynamics can be described by a completely positive map are identified within the framework of direct-sum decomposition of state space. They includes not only separable states with vanishing or nonvanishing quantum discord but also entangled states. A general expression of the families as well as the Kraus operators for the completely positive maps are explicitly given. It significantly extends the previous results.
We show that the set of not-completely-positive (NCP) maps is unbounded, unless further assumptions are made. This is done by first proposing a reasonable definition of a valid NCP map, which is nontrivial because NCP maps may lack a full positivity domain. The definition is motivated by specific examples. We prove that for valid NCP maps, the eigenvalue spectrum of the corresponding dynamical matrix is not bounded. Based on this, we argue that in general the volume measure of qubit maps, including NCP maps, is not well defined.
We present an "uncertainty principle" for quantum channels, showing a relationship between the dimensions of the range of a channel and the range of its complement. We examine some interesting specific cases, and discuss consequences for privacy of quantum channels.
By introducing an operator sum representation for arbitrary linear maps, we develop a generalized theory of quantum error correction (QEC) that applies to any linear map, in particular maps that are not completely positive (CP). This theory of "linear quantum error correction" is applicable in cases where the standard and restrictive assumption of a factorized initial system-bath state does not apply.
The notion of potential output purity of a completely positive map is introduced as a generalization of the regularized output purity. An upper bound is derived for this quantity, and for several classes of maps (including CQ, QC and Hadamard channels) it is shown that potential purity does not exceed the standard output purity. As an application the potential purity is used to bound the logarithmic Sobolev constant of a product of depolarizing channel semigroups.
The time evolution of an initially uncorrelated system is governed by a completely positive (CP) map. More generally, the system may contain initial (quantum) correlations with an environment, in which case the system evolves according to a not-completely positive (NCP) map. It is an interesting question what the relative measure is for these two types of maps within the set of positive maps. After indicating the scope of the full problem of computing the true volume for generic maps acting on a qubit, we study the case of Pauli channels in an abstract space whose elements represent an equival…
In this work we examine quantum states which have non-negative amplitudes (in a fixed basis) and the channels which preserve them. These states include the ground states of stoquastic Hamiltonians and they are of interest since they avoid the Sign Problem and can thus be efficiently simulated. In optimization theory, the convex cone generated by such states is called the set of completely positive (CP) matrices (not be confused with completely positive superoperators). We introduce quantum channels which preserve these states and call them completely positive completely positive. To study thes…
We expand the set of initial states of a system and its environment that are known to guarantee completely positive reduced dynamics for the system when the combined state evolves unitarily. We characterize the correlations in the initial state in terms of its quantum discord [H. Ollivier and W. H. Zurek, Phys. Rev. Lett. 88, 017901 (2001)]. We prove that initial states that have only classical correlations lead to completely positive reduced dynamics. The induced maps can be not completely positive when quantum correlations including, but not limited to, entanglement are present. We outline t…
The description of the dynamics of a system that may be correlated with its environment is only meaningful within the context of a specific framework. Different frameworks rely upon different assumptions about the initial system-environment state. We reexamine the connections between complete-positivity and quantum discord within two different sets of assumptions about the relevant family of initial states. We present an example of a system-environment state with non-vanishing quantum discord that leads to a completely-positive map. This invalidates an earlier claim on the necessity of vanishi…
We introduce a framework for the construction of completely positive maps for subsystems of indistinguishable fermionic particles. In this scenario, the initial global state is always correlated, and it is not possible to tell system and environment apart. Nonetheless, a reduced map in the operator sum representation is possible for some sets of states where the only non-classical correlation present is exchange.
Einstein introduced the locality principle which states that all physical effect in some finite space-time region does not influence its space-like separated finite region. Recently, in algebraic quantum field theory, Rédei captured the idea of the locality principle by the notion of operational separability. The operation in operational separability is performed in some finite space-time region, and leaves unchanged the state in its space-like separated finite space-time region. This operation is defined with a completely positive map. In the present paper, we justify using a completely posit…
We consider open quantum systems with factorized initial states, providing the structure of the reduced system dynamics, in terms of environment cumulants. We show that such completely positive (CP) and trace preserving (TP) maps can be unraveled by linear stochastic Schrödinger equations (SSEs) characterized by sets of colored stochastic processes (with n-th order cumulants). We obtain both the conditions such that the SSEs provide CPTP dynamics, and those for unraveling an open system dynamics. We then focus on Gaussian non-Markovian unravellings, whose known structure displays a functional …
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 discerned: one concerned with families of initial correlations that induce CP dynamics under the application of an arbitrary joint unitary on the system and environment; the other concerned with specific initial states that may be highly entangled. Here we study the latter problem, and highlight the interplay between the initial correlations and the unitary applied.…
Valid transformations between quantum states are necessarily described by completely positive maps, instead of just positive maps. Positive but not completely positive maps such as the transposition map cannot be implemented due to the existence of entanglement in composite quantum systems, but there are classes of states for which the positivity is guaranteed, e.g., states not correlated to other systems. In this paper, we introduce the concept of N-copy extension of maps to quantitatively analyze the difference between positive maps and completely positive maps. We consider implementations o…
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 construction. We also show how this package can be applied to the problem of classifying entanglement in quantum states.
Let $D$ be a space of $2\times n$ matrices. Then the face of the cone of all completely positive maps from $M_2$ into $M_n$ given by $D$ is an exposed face of the bigger cone of all decomposable positive linear maps if and only if the set of all rank one matrices in $D$ forms a subspace of $D$ together with zero and $D^\perp$ is spanned by rank one matrices.
A linear map between matrix spaces is positive if it maps positive semidefinite matrices to positive semidefinite ones, and is called completely positive if all its ampliations are positive. In this article quantitative bounds on the fraction of positive maps that are completely positive are proved. A main tool are real algebraic geometry techniques developed by Blekherman to study the gap between positive polynomials and sums of squares. Finally, an algorithm to produce positive maps which are not completely positive is given.
Given commuting families of Hermitian matrices {A1, ..., Ak} and {B1, ...., Bk}, conditions for the existence of a completely positive map L, such that L(Aj) = Bj for j = 1, ...,k, are studied. Additional properties such as unital or / and trace preserving on the map ? are also considered. Connections of the study to dilation theory, matrix inequalities, unitary orbits, and quantum information science are mentioned.
Convex sets of completely positive maps and positive semidefinite kernels are considered in the most general context of modules over $C^*$-algebras and a complete charaterization of their extreme points is obtained. As a byproduct, we determine extreme quantum instruments, preparations, channels, and extreme autocorrelation functions. Various applications to quantum information and measurement theories are given. The structure of quantum instruments is analyzed thoroughly.
In this work we show that, given a linear map from a general operator space into the dual of a C$^*$-algebra, its completely bounded norm is upper bounded by a universal constant times its $(1,cb)$-summing norm. This problem is motivated by the study of quantum XOR games in the field of quantum information theory. In particular, our results imply that for such games entangled strategies cannot be arbitrarily better than those strategies using one-way classical communication.
We introduce the concept of completely positive roots of completely positive maps on operator algebras. We do this in different forms: as asymptotic roots, proper discrete roots and as continuous one-parameter semigroups of roots. We present structural and general existence and non-existence results, some special examples in settings where we understand the situation better, and several challenging open problems. Our study is closely related to Elfving's embedding problem in classical probability and the divisibility problem of quantum channels.
It is a well-known result due to E. Størmer that every positive qubit map is decomposable into a sum of a completely positive map and a completely copositive map. Here, we generalize this result to tensor squares of qubit maps. Specifically, we show that any positive tensor product of a qubit map with itself is decomposable. This solves a recent conjecture by S. Fillipov and K. Magadov. We contrast this result with examples of non-decomposable positive maps arising as the tensor product of two distinct qubit maps or as the tensor square of a decomposable map from a qubit to a ququart. To show …
For many completely positive maps repeated compositions will eventually become entanglement breaking. To quantify this behaviour we develop a technique based on the Schmidt number: If a completely positive map breaks the entanglement with respect to any qubit ancilla, then applying it to part of a bipartite quantum state will result in a Schmidt number bounded away from the maximum possible value. Iterating this result puts a successively decreasing upper bound on the Schmidt number arising in this way from compositions of such a map. By applying this technique to completely positive maps in d…
Both completely positive and completely copositive maps stay decomposable under tensor powers, i.e under tensoring the linear map with itself. But are there other examples of maps with this property? We show that this is not the case: Any decomposable map, that is neither completely positive nor completely copositive, will lose decomposability eventually after taking enough tensor powers. Moreover, we establish explicit bounds to quantify when this happens. To prove these results we use a symmetrization technique from the theory of entanglement distillation, and analyze when certain symmetric …
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 breaking maps. We prove many equivalent conditions for a $k$-positive linear map to be $k$-entanglement breaking, thereby study the mapping cone structure of $k$-entanglement breaking maps. We discuss examples of $k$-entanglement breaking maps and some of their significance. As an application of our study, we characterize completely positive maps that reduce…