In this talk I will discuss some instances in quantum computing where numerical range techniques arise. I will also try to formulate some open problems. Elliptical range theorems for generalized numerical ranges of quadratic operators Speaker Chi-Kwong Li, William and Mary, [email protected] Co-authors Yiu-Tung Poon, Iowa State University, [email protected]; Nung-Sing Sze, University of Connect...

In this paper, the notion of rank-k numerical range of rectangular complex matrix polynomials are introduced. Some algebraic and geometrical properties are investigated. Moreover, for ϵ > 0; the notion of Birkhoff-James approximate orthogonality sets for ϵ-higher rank numerical ranges of rectangular matrix polynomials is also introduced and studied. The proposed denitions yield a natural genera...

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.

Notions of numerical ranges and joint numerical ranges of octonion matrices are introduced. Various properties of hermitian octonion matrices related to eigenvalues and convex cones, such as the convex cone of positive semidefinite matrices, are described. As an application, convexity of joint numerical ranges of 2×2 hermitian matrices is characterized. Another application involves existence 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 ∈ 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 ...

This note is to indicate the new sphere of applicability of the method developed by Mlak as well as by the author. Restoring those ideas is summoned by current developments concerning K-spectral sets on numerical ranges. The decomposition of numerical ranges the title refers to is, see [13, p. 42], W(A⊕B) = conv(W(A) ∪ W(B)); (1) it can be proved for any two Hilbert space operators A and B. The...

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...