Related papers: Eventually Entanglement Breaking Maps
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 present a large class of indecomposable exposed positive linear maps between three dimensional matrix algebras. We also construct two qutrit separable states with lengths ten in the interior of their dual faces. With these examples, we…
It is established that both discrete and continuous semigroups of unital quantum channels are eventually mixed unitary. This result is novel even for the subclass of Schur maps and stands in sharp contrast to the resolution of the…
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…
We apply random matrix and free probability techniques to the study of linear maps of interest in quantum information theory. Random quantum channels have already been widely investigated with spectacular success. Here, we are interested in…
We have found conic programs for getting different types of quantum channels as outputs of interpolation problems. Afterwards, we have generalized our results for getting channels that belong to a convex set as outputs of the interpolation…
We construct a family of positive but not completely positive linear maps acting on four dimensional space. We employ these maps to detect bound entanglement in high dimensional quantum systems.
In this paper, we study the multiplicative behaviour of quantum channels, mathematically described by trace preserving, completely positive maps on matrix algebras. It turns out that the multiplicative domain of a unital quantum channel has…
We relate factorizable quantum channels on $M_n$, for $n \ge 2$, via their Choi matrix, to certain correlation matrices, which, in turn, are shown to be parametrized by traces on the unital free product $M_n * M_n$. Factorizable maps that…
Structural approximations to positive, but not completely positive maps are approximate physical realizations of these non-physical maps. They find applications in the design of direct entanglement detection methods. We show that many of…
We develop a framework for Matrix Product Quantum Channels (MPQCs), a one-dimensional tensor-network description of completely positive, trace-preserving maps. We focus on translation-invariant channels, generated by a single repeated…
We study families of positive and completely positive maps acting on a bipartite system $\mathbb{C}^M\otimes \mathbb{C}^N$ (with $M\leq N$). The maps have a property that when applied to any state (of a given entanglement class) they result…
This paper investigates the properties of Choi polynomials and their fundamental role in the theory of positive linear maps between matrix algebras. By focusing on Hermitian symmetric biquadratic forms, we establish a connection between the…
Entanglement breaking channels play a significant role in quantum information theory. In this work we investigate qubit channels through their property of `non-locality breaking', defined in a natural way but within the purview of CHSH…
A spontaneous symmetry-breaking order is conventionally described by a tensor-product wave-function of some few-body clusters. We discuss a type of symmetry-breaking orders, dubbed entanglement-enabled symmetry-breaking orders, which cannot…
We introduce with geometric means a density matrix decomposition of a multipartite quantum system of a finite dimension into two density matrices: a separable one, also known as the best separable approximation, and an essentially entangled…
The problem of determining whether a given quantum state is entangled lies at the heart of quantum information processing, which is known to be an NP-hard problem in general. Despite the proposed many methods such as the positive partial…
We propose the notion of process resource-breaking channels that break the resource for a quantum information processing task. We examine the same using quantum dense coding and teleportation protocols. We prove that the sets DBT (dense…
We explore the set of unitary matrices characterized by a given structure in the context of their applications in the field of Quantum Information. In the first part of the Thesis we focus on classification of special classes of unitary…
Matrices are built and designed by applying procedures from lower order matrices. Matrix tensor products, direct sums or multiplication of matrices are such procedures and a matrix built from these is said to be a {\em separable} matrix. A…