Numerous results are presented that characterize when a complex Hermitian matrix is Birkhoff-James orthogonal, in the trace norm, to a (Hermitian) positive semidefinite matrix or set of positive semidefinite matrices. For example, a simple-to-test criterion that determines which Hermitian matrices are Birkhoff-James orthogonal, in the trace norm, to the set of all positive semidefinite diagonal matrices is developed. Applications in the theory of quantum resources are explored. For example, the quantum states that have modified trace distance of coherence equal to $1$ (the maximal possible value) are characterized, and a connection between the modified trace distance of $2$-entanglement and the NPPT bound entanglement problem is established.
Numerous results are presented that characterize when a complex Hermitian matrix is Birkhoff-James orthogonal, in the trace norm, to a (Hermitian) positive semidefinite matrix or set of positive semidefinite matrices. For example, a simple-to-test criterion that determines which Hermitian matrices are Birkhoff-James orthogonal, in the trace norm, to the set of all positive semidefinite diagonal matrices is developed. Applications in the theory of quantum resources are explored. For example, the quantum states that have modified trace distance of coherence equal to 1 (the maximal possible value) are characterized, and a connection between the modified trace distance of 2-entanglement and the NPPT bound entanglement problem is established.
Abstract. We consider a family of vector and operator norms which we refer to as Schmidt norms. We show that these norms have several uses in quantum information theory – they can be used to help classify k-positive linear maps (and hence entanglement witnesses), they are useful for approaching the problem of finding non-positive partial transpose bound entangled Werner states, they are related to the quantum fidelity and trace distance measures, and they are connected to the recently-defined local numerical range. We show that the vector norms can be explicitly calculated, and we derive several inequalities in order to bound the operator norms and compute them in special cases. We show that one particular entangled Werner state is bound entangled if and only if a certain norm inequality holds on a given family of projections, and we use our inequalities to study that family of projections. We also develop a family of semidefinite programs that can be used to further bound the operator norms. We extend these norms to arbitrary convex mapping cones and explore their implications with positive partial transpose states. 1.
There are various notions of positivity for matrices and linear matrix-valued maps that play important roles in quantum information theory. The cones of positive semidefinite matrices and completely positive linear maps, which represent quantum states and quantum channels respectively, are the most ubiquitous positive cones. There are also many natural cones that can been regarded as "more" or "less" positive than these standard examples. In particular, entanglement theory deals with the cones of separable operators and entanglement witnesses, which satisfy very strong and weak positivity properties respectively. Rather complementary to the various cones that arise in entanglement theory are norms. The trace and operator norms for operators and the diamond and completely bounded norms for superoperators are the typical norms that are seen throughout quantum information theory. In this work our main goal is to develop a family of norms that play a role analogous to the cone of entanglement witnesses. We investigate the basic mathematical properties of these norms, including their relationships with other well-known norms, their isometry groups, and their dual norms. We also make the place of these norms in entanglement theory rigorous by showing that entanglement witnesses arise from minimal operator systems, and analogously our norms arise from minimal operator spaces. Finally, we connect the various cones and norms considered here to several seemingly unrelated problems from other areas. We characterize the problem of whether or not non-positive partial transpose bound entangled states exist in terms of one of our norms, and provide evidence in favour of their existence. We also characterize the minimum gate fidelity of a quantum channel, the maximum output purity and its completely bounded counterpart, and the geometric measure of entanglement in terms of these norms.
Let Sm be the set of all m×m density matrices (Hermitian positively semi-definite matrices of unit trace). Consider a problem of estimation of an unknown density matrix ρ∈Sm based on outcomes of n measurements of observables X1,…,Xn∈Hm (Hm being the space of m×m Hermitian matrices) for a quantum system identically prepared n times in state ρ. Outcomes Y1,…,Yn of such measurements could be described by a trace regression model in which Eρ(Yj∣Xj)=tr(ρXj),j=1,…,n. The design variables X1,…,Xn are often sampled at random from the uniform distribution in an orthonormal basis {E1,…,Em2} of Hm (such as Pauli basis). The goal is to estimate the unknown density matrix ρ based on the data (X1,Y1),…,(Xn,Yn). Let Z^:=nm2∑j=1nYjXj and let ρˇ be the projection of Z^ onto the convex set Sm of density matrices. It is shown that for estimator ρˇ the minimax lower bounds in classes of low rank density matrices (established earlier) are attained up logarithmic factors for all Schatten p-norm distances, p∈[1,∞] and for Bures version of quantum Hellinger distance. Moreover, for a slightly modified version of estimator ρˇ the same property holds also for quantum relative entropy (Kullback-Leibler) distance between density matrices.
This thesis explores the applications of matrix spaces in quantum information and computational complexity, specifically in the areas of quantum state/channel discrimination, entanglement transformation and isomorphism testing. We achieve the following contributions: \n•\tWe derive a necessary condition which determines whether a set of orthogonal bipartite states can be distinguished by positive-partial-transpose (PPT) operations, in the many-copy scenario. We reduce the discrimination task to the following problem: Decide whether there exist a nonzero bipartite matrix with positive partial-transpose, such that all its eigenvectors with nonzero eigenvalues is orthogonal to a given bipartite vector space. As applications, we reprove and extend a variety of existing results, including the local indistinguishability of the bipartite maximally entangled state and its orthogonal complement [Yu, Duan and Ying, IEEE transaction on Information Theory, 2014] and the maximum dimension of non-positive-partial-transpose subspaces [Johnston, Physical Review A, 2013]. \n•\tWe show that determining the parallel distinguishability of quantum channels is equivalent to determining whether the orthogonal complement of a given matrix space contains nonzero positive semidefinite matrices. Our characterization immediately implies a necessary condition to decide the parallel distinguishability. We further prove that our condition is also sufficient for two large families of quantum channels, which leads to an alternating proof for the parallel distinguishability of unitary operations [Acín, Physical Review Letters, 2001]. We also present an illustrative example showing our necessary condition cannot determine the parallel distinguishability. \n•\tWe systematically study the tripartite-to-bipartite entanglement transformations by stochastic local operations and classical communication (SLOCC). Such a problem is equivalent to computing the maximal rank of a matrix space [Chitambar, Duan and Shi, Physical Review A, 2010]. We analyze the SLOCC convertibility in both the finite-copy and asymptotic regimes. In particular, we derive explicit formulas which compute asymptotic entanglement transformation rates for two families of tripartite states by resorting to certain results of the structure of matrix spaces, including the study of matrix semi-invariants. Significantly, we show that the problem of deciding the asymptotic SLOCC convertibility of tripartite pure states to the bipartite maximally entangled states and the non-commutative symbolic determinant identity testing problem is algorithmically equivalent, which builds a new connection between problems in algebraic complexity and problems in asymptotic SLOCC entanglement transformations. \n•\tWe devise algorithms which test isometry between alternating matrix spaces over finite field. Algorithms for such a problem in time polynomial in the underlying vector space size resolves the believed bottleneck case of the group isomorphism problem, i.e. testing isomorphism of p-groups of class 2 and exponent p in time polynomial in the group order. Our approach is to view it as a linear algebraic analog of the graph isomorphism problem. We devise an average-case efficient algorithm for the alternating matrix space isometry problem over a key range of parameters. in a random model of alternating matrix spaces in vein of the Erdős-Rényi model of random graphs. To devise our algorithm, we developed linear algebraic individualization and refinement techniques, which are crucial in the first average-case efficient algorithm for graph isomorphism, devised by Babai, Erdős, and Selkow in the 1970s [Babai, Erdős and Selkow, SIAM Journal on Computing, 1980]. We also adapt Luks' dynamic programming technique for graph isomorphism [Luks, STOC, 1999] to slightly improve the worst-case time complexity of the alternating matrix space isometry problem.
Let H be a positive semi-definite matrix partitioned in β×β Hermitian blocks, H=[As,t], 1≤s,t,≤β. Then, for all symmetric norms, {equation*} \| H \| \le \| \sum_{s=1}^β A_{s,s} \|. {equation*} The proof uses a nice decomposition for positive matrices and unitary congruences with the generators of a Clifford algebra. A few corollaries are given, in particular the partial trace operation increases norms of separable states on a real Hilbert space, leading to a conjecture for usual complex Hilbert spaces.
In the studies of quantum information and computation, the quantum correlations
present in a non-classical system are seen as natural resources. In this
thesis, we present a detailed study on quantification and characterization of
multipartite quantum entanglement from a geometric perspective. Furthermore,
we present protocols and algorithms where quantum correlations such
as entanglement, quantum Fisher information, and quantum superposition
have been used to provide advantages as well securities in quantum communication
tasks, quantum speed-up, and protection against the decoherence in
an open quantum system.
First, we use a geometric measure of entanglement quantification based
on Euclidean distance of the Hermitian matrices to obtain the minimum distance
between the set of bipartite n- qudit density matrices with a positive
partial transpose and the maximally mixed state. This minimum distance coincides
with the radius of the largest separable ball. We present the interior
geometry of the set of all positive semidefinite matrices and identify a particular
class of Werner states for which the Peres-Horodecki criterion is both
necessary and sufficient for separability even in the dimensions greater than
six.