Related papers: Higher-Rank Numerical Ranges and Compression Probl…
We verify a conjecture on the structure of higher-rank numerical ranges for a wide class of unitary and normal matrices. Using analytic and geometric techniques, we show precisely how the higher-rank numerical ranges for a generic unitary…
The recently developed theory of higher--rank numerical ranges originated in problems of error correction in quantum information theory but its mathematical implications now include a quite satisfactory understanding of \emph{scalar}…
Some problems of the quantum error-correcting codes theory can be reduced to the investigation of the higher-rank numerical ranges of the operators related to the error operators. We constructively verify a conjecture on the structure of…
We introduce and initiate the study of a family of higher rank matricial ranges, taking motivation from hybrid classical and quantum error correction coding theory and its operator algebra framework. In particular, for a noisy quantum…
The higher rank numerical range is a concept that generalizes the classical numerical range, and it has application in quantum error correction. We investigate these sets for $2$-by-$2$ block matrices with associated Kippenhahn curves…
The higher-rank numerical range is a convex compact set generalizing the classical numerical range of a square complex matrix, first appearing in the study of quantum error correction. We will discuss some of the real algebraic and convex…
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…
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…
We solve the fundamental quantum error correction problem for bi-unitary channels on two-qubit Hilbert space. By solving an algebraic compression problem, we construct qubit codes for such channels on arbitrary dimension Hilbert space, and…
This paper proposes a novel matrix rank-one decomposition for quaternion Hermitian matrices, which admits a stronger property than the previous results in (sturm2003cones,huang2007complex,ai2011new). The enhanced property can be used to…
A number of random matrix ensembles permitting exact determination of their eigenvalue and eigenvector statistics maintain this property under a rank $1$ perturbation. Considered in this review are the additive rank $1$ perturbation of the…
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…
This article is dedicated to the following class of problems. Start with an $N\times N$ Hermitian matrix randomly picked from a matrix ensemble - the reference matrix. Applying a rank-$t$ perturbation to it, with $t$ taking the values $1\le…
We define geometric matrix midranges for positive definite Hermitian matrices and study the midrange problem from a number of perspectives. Special attention is given to the midrange of two positive definite matrices before considering the…
Hermitian and unitary matrices are two representatives of the class of normal matrices whose full eigenvalue decomposition can be stably computed in quadratic computing com plexity. Recently, fast and reliable eigensolvers dealing with low…
The randomised Horn problem, in both its additive and multiplicative version, has recently drawn increasing interest. Especially, closed analytical results have been found for the rank-1 perturbation of sums of Hermitian matrices and…
This work shows several direct and recursive constructions of ordered covering arrays using projection, fusion, column augmentation, derivation, concatenation and cartesian product. Upper bounds on covering codes in NRT spaces are also…
This study investigates Hermitian rank-metric codes, a special class of rank-metric codes, focusing on perfect codes and on the analysis of their covering properties. Firstly, we establish bounds on the size of spheres in the space of…
In this article, we study polymatroids that are representable by means of linear restricted rank-metric codes, namely, by subspaces of the space of alternating, symmetric, or Hermitian square matrices endowed with the rank metric. More…
We propose the first non-trivial generic decoding algorithm for codes in the sum-rank metric. The new method combines ideas of well-known generic decoders in the Hamming and rank metric. For the same code parameters and number of errors,…