For a noisy quantum channel, a quantum error correcting code exists if and only if the joint higher rank numerical ranges associated with the error operators of the channel is non-empty. In this paper, geometric properties of the joint higher rank numerical ranges are obtained and their implications to quantum computing are discussed. It is shown that if the dimension of the underlying Hilbert ...

In this paper we study the structure of standard Einstein solvmanifolds of arbitrary rank. Also the validity of a variational method for finding standard Einstein solvmanifolds is proved.

For any n-by-n complex matrix A and any k, 1 ≤ k ≤ n, let Λk(A) = {λ ∈ C : X∗AX = λIk for some n-by-k X satisfying X∗X = Ik} be its rank-k numerical range. It is shown that if A is an n-by-n contraction, then Λk(A) = ∩{Λk(U) : U is an (n + dA)-by-(n + dA) unitary dilation of A}, where dA = rank (In − A∗A). This extends and refines previous results of Choi and Li on constrained unitary dilations...

We consider higher-rank versions of the standard numerical range for matrices. A central motivation for this investigation comes from quantum error correction. We develop the basic structure theory for the higher-rank numerical ranges, and give a complete description in the Hermitian case. We also consider associated projection compression problems.

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 ∈ Mn has eigenvalues a1, . . . , an, then its higher rank numerical range Λk(A) is the intersection of convex polygons with vertices aj1 , . . . , ajn−k+1 , where 1 ≤ j1 < · · · < jn−k+1 ≤ n. In this paper, it is shown that ...