Related papers: Accessible maps in a group of classical or quantum…
Birkhoff's Theorem states that doubly stochastic matrices are convex combinations of permutation matrices. Quantum mechanically these matrices are doubly stochastic channels, i.e. they are completely positive maps preserving both the trace…
We investigate the set of quantum channels acting on a single qubit. We provide an alternative, compact generalization of the Fujiwara-Algoet conditions for complete positivity to non-unital qubit channels, which we then use to characterize…
We introduce the notion of one-sided mapping cones of positive linear maps between matrix algebras. These are convex cones of maps that are invariant under compositions by completely positive maps from either the left or right side. The…
The invisibility graph $I(X)$ of a set $X \subseteq \mathbb{R}^d$ is a (possibly infinite) graph whose vertices are the points of $X$ and two vertices are connected by an edge if and only if the straight-line segment connecting the two…
In the present work we review and refine some results about fixed points of semigroups of quantum channels. Noncommutative potential theory enables us to show that the set of fixed points of a recurrent semigroup is a W*-algebra; aside from…
We study the symmetric-side-channel-assisted private capacity of a quantum channel, for which we provide a single-letter formula. This capacity is additive, convex, and, for degradable channels, equal to the unassisted private capacity.…
In this paper we develop a theory of convexity for a free Abelian group M (the lattice of integer points), which we call theory of discrete convexity. We characterize those subsets X of the group M that could be call "convex". One property…
The role of CP-indivisibility and incompatibility as valuable resources for various information-theoretic tasks is widely acknowledged. This study delves into the intricate relationship between CP-divisibility and channel compatibility. Our…
We study the additivity problems for the classical capacity of quantum channels, the minimal output entropy and its convex closure. We show for each of them that additivity for arbitrary pairs of channels holds iff it holds for arbitrary…
A quantum graph $\mathcal{G}$ housed by a matrix algebra $M_n$ can be encoded as an operator system $\mathcal S=\mathcal{S}_{\mathcal{G}}\le M_n$. There are two sensible notions of quantum automorphism group for any such:…
We consider several basic questions pertaining to the geometry of image of a general quadratic map. In general the image of a quadratic map is non-convex, although there are several known classes of quadratic maps when the image is convex.…
What sets A \subset Z^n can be written in the form (K-K) \cap Z^n, where K is a compact subset of R^n such that K+Z^n=R^n? Such sets A are called achievable, and it is known that if A is achievable, then < A >=Z^n. This condition completely…
Given a finite set $V$, a convexity $\mathscr{C}$, is a collection of subsets of $V$ that contains both the empty set and the set $V$ and is closed under intersections. The elements of $\mathscr{C}$ are called convex sets. The digital…
A natural and intrinsic characterization of the structure of the set $\mathfrak{C}$ of positive unital maps is given, i.e. it is shown that $\mathfrak{C}$ is isometrically isomorphic to the subset $\gD$ of bp-positive density matrices…
Understanding design decisions in relation to the future occupants of a building is a crucial part of good design. However, limitations in tools and expertise hinder meaningful human-centric decisions during the design process. In this…
The concept of divisibility of dynamical maps is used to introduce an analogous concept for quantum channels by analyzing the \textit{simulability} of channels by means of dynamical maps. In particular, this is addressed for Lindblad…
Several results concerning pairs of polynomially convex sets whose union is not even rationally convex are given. It is shown that there is no restriction on how two spaces can be embedded in some $\C^N$ so as to be polynomially convex but…
We initiate the systematic study of resource theories of quantum channels, i.e. of the dynamics that quantum systems undergo by completely positive maps, in abstracto: Resources are in principle all maps from one quantum system to another,…
Quantum groups and non-commutative spaces have been repeatedly utilized in approaches to quantum gravity. They provide a mathematically elegant cut-off, often interpreted as related to the Planck-scale quantum uncertainty in position. We…
A set $D$ of vertices in a graph $G$ is a dominating set if every vertex of $G$, which is not in $D$, has a neighbor in $D$. A set of vertices $D$ in $G$ is convex (respectively, isometric), if all vertices in all shortest paths…