Higher rank numerical ranges of normal matrices

From MaRDI portal



Abstract: 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 AinMn has eigenvalues a1,...,an, then its higher rank numerical range Lambdak(A) is the intersection of convex polygons with vertices aj1,...,ajnk+1, where 1lej1<...<jnk+1len. 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 maxm,4 closed half planes. In addition, given a convex polygon mathcalP a construction is given for a normal matrix AinMn with minimum n such that Lambdak(A)=mathcalP. In particular, if mathcalP has p vertices, with pge3, there is a normal matrix AinMn with nlemaxleftp+k1,2k+2ight such that Lambdak(A)=mathcalP.











This page was built for publication: Higher rank numerical ranges of normal matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3008236)