Related papers: A new bound on quantum Wielandt inequality
We introduce and study two new classes of unital quantum channels. The first class describes a 2-parameter family of channels given by completely positive (CP) maps $M_3({\bf C}) \mapsto M_3({\bf C})$ which are both unital and…
The quantum capacity captures the value of a quantum channel for transmitting quantum information, establishing the fundamental limits on quantum communication. In spite of its central role in quantum information theory, the quantum…
We introduce a reversible theory of exact entanglement manipulation by establishing a necessary and sufficient condition for state transfer under trace-preserving transformations that completely preserve the positivity of partial transpose…
Let C: {0,1}^n -> {0,1}^m be a code encoding an n-bit string into an m-bit string. Such a code is called a (q, c, e) smooth code if there exists a decoding algorithm which while decoding any bit of the input, makes at most q probes on the…
In this article new bounds on weighted p-norms of ambiguity functions and Wigner functions are derived. Such norms occur frequently in several areas of physics and engineering. In pulse optimization for Weyl--Heisenberg signaling in…
Quantum information theory has generated several interesting conjectures involving products of completely positive maps on matrix algebras, also known as quantum channels. In particular it is conjectured that the output state with maximal…
Recently the power of positive partial transpose preserving (PPTp) and no-signalling (NS) codes in quantum communication has been studied. We continue with this line of research and show that the NS/PPTp/NS$\cap$PPTp codes assisted…
We outline a new approach to the characterization as well as to the classification of positive maps. This approach is based on the facial structures of the set of states and of the cone of positive maps. In particular, the equivalence…
We develop a new refinement of the Kato's inequality and using this refinement we obtain several upper bounds for the numerical radius of a bounded linear operator as well as the product of operators, which improve the well known existing…
We describe the structure of all bijective maps on the cone of positive definite operators acting on a finite and at least two-dimensional complex Hilbert space which preserve the quantum $\chi_\alpha^2$-divergence for some $\alpha \in…
Matrix scaling is a simple to state, yet widely applicable linear-algebraic problem: the goal is to scale the rows and columns of a given non-negative matrix such that the rescaled matrix has prescribed row and column sums. Motivated by…
Let $e^{-tL}$ be a analytic semigroup generated by $-L$, where $L$ is a non-negative self-adjoint operator on $L^2(\mathbb{R}^d)$. Assume that the kernels of $e^{-tL}$, denoted by $p_t(x,y)$, only satisfy the upper bound: for all $N>0$,…
For bipartite quantum states we obtain lower bounds on two important entanglement measures, concurrence and negativity, studying the inequalities for the expectation value of a projector on some subspace of the Hilbert space. Several…
We present new conditions for semigroups of positive operators to converge strongly as time tends to infinity. Our proofs are based on a novel approach combining the well-known splitting theorem by Jacobs, de Leeuw and Glicksberg with a…
We consider a family of vector and operator norms defined by the Schmidt decomposition theorem for quantum states. We use these norms to tackle two fundamental problems in quantum information theory: the classification problem for…
A map $\mathcal{P}$ is tensor stable positive (tsp) if $\mathcal{P}^{\otimes n}$ is positive for all $n$, and essential tsp if it is not completely positive or completely co-positive. Are there essential tsp maps? Here we prove that there…
We implement the so-called Weyl-Heisenberg covariant integral quantization in the case of a classical system constrained by a bounded or semi-bounded geometry. The procedure, which is free of the ordering problem of operators, is…
Bipartite entangled quantum states with a positive partial transpose (PPT), i.e., PPT entangled states, are usually considered very weakly entangled. Since no pure entanglement can be distilled from them, they are also called bound…
A contemporary technological milestone is to build a quantum device performing a computational task beyond the capability of any classical computer, an achievement known as quantum adversarial advantage. In what ways can the entanglement…
The low-rank matrix completion problem asks whether a given real matrix with missing values can be completed so that the resulting matrix has low rank or is close to a low-rank matrix. The completed matrix is often required to satisfy…