A new type of C -numerical range arising in quantum computing

We consider a new type of numerical range motivated by recent applications in quantum computing. We term the object of interest local C -numerical rangeW_loc(C, A) of A. It is obtained by replacing the special unitary group in the definition of the C -numerical range by the so-called local subgroup of SU (2^N ), i.e. by the N -fold tensor product SU (2) ⊗ · · · ⊗ SU(2) of unitary (2 × 2)-matrices. First, it is shown that the local C -numerical range has rather unusual geometric properties compared to the ordinary one, e.g. it is in general neither star-shaped nor simply connected. Then two numerical algorithms, a Newton and a conjugate gradient method on the Lie group SU (2) ⊗ · · · ⊗ SU (2), are demonstrated to maximize the real part of W_loc(C, A) which also gives a Euclidean measure of the so-called pure-state entanglement in quantum computing. (© 2006 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Conditions for the generalized numerical range to be real

Necessary and sufficient conditions are given for the C-numerical range of a matrix A to be a subset of the real axis. In particular, it is shown that both A and C must be translates of hermitian matrices.     

C-numerical ranges and C-numerical radii

In this paper, we give a brief survey on C-numerical ranges and C-numerical radii. New results are obtained and open problems are mentioned.     

A condition for the convexity of the norm-numerical range of a matrix

Let v be a norm on Cⁿ, and let a be a matrix which has a v-Hermitian decomposition. (1) The v-numerical range of a is convex. (This generalizes the Hausdorff-Toeplitz theorem.) In fact, the v-numerical range is equal to the field of values of a matrix similar to a. (2) If the Hermitian and v-Hermitian decompositions of a coincide, then the v-numerical range of a and the field of values of a are the same. This follows from detailed information about the boundary of the range.     

On the Properties of Accretive-Dissipative Matrices

Let A be a complex n × n matrix, and let A = B + iC, B = B*, C = C* be its Toeplitz decomposition. Then A is said to be (strictly) accretive if B > 0 and (strictly) dissipative if C > 0. We study the properties of matrices that satisfy both these conditions, in other words, of accretive-dissipative matrices. In many respects, these matrices behave as numbers in the first quadrant of the complex plane. Some other properties are natural extensions of the corresponding properties of Hermitian positive-definite matrices.__________Translated from Matematicheskie Zametki, vol. 77, no. 6, 2005, pp. 832–843.Original Russian Text Copyright ©2005 by A. George, Kh. D. Ikramov.     

The Nilpotency Properties of the Leibniz Algebra Mn(C)D

We study the nilpotency properties of the Leibniz algebras constructed by means of D-mappings on the algebra of complex square matrices M _n (C). In particular, we obtain a criterion for nilpotency of these algebras in terms of the properties of a D-mapping. We prove also that the Leibniz algebras under consideration cannot be simple.     

On Circulant Complex Hadamard Matrices

We show that a circulant complex Hadamard matrix of order n is equivalent to a relative difference set in the group C ₄×C _n where the forbidden subgroup is the unique subgroup of order two which is contained in the C ₄ component. We obtain non-existence results for these relative difference sets. Our results are sufficient to prove there are no circulant complex Hadamard matrices for many orders.     

Norm properties of C-numerical radii

Given n×n complex matrices A, C, the C-numerical radius of A is the nonnegative quantity

$\text{r}{}_{\mathrm{c}}\text{(A)≡ma{|tr(CU}{}^1\text{AU)|:U unitary}}$

. For C=diag(1,0,…,0) it reduces to the classical numerical radius $\text{r(A)= max{|x}{}^1\text{Ax|:x}{}^1\text{x=1}}$. We show that r_c is a generalized matrix norm if and only if C is nonscalar and trC≠0. Next, we consider an arbitrary generalized matrix norm and characterize all constants v?0 for which vN is multiplicative. A technique to obtain such v is then applied to C-numerical radii with Hermitian C. In particular we find that vr is a matrix norm if and only if v?4.     

Isometries of a generalized numerical radius

For 0<q<1, the q-numerical range is defined on the algebra M_n of all n×n complex matrices by

W_q(A)={x^∗Ay:x,y∈Cⁿ,∥x∥=∥y∥=1,〈y,x〉=q}.     

A generalized numerical range: the range of a constrained sesquilinear form

Let M_n denote the algebra of all nxn complex matrices. For a given q?C with ∣Q∣≤1, we define and denote the q-numerical range of A?M_n by

W_q (A)={x ^? Ay:x,y?C ⁿ , _{x ^? x?y ^? y=1,x ^? y=q} }

The q-numerical radius is then given by r_q (A)=sup{∣z∣:z?W _q (A)}. When q=1,W _q (A) and r _q (A) reduce to the classical numerical range of A and the classical numerical radius of A, respectively. when q≠0, another interesting quantity associated with W _q (A) is the inner q-numerical radius defined by [rtilde] _q (A)=inf{∣z∣:z?W _q (A)}

In this paper, we describe some basic properties of W _q (A), extending known results on the classical numerical range. We also study the properties of r_q considered as a norm (seminorm if q=0) on M_n .Finally, we characterize those linear operators L on M_n that leave W_q ,r_q of [rtilde]_q invariant. Extension of some of our results to the infinite dimensional case is discussed, and open problems are mentioned.     

Linear maps preserving regional eigenvalue location

Let M(n, C) be the vector space of n × n complex matrices and let G(r,s,t) be the set of all matrices in M(n, C) having r eigenvalues with positive real parts eigenvalues with negative real part and t eigenvalues with zero real part. In particularG(0,n,0) is the set of stable matrices. We investigate the set of linear operators on M(n, C) that map G(r,s,t) into itself. Such maps include, but are not always limited to similarities, transposition, and multiplication by a positive constant. The proof of our results depends on a characterization of nilpotent matrices in terms of matrices in a particular G(r,s,t), and an extension of a result about the existence of a matrix with prescribed eigenstructure and diagonal entries. Each of these results is of independent interest. Moreover, our char-acterization of nilpotent matrices is sufficiently general to allow us to determine the preservers of many other "inertia classes."     

The excess of complex Hadamard matrices

A complex Hadamard matrix,C, of ordern has elements 1, –1,i, –i and satisfiesCC ^*=nI_nwhereC ^* denotes the conjugate transpose ofC. LetC=[c _ij] be a complex Hadamard matrix of order is called the sum ofC. (C)=|S(C)| is called the excess ofC. We study the excess of complex Hadamard matrices. As an application many real Hadamard matrices of large and maximal excess are obtained.Supported by an NSERC grant.Supported by Telecom grant 7027, an ATERB and ARC grant # A48830241.     

Properties of <Emphasis Type="Italic">C</Emphasis><Superscript>1</Superscript>-smooth mappings with one-dimensional gradient range

We find necessary and sufficient conditions for a curve in ℝ ^m×n to be the gradient range of a C ¹-smooth function υ: Ω ⊂ ℝ ⁿ → ℝ ^m . We show that this curve has tangents in a weak sense; these tangents are rank 1 matrices and their directions constitute a function of bounded variation. We prove also that in this case v satisfies an analog of Sard’s theorem, while the level sets of the gradient mapping ▿υ: Ω → ℝ ^m×n are hyperplanes.     

On the Rational Canonical Form of a Matrix

Let L be a linear map on the space of n×n matrices over a field. We determine the structure of the maps L that preserve commutativity. We also determine the structure of all linear maps on complex matrices that preserve the higher numerical range. The main tool is the Fundamental Theorem of Projective Geometry.     

On the Universal C*-Algebra Generated by a Partial Isometry

A universal C*-algebra is constructed which is generated by a partial isometry. Using grading on this algebra we construct an analog of Cuntz algebras which gives a homotopical interpretation of KK-groups. It is proved that this algebra is homotopy equivalent up to stabilization by 2×2 matrices to M ₂(C). Therefore those algebras are KK-isomorphic.     

Hypercyclic tuples of operators and somewhere dense orbits

In this paper we prove that there are hypercyclic (n+1)-tuples of diagonal matrices on Cn and that there are no hypercyclic n-tuples of diagonalizable matrices on Cn. We use the last result to show that there are no hypercyclic subnormal tuples in infinite dimensions. We then show that on real Hilbert spaces there are tuples with somewhere dense orbits that are not dense, but we also give sufficient conditions on a tuple to insure that a somewhere dense orbit, on a real or complex space, must be dense.     

Fast Construction of Optimal Circulant Preconditioners for Matrices from the Fast Dense Matrix Method

In this paper, we consider solving non-convolution type integral equations by the preconditioned conjugate gradient method. The fast dense matrix method is a fast multiplication scheme that provides a dense discretization matrix A approximating a given integral equation. The dense matrix A can be constructed in O(n) operations and requires only O(n) storage where n is the size of the matrix. Moreover, the matrix-vector multiplication A xcan be done in O(n log n) operations. Thus if the conjugate gradient method is used to solve the discretized system, the cost per iteration is O(n log n) operations. However, for some integral equations, such as the Fredholm integral equations of the first kind, the system will be ill-conditioned and therefore the convergence rate of the method will be slow. In these cases, preconditioning is required to speed up the convergence rate of the method. A good choice of preconditioner is the optimal circulant preconditioner which is the minimizer of C – A _F in Frobenius norm over all circulant matrices C. It can be obtained by taking arithmetic averages of all the entries of A and therefore the cost of constructing the preconditioner is of O(n ²) operations for general dense matrices. In this paper, we develop an O(n log n) method of constructing the preconditioner for dense matrices A obtained from the fast dense matrix method. Application of these ideas to boundary integral equations from potential theory will be given. These equations are ill-conditioned whereas their optimal circulant preconditioned equations will be well-conditioned. The accuracy of the approximation A, the fast construction of the preconditioner and the fast convergence of the preconditioned systems will be illustrated by numerical examples.