Linear maps preserving numerical radius of tensor product of matrices
We determine the structure of linear maps on the tensor product of matrices which preserve the numerical range or numerical radius.
math.FA↗
arXiv subjects
Nung-Sing Sze
Publications and source records attributed to Nung-Sing Sze.
Linear maps preserving the higher numerical ranges of tensor product of matrices
We study linear maps preserving the higher numerical ranges of tensor product of matrices.
math.FA↗
Linear maps preserving Ky Fan norms and Schatten norms of tensor products of matrices
For a positive integer $n$, let $M_n$ be the set of $n\times n$ complex matrices. 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}$, where $m,n\ge 2$ are positive integers. It is shown that a linear map $ϕ: M_{mn} \rightarrow M_{mn}$ satisfying $$\|A\otimes B\| = \|ϕ(A\otimes B)\| \quad \hbox{for all} A \in M_m \hbox{and} B \in M_n$$ if and only if there are unitary $U, V \in M_{mn}$ such that $ϕ$ has the form $A\otimes B \mapsto U(φ_1(A) \otimes φ_2(B))V$, where $φ_s(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 \cdots \otimes M_{n_m}$ of higher level. The connection of the problem to quantum information science is mentioned.
math.FA↗
Criteria and new classes of k-positive maps
We study k-positive maps on operators. Proofs are given to different positivity criteria. Special attention is on positive maps arising in the study of quantum information science. Results of other researchers are extended and improved. New classes of positive maps are constructed. Some open questions are answered.
quant-ph↗
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.
math-ph↗
Entanglement transformation between sets of bipartite pure quantum states using local operations
Alice and Bob are given an unknown initial state chosen from a set of pure quantum states. Their task is to transform the initial state to a corresponding final pure state using local operations only. We prove necessary and sufficient conditions on the existence of such a transformation. We also provide efficient algorithms that can quickly rule out the possibility of transforming a set of initial states to a set of final states.
quant-ph↗
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 $ϕ: M_{mn} \rightarrow M_{mn}$ satisfying $$|A\otimes B| = |ϕ(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 $ϕ$ has the form $A\otimes B \mapsto U(φ_1(A) \otimes φ_2(B))V$, where $φ_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.
quant-ph↗
Recovery in quantum error correction for general noise without measurement
It is known that one can do quantum error correction without syndrome measurement, which is often done in operator quantum error correction (OQEC). However, the physical realization could be challenging, especially when the recovery process involves high-rank projection operators and a superoperator. We use operator theory to improve OQEC so that the implementation can always be done by unitary gates followed by a partial trace operation. Examples are given to show that our error correction scheme outperforms the existing ones in various scenarios.
quant-ph↗
Efficient Quantum Error Correction for Fully Correlated Noise
We investigate an efficient quantum error correction of a fully correlated noise. Suppose the noise is characterized by a quantum channel whose error operators take fully correlated forms given by $σ_x^{\otimes n}$, $σ_y^{\otimes n}$ and $σ_z^{\otimes n}$, where $n>2$ is the number of qubits encoding the codeword. It is proved that (i) $n$ qubits codeword encodes $(n-1)$ data qubits when $n$ is odd and (ii) $n$ qubits codeword implements a noiseless subsystem encoding $(n-2)$ data qubits when $n$ is even. Quantum circuits implementing these schemes are constructed.
quant-ph↗
A note on the realignment criterion
For a quantum state in a bipartite system represented as a density matrix, researchers used the realignment matrix and functions on its singular values to study the separability of the quantum state. We obtain bounds for elementary symmetric functions of singular values of realignment matrices. This answers some open problems proposed by Lupo, Aniello, and Scardicchio. As a consequence, we show that the proposed scheme by these authors for testing separability would not work if the two subsystems of the bipartite system have the same dimension.
quant-ph↗
Recursive Encoding and Decoding of Noiseless Subsystem and Decoherence Free Subspace
When the environmental disturbace to a quantum system has a wavelength much larger than the system size, all qubits localized within a small area are under action of the same error operators. Noiseless subsystem and decoherence free subspace are known to correct such collective errors. We construct simple quantum circuits, which implement these collective error correction codes, for a small number $n$ of physical qubits. A single logical qubit is encoded with $n=3$ and $n=4$, while two logical qubits are encoded with $n=5$. The recursive relations among the subspaces employed in noiseless subsystem and decoherence free subspace play essential rôles in our implementation. The recursive relations also show that the number of gates required to encode $m$ logical qubits increases linearly in $m$.
quant-ph↗
The automorphism group of separable states in quantum information theory
We show that the linear group of automorphism of Hermitian matrices which preserves the set of separable states is generated by \emph{natural} automorphisms: change of an orthonormal basis in each tensor factor, partial transpose in each tensor factor, and interchanging two tensor factors of the same dimension. We apply our results to preservers of the product numerical range.
quant-ph↗
Higher rank numerical ranges of normal matrices
The higher rank numerical range is closely connected to the construction of quantum error correction code for a noisy quantum channel. It is known that if a normal matrix $A \in M_n$ has eigenvalues $a_1, \..., a_n$, then its higher rank numerical range $Λ_k(A)$ is the intersection of convex polygons with vertices $a_{j_1}, \..., a_{j_{n-k+1}}$, where $1 \le j_1 < \... < j_{n-k+1} \le n$. In this paper, it is shown that the higher rank numerical range of a normal matrix with $m$ distinct eigenvalues can be written as the intersection of no more than $\max\{m,4\}$ closed half planes. In addition, given a convex polygon ${\mathcal P}$ a construction is given for a normal matrix $A \in M_n$ with minimum $n$ such that $Λ_k(A) = {\mathcal P}$. In particular, if ${\mathcal P}$ has $p$ vertices, with $p \ge 3$, there is a normal matrix $A \in M_n$ with $n \le \max\left\{p+k-1, 2k+2 \right\}$ such that $Λ_k(A) = {\mathcal P}$.
math.FA↗
Higher rank numerical ranges and low rank perturbations of quantum channels
For a positive integer $k$, the rank-$k$ numerical range $Λ_k(A)$ of an operator $A$ acting on a Hilbert space $\cH$ of dimension at least $k$ is the set of scalars $λ$ such that $PAP = λP$ for some rank $k$ orthogonal projection $P$. In this paper, a close connection between low rank perturbation of an operator $A$ and $Λ_k(A)$ is established. In particular, for $1 \le r < k$ it is shown that $Λ_k(A) \subseteq Λ_{k-r}(A+F)$ for any operator $F$ with $\rank (F) \le r$. In quantum computing, this result implies that a quantum channel with a $k$-dimensional error correcting code under a perturbation of rank $\le r$ will still have a $(k-r)$-dimensional error correcting code. Moreover, it is shown that if $A$ is normal or if the dimension of $A$ is finite, then $Λ_k(A)$ can be obtained as the intersection of $Λ_{k-r}(A+F)$ for a collection of rank $r$ operators $F$. Examples are given to show that the result fails if $A$ is a general operator. The closure and the interior of the convex set $Λ_k(A)$ are completely determined. Analogous results are obtained for $Λ_\infty(A)$ defined as the set of scalars $λ$ such that $PAP = λP$ for an infinite rank orthogonal projection $P$. It is shown that $Λ_\infty(A)$ is the intersection of all $Λ_k(A)$ for $k = 1, 2, >...$. If $A - μI$ is not compact for any $μ\in \IC$, then the closure and the interior of $Λ_\infty(A)$ coincide with those of the essential numerical range of $A$. The situation for the special case when $A-μI$ is compact for some $μ\in \IC$ is also studied.
math.FA↗
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.
math.FA↗
Condition for the higher rank numerical range to be non-empty
It is shown that the rank-$k$ numerical range of every $n$-by-$n$ complex matrix is non-empty if $n \ge 3k - 2$. The proof is based on a recent characterization of the rank-$k$ numerical range by Li and Sze, the Helly's theorem on compact convex sets, and some eigenvalue inequalities. In particular, the result implies that $Λ_2(A)$ is non-empty if $n \ge 4$. This confirms a conjecture of Choi et al. If $3k-2>n>0$, an $n$-by-$n$ complex matrix is given for which the rank-$k$ numerical range is empty. Extension of the result to bounded linear operators acting on an infinite dimensional Hilbert space is also discussed.
math.FA↗