The resource theory for nonnegativity of quantum amplitudes distinguishes completely positive completely positive (CPCP) quantum channels from the larger and more tractable class of completely positive doubly nonnegative (CPDNN) quantum channels. It was left open whether there exists a qutrit-to-qubit quantum channel \(Φ:M_3\to M_2\) that is CPDNN but not CPCP. We answer this question in the negative and prove the stronger statement that every CPDNN quantum channel \(Φ:M_n\to M_2\) is CPCP for every \(n\in\mathbb N\). Equivalently, for qubit-output quantum channels the doubly nonnegative relaxation is exact.
The resource theory for nonnegativity of quantum amplitudes distinguishes completely positive completely positive (CPCP) quantum channels from the larger and more tractable class of completely positive doubly nonnegative (CPDNN) quantum channels. It was left open whether there exists a qutrit-to-qubit quantum channel (Φ:M_3\to M_2) that is CPDNN but not CPCP. We answer this question in the negative and prove the stronger statement that every CPDNN quantum channel (Φ:M_n\to M_2) is CPCP for every (n\in\mathbb N). Equivalently, for qubit-output quantum channels the doubly nonnegative relaxation is exact.
Completely positive (CP) matrices are ubiquitous in modern science and technology with applications in optimization, graph theory, and quantum entanglement. Recently, Johnston \emph{et al.} [Linear Algebra and its Applications, 2022] have cast CP matrices into the framework of quantum resource theories, where CP states serve as free states and CP-preserving channels act as free operations. This work addresses several questions raised in their work. Specifically, we provide the necessary and sufficient conditions of CP-preserving channels in small dimensions, which are necessary in higher dimensions, and discuss the resource quantification via the trace distance of non-negativity. By constructing an explicit counterexample, we demonstrate that the trace-distance measure of non-negativity violates strong monotonicity. We also provide an alternative proof that every CPDNN channel $Φ:\MM_n\to \MM_2$ is CPCP. Additionally, we show that any unital CPDNN map $Φ:\MM_2\to \MM_n$ is also CPCP.
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 these states and channels, we use the framework of resource theories and investigate how to measure and quantify this resource.
Degradable quantum channels are among the only channels whose quantum and private classical capacities are known. As such, determining the structure of these channels is a pressing open question in quantum information theory. We give a comprehensive review of what is currently known about the structure of degradable quantum channels, including a number of new results as well as alternate proofs of some known results. In the case of qubits, we provide a complete characterization of all degradable channels with two dimensional output, give a new proof that a qubit channel with two Kraus operators is either degradable or anti-degradable, and present a complete description of anti-degradable unital qubit channels with a new proof. For higher output dimensions we explore the relationship between the output and environment dimensions (dB and dE, respectively) of degradable channels. For several broad classes of channels we show that they can be modeled with an environment that is “small” in the sense of ΦC. Such channels include all those with qubit or qutrit output, those that map some pure state to an output with full rank, and all those which can be represented using simultaneously diagonal Kraus operators, even in a non-orthogonal basis. Perhaps surprisingly, we also present examples of degradable channels with “large” environments, in the sense that the minimal dimension dE>dB. Indeed, one can have dE>14dB2. These examples can also be used to give a negative answer to the question of whether additivity of the coherent information is helpful for establishing additivity for the Holevo capacity of a pair of channels. In the case of channels with diagonal Kraus operators, we describe the subclasses that are complements of entanglement breaking channels. We also obtain a number of results for channels in the convex hull of conjugations with generalized Pauli matrices. However, a number of open questions remain about these channels and the more general case of random unitary channels.
Abstract In this note we study completely positive, trace-preserving (CPT) maps M 4 ( C ) ↦ M 4 ( C ) , in particular the class of examples given by quantum Markov chains (QMCs) describing the evolution of one qubit on a 2-vertex graph. For this class of channels, and regarding its convex structure, we examine the problem of finding the extreme points both with respect to CPT maps and with respect to the set of QMCs. This is done by considering the class of maps whose image is contained in the set of block-diagonal matrices. Motivated by previous results in the literature, a practical criterion for extremality is obtained via the Choi–Jamiołkowski isomorphism and appropriate direct-sum subspaces. The study of extreme maps is natural from a structural point of view, as these play the role of indecomposable operations and provide fundamental information about the geometry of the set of quantum channels.
The complete positivity vs positivity correspondence in the Choi-Jamiołkowski-Kraus-Sudarshan quantum channel-state isomorphism depends on the choice of basis. Instead of the "canonical" basis, if we use, e.g., the Pauli spin matrices along with the identity as the basis for the space of bounded operators on the two-dimensional complex Hilbert space, this correspondence breaks down. A sufficient condition on the basis for validity of this correspondence is provided in the work of Paulsen and Shult~\cite{Paulsen}, which was later proven to be necessary by Kye~\cite{Kye}. A correspondence is also present between the space of super-maps and the tensor product of the spaces of the inputs and outputs of the same. In particular, a super-map is completely CP-preserving if and only if its Choi-type representation is completely positive (CP). This correspondence also depends on a specific choice of basis. In this work, we find the necessary and sufficient condition on a basis such that this correspondence holds true.
For a given set of input-output pairs of quantum states or observables, we ask the question whether there exists a physically implementable transformation that maps each of the inputs to the corresponding output. The physical maps on quantum states are trace-preserving completely positive maps, but we also consider variants of these requirements. We generalize the definition of complete positivity to linear maps defined on arbitrary subspaces, then formulate this notion as a semidefinite program, and relate it by duality to approximative extensions of this map. This gives a characterization of the maps which can be approximated arbitrarily well as the restriction of a map that is completely positive on the whole algebra, also yielding the familiar extension theorems on operator spaces. For quantum channel extensions and extensions by probabilistic operations we obtain semidefinite characterizations, and we also elucidate the special case of Abelian inputs or outputs. Finally, revisiting a theorem by Alberti and Uhlmann, we provide simpler and more widely applicable conditions for certain extension problems on qubits, and by using a semidefinite programming formulation we exhibit counterexamples to seemingly reasonable but false generalizations of the Alberti-Uhlmann theorem.