Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2003.07889 · Quantum

On the Alberti-Uhlmann Condition for Unital Channels

Sagnik Chakraborty, Dariusz Chruściński, Gniewomir Sarbicki, Frederik vom Ende

Published Nov 8, 2020• 1 citation
arXivHTMLPDF

Abstract

We address the problem of existence of completely positive trace preserving (CPTP) maps between two sets of density matrices. We refine the result of Alberti and Uhlmann and derive a necessary and sufficient condition for the existence of a unital channel between two pairs of qubit states which ultimately boils down to three simple inequalities.

DOI
10.22331/q-2020-11-08-360

Related papers

CP-preserving channels

Indu Bala, Sourav Das, Swapan Rana

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.

quant-pharXiv:2607.24682•Jul 28, 2026•0 citations

Physical transformations between quantum states

Zejun Huang, Chi-Kwong Li, Edward Poon +1 more

Given two sets of quantum states {A1, …, Ak} and {B1, …, Bk}, represented as sets as density matrices, necessary and sufficient conditions are obtained for the existence of a physical transformation T, represented as a trace-preserving completely positive map, such that T(Ai) = Bi for i = 1, …, k. General completely positive maps without the trace-preserving requirement, and unital completely positive maps transforming the states are also considered.

arXiv:1203.5547•Journal of Mathematical Physics•Oct 1, 2012•20 citations

Extending quantum operations

Teiko Heinosaari, Maria Anastasia Jivulescu, David Reeb +1 more

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.

arXiv:1205.0641•Journal of Mathematical Physics•Oct 1, 2012•43 citations

Notes on completely positive map

Haiyang Li

The sufficient and necessary conditions of positive and trace preserving map,completely positive and trace preserving map are given and proved so as to they can be well-understanded and used,the convexity of quantum channels is also proved.

Computer Engineering and Applications Journal•Jan 1, 2011•0 citations

On the extreme points of quantum channels

Shmuel Friedland, Raphael Loewy

Let Lm,n denote the convex set of completely positive trace preserving operators from Cm×m to Cn×n, i.e. quantum channels. We give a necessary condition for L∈Lm,n to be an extreme point. We show that generically, this condition is also sufficient. We characterize completely the extreme points of L2,2 and L3,2, i.e. quantum channels from qubits to qubits and from qutrits to qubits.

•Jan 1, 2013•13 citations

On the Extremality of the Tensor Product of Quantum Channels

James Miller S. T. da Silva

Completely positive and trace preserving (CPT) maps are important for Quantum Information Theory, because they describe a broad class of of transformations of quantum states. There are also two other related classes of maps, the unital completely positive (UCP) maps and the unital completely positive and trace preserving (UCPT) maps. For these three classes, the maps from a finite dimensional Hilbert space $X$ to another one $Y$ is a compact convex set and, as such, it is the convex hull of its extreme points. The extreme points of these convex sets are yet not well understood. In this article we investigate the preservation of extremality under the tensor product. We prove that extremality is preserved for CPT or UCP maps, but for UCPT it is not always preserved.

arXiv:2305.05795•May 9, 2023•0 citations
We address the problem of existence of completely positive trace preserving (CPTP) maps between two sets of density matrices. We refine the result of Alberti and Uhlmann and derive a necessary and sufficient condition for the existence of a unital channel between two pairs of qubit states which ultimately boils down to three simple inequalities.
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.
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.
Completely positive and trace preserving (CPT) maps are important for Quantum Information Theory, because they describe a broad class of of transformations of quantum states. There are also two other related classes of maps, the unital completely positive (UCP) maps and the unital completely positive and trace preserving (UCPT) maps. For these three classes, the maps from a finite dimensional Hilbert space XXX to another one YYY is a compact convex set and, as such, it is the convex hull of its extreme points. The extreme points of these convex sets are yet not well understood. In this article we investigate the preservation of extremality under the tensor product. We prove that extremality is preserved for CPT or UCP maps, but for UCPT it is not always preserved.