Determinantal and eigenvalue inequalities for matrices with numerical ranges in a sector

Let A = \pmatrix A_{11} & A_{12} \cr A_{21} & A_{22}\cr\pmatrix \in M_n, where $A_{11} \in M_m$ with $m \le n/2$, be such that the numerical range of $A$ lies in the set \{e^{i\varphi} z \in \IC: |\Im z| \le (\Re z) \tan \alpha\}, for some $\varphi \in [0, 2\pi)$ and $\alpha \in [0, \pi/2)$. We obtain the optimal containment region for the generalized eigenvalue $\lambda$ satisfying \lambda \pmatrix A_{11} & 0 \cr 0 & A_{22}\cr\pmatrix x = \pmatrix 0 & A_{12} \cr A_{21} & 0\cr\pmatrix x \quad \hbox{for some nonzero} x \in \IC^n, and the optimal eigenvalue containment region of the matrix $I_m - A_{11}^{-1}A_{12} A_{22}^{-1}A_{21}$ in case $A_{11}$ and $A_{22}$ are invertible. From this result, one can show $|\det(A)| \le \sec^{2m}(\alpha) |\det(A_{11})\det(A_{22})|$. In particular, if $A$ is a accretive-dissipative matrix, then $|\det(A)| \le 2^m |\det(A_{11})\det(A_{22})|$. These affirm some conjectures of Drury and Lin.Comment: 6 pages, to appear in Journal of Mathematical Analysi

Canonical forms, higher rank numerical range, convexity, totally isotropic subspace, matrix equations

Results on matrix canonical forms are used to give a complete description of the higher rank numerical range of matrices arising from the study of quantum error correction. It is shown that the set can be obtained as the intersection of closed half planes (of complex numbers). As a result, it is always a convex set in $\mathcal C$. Moreover, the higher rank numerical range of a normal matrix is a convex polygon determined by the eigenvalues. These two consequences confirm the conjectures of Choi et al. on the subject. In addition, the results are used to derive a formula for the optimal upper bound for the dimension of a totally isotropic subspace of a square matrix, and verify the solvability of certain matrix equations.Comment: 10 pages. To appear in Proceedings of the American Mathematical Societ

Linear preservers and quantum information science

Let $m,n\ge 2$ be positive integers, $M_m$ the set of $m\times m$ complex matrices and $M_n$ the set of $n\times n$ complex matrices. Regard $M_{mn}$ as the tensor space $M_m\otimes M_n$. Suppose $|\cdot|$ is the Ky Fan $k$-norm with $1 \le k \le mn$, or the Schatten $p$-norm with $1 \le p \le \infty$ ($p\ne 2$) on $M_{mn}$. It is shown that a linear map $\phi: M_{mn} \rightarrow M_{mn}$ satisfying $$|A\otimes B| = |\phi(A\otimes B)|$$ for all $A \in M_m$ and $B \in M_n$ if and only if there are unitary $U, V \in M_{mn}$ such that $\phi$ has the form $A\otimes B \mapsto U(\varphi_1(A) \otimes \varphi_2(B))V$, where $\varphi_i(X)$ is either the identity map $X \mapsto X$ or the transposition map $X \mapsto X^t$. The results are extended to tensor space $M_{n_1} \otimes ... \otimes M_{n_m}$ of higher level. The connection of the problem to quantum information science is mentioned.Comment: 13 page

Maximal noiseless code rates for collective rotation channels on qudits

We study noiseless subsystems on collective rotation channels of qudits, i.e., quantum channels with operators in the set ${\mathcal E}(d,n) = \{ U^{\otimes n}: U \in {\mathrm{SU}}(d)\}.$ This is done by analyzing the decomposition of the algebra ${\mathcal A}(d,n)$ generated by ${\mathcal E}(d,n)$. We summarize the results for the channels on qubits ($d=2$), and obtain the maximum dimension of the noiseless subsystem that can be used as the quantum error correction code for the channel. Then we extend our results to general $d$. In particular, it is shown that the code rate, i.e., the number of protected qudits over the number of physical qudits, always approaches 1 for a suitable noiseless subsystem. Moreover, one can determine the maximum dimension of the noiseless subsystem by solving a non-trivial discrete optimization problem. The maximum dimension of the noiseless subsystem for $d = 3$ (qutrits) is explicitly determined by a combination of mathematical analysis and the symbolic software Mathematica.Comment: 16 pages, proofs are put in Appendix for clearer presentation. Title has been changed and some related materials, such as quantum secret sharing and erasure errors, are mentione

Physical transformations between quantum states

Given two sets of quantum states {A_1, ..., A_k} and {B_1, ..., B_k}, represented as sets of density matrices, necessary and sufficient conditions are obtained for the existence of a physical transformation T, represented as a trace-preserving completely positive map, such that T(A_i) = B_i for i = 1, ..., k. General completely positive maps without the trace-preserving requirement, and unital completely positive maps transforming the states are also considered

Recursive encoding and decoding of the noiseless subsystem for qudits

We give a full explanation of the noiseless subsystem that protects a single-qubit against collective errors and the corresponding recursive scheme described by C.-K. Li et. al. [Phys. Rev. A 84, 044301 (2011)] from a representation theory point of view. Furthermore, we extend the construction to qudits under the influence of collective SU($d$) errors. We find that under this recursive scheme, the asymptotic encoding rate is $1/d$