A new bound on quantum version of Wielandt inequality for positive (not necessarily completely positive) maps has been established. Also bounds for entanglement breaking and PPT channels are put forward which are better bound than the previous bounds known. We prove that a primitive positive map E acting on Mdthat satisfies the Schwarz inequality becomes strictly positive after at most 2(d-1)2iterations. This is to say that after 2(d-1)2iterations, such a map sends every positive semidefinite matrix to a positive definite one. This finding does not depend on the number of Kraus operators as the map may not admit any Kraus decomposition. The motivation of this work is to provide an answer to a question raised by Sanz-García-Wolf and Cirac in their work on quantum Wielandt bound.
A new bound on quantum version of Wielandt inequality for positive (not necessarily completely positive) maps has been established. Also bounds for entanglement breaking and PPT channels are put forward which are better bound than the previous bounds known. We prove that a primitive positive map E acting on Mdthat satisfies the Schwarz inequality becomes strictly positive after at most 2(d-1)2iterations. This is to say that after 2(d-1)2iterations, such a map sends every positive semidefinite matrix to a positive definite one. This finding does not depend on the number of Kraus operators as the map may not admit any Kraus decomposition. The motivation of this work is to provide an answer to a question raised by Sanz-García-Wolf and Cirac in their work on quantum Wielandt bound.
In this paper, Wielandt's inequality for classical channels is extended to quantum channels. That is, an upper bound to the number of times a channel must be applied, so that it maps any density operator to one with full rank, is found. Using this bound, dichotomy theorems for the zero-error capacity of quantum channels and for the Matrix Product State (MPS) dimension of ground states of frustration-free Hamiltonians are derived. The obtained inequalities also imply new bounds on the required interaction-range of Hamiltonians with unique MPS ground state.
Quantum Wielandt's inequality gives an optimal upper bound on the minimal length k such that length- k products of elements in a generating system span Mn(C) . It is conjectured that k should be of order O(n2) in general. In this paper, we give an overview of how the question has been studied in the literature so far and its relation to a classical question in linear algebra, namely the length of the algebra Mn(C) . We provide a generic version of quantum Wielandt's inequality, which gives the optimal length with probability one. More specifically, we prove based on [KS16] that k generically is of order Θ(logn) , as opposed to the general case, in which the best bound to date is O(n2logn) . Our result implies a new bound on the primitivity index of a random quantum channel. Furthermore, we shed new light on a long-standing open problem for Projected Entangled Pair State, by concluding that almost any translation-invariant PEPS (in particular, Matrix Product State) with periodic boundary conditions on a grid with side length of order Ω(logn) is the unique ground state of a local Hamiltonian. We observe similar characteristics for matrix Lie algebras and provide numerical results for random Lie-generating systems.
Motivated by quantum thermodynamics, we first investigate the notion of strict positivity, that is, linear maps which map positive definite states to something positive definite again. We show that strict positivity is decided by the action on any full-rank state, and that the image of non-strictly positive maps lives inside a lower-dimensional subalgebra. This implies that the distance of such maps to the identity channel is lower bounded by one. The notion of strict positivity comes in handy when generalizing the majorization ordering on real vectors with respect to a positive vector d to majorization on square matrices with respect to a positive definite matrix D. For the two-dimensional case, we give a characterization of this ordering via finitely many trace norm inequalities and, moreover, investigate some of its order properties. In particular it admits a unique minimal and a maximal element. The latter is unique as well if and only if minimal eigenvalue of D has multiplicity one.
An additive and semidefinite programming (SDP) computable entanglement measure is introduced to upper bound the amount of distillable entanglement in bipartite quantum states by operations completely preserving the positivity of partial transpose (PPT). This quantity is always smaller than or equal to the logarithmic negativity, the previously best known SDP bound on distillable entanglement, and the inequality is strict in general. Furthermore, a succinct SDP characterization of the one-copy PPT deterministic distillable entanglement for any given state is also obtained, which provides a simple but useful lower bound on the PPT distillable entanglement. Remarkably, there is a genuinely mixed state of which both bounds coincide with the distillable entanglement, while being strictly less than the logarithmic negativity.
We investigate linear maps between matrix algebras that remain positive under tensor powers, i.e., under tensoring with n copies of themselves. Completely positive and completely co-positive maps are trivial examples of this kind. We show that for every n ∈ ℕ, there exist non-trivial maps with this property and that for two-dimensional Hilbert spaces there is no non-trivial map for which this holds for all n. For higher dimensions, we reduce the existence question of such non-trivial “tensor-stable positive maps” to a one-parameter family of maps and show that an affirmative answer would imply the existence of non-positive partial transpose bound entanglement. As an application, we show that any tensor-stable positive map that is not completely positive yields an upper bound on the quantum channel capacity, which for the transposition map gives the well-known cb-norm bound. We, furthermore, show that the latter is an upper bound even for the local operations and classical communications-assisted quantum capacity, and that moreover it is a strong converse rate for this task.
The theory of symmetry of quantum mechanical systems is applied to study the structure and properties of several classes of relevant maps in quantum information theory: CPTP, PPT and Schwarz maps. First, we develop the general structure that equivariant maps Φ:A→B between C∗-algebras satisfy. Then, we undertake a systematic study of unital, Hermiticity-preserving maps that are equivariant under natural unitary group actions. Schwarz maps satisfy Kadison's inequality Φ(X∗X)≥Φ(X)∗Φ(X) and form an intermediate class between positive and completely positive maps. We completely classify U(n)-equivariant on Mn(C) and determine those that are completely positive and Schwarz. Partial classifications are then obtained for the weaker DU(n)-equivariance (diagonal unitary symmetry) and for tensor-product symmetries U(n1)⊗U(n2). In each case, the parameter regions where Φ is Schwarz or completely positive are described by explicit algebraic inequalities, and their geometry is illustrated. Finally, we further show that the U(n)-equivariant family satisfies PPT⟺EB, while the DU(2), symmetric DU(3), U(2)⊗U(2) and U(2)⊗U(3), families obey the PPT2 conjecture through a direct symmetry argument. These results reveal how group symmetry controls the structure of non-completely positive maps and provide new concrete examples where the PPT2 property holds.