Related papers: Factorizations of Quantum Channels
In this paper, we obtain results for factorizability of quantum channels. Firstly, we prove that if a tensor $T\otimes S_k$ of a quantum channel $T$ on $M_n(\mathbb{C})$ with the completely depolarizing channel $S_k$ is written as a convex…
Quantum channels can be mathematically represented as completely positive trace-preserving maps that act on a density matrix. A general quantum channel can be written as a convex sum of `extremal' channels. We show that for an $N$-level…
We investigate the possibility of dividing quantum channels into concatenations of other channels, thereby studying the semigroup structure of the set of completely-positive trace-preserving maps. We show the existence of 'indivisible'…
We introduce twisted matrix factorizations for quantum complete intersections of codimension two. For such an algebra, we show that in a given dimension, almost all the indecomposable modules with bounded minimal projective resolutions…
Quantum channels, which are completely positive and trace preserving mappings, can alter the dimension of a system; e.g., a quantum channel from a qubit to a qutrit. We study the convex set properties of dimension-altering quantum channels,…
This paper continues the study of stochastic maps, or channels, which break entanglement. We give a detailed description of entanglement-breaking qubit channels, and show that such maps are precisely the convex hull of those known as…
We determine the minimal experimental resources that ensure a unique solution in the estimation of trace-preserving quantum channels with both direct and convex optimization methods. A convenient parametrization of the constrained set is…
We derive approximation algorithms for the nonnegative matrix factorization problem, i.e. the problem of factorizing a matrix as the product of two matrices with nonnegative coefficients. We form convex approximations of this problem which…
We present a simple, dimension-independent criterion which guarantees that some quantum channel $\Phi$ is divisible, i.e. that there exists a non-trivial factorization $\Phi=\Phi_1\Phi_2$. The idea is to first define an "elementary" channel…
Recently, convex formulations of low-rank matrix factorization problems have received considerable attention in machine learning. However, such formulations often require solving for a matrix of the size of the data matrix, making it…
Two common approaches in low-rank optimization problems are either working directly with a rank constraint on the matrix variable, or optimizing over a low-rank factorization so that the rank constraint is implicitly ensured. In this paper,…
Understanding quantum channels and the strange behavior of their capacities is a key objective of quantum information theory. Here we study a remarkably simple, low-dimensional, single-parameter family of quantum channels with exotic…
Parametric models in vector spaces are shown to possess an associated linear map. This linear operator leads directly to reproducing kernel Hilbert spaces and affine- / linear- representations in terms of tensor products. From the…
To decide whether a quantum channel is degradable is relatively easy: one has to find at least one example of a degrading quantum channel. But in general, no conclusive criterion exists to show the opposite. Using elementary methods we…
We study the dynamics of two lower bounds of concurrence in bipartite quantum systems when one party goes through an arbitrary channel. We show that these lower bounds obey the factorization law similar to that of [Konrad et al., Nat. Phys.…
Quantum process tomography is often used to completely characterize an unknown quantum process. However, it may lead to an unphysical process matrix, which will cause the loss of information respect to the tomography result. Convex…
In this paper we will demonstrate that any compact quantum group can be used as symmetry groups for quantum channels, which leads us to the concept of covariant channels. We, then, unearth the structure of the convex set of covariant…
This paper introduces a method for calculating the quantum relative entropy of channels, an essential quantity in quantum channel discrimination and resource theories of quantum channels. By building on recent developments in the…
Quantum channels, a subset of quantum maps, describe the unitary and non-unitary evolution of quantum systems. We study a generalization of the concept of Pauli maps to the case of multipartite high dimensional quantum systems through the…
We survey what is known about the information transmitting capacities of quantum channels, and give a proposal for how to calculate some of these capacities using linear programming.