The Significance of the CC-Numerical Range and the Local CC-Numerical Range in Quantum Control and Quantum Information

This paper shows how C-numerical-range related new strucures may arise from practical problems in quantum control--and vice versa, how an understanding of these structures helps to tackle hot topics in quantum information. We start out with an overview on the role of C-numerical ranges in current research problems in quantum theory: the quantum mechanical task of maximising the projection of a point on the unitary orbit of an initial state onto a target state C relates to the C-numerical radius of A via maximising the trace function |\tr \{C^\dagger UAU^\dagger\}|. In quantum control of n qubits one may be interested (i) in having U\in SU(2^n) for the entire dynamics, or (ii) in restricting the dynamics to {\em local} operations on each qubit, i.e. to the n-fold tensor product SU(2)\otimes SU(2)\otimes >...\otimes SU(2). Interestingly, the latter then leads to a novel entity, the {\em local} C-numerical range W_{\rm loc}(C,A), whose intricate geometry is neither star-shaped nor simply connected in contrast to the conventional C-numerical range. This is shown in the accompanying paper (math-ph/0702005). We present novel applications of the C-numerical range in quantum control assisted by gradient flows on the local unitary group: (1) they serve as powerful tools for deciding whether a quantum interaction can be inverted in time (in a sense generalising Hahn's famous spin echo); (2) they allow for optimising witnesses of quantum entanglement. We conclude by relating the relative C-numerical range to problems of constrained quantum optimisation, for which we also give Lagrange-type gradient flow algorithms.Comment: update relating to math-ph/070200

A Lower Bound on the C-Numerical Radius of Nilpotent Matrices Appearing in Coherent Spectroscopy

We provide a lower bound for the efficiency of polarization or coherence transfer between quantized states under unitary transformations. Mathematically the problem is the determination of the C-numerical radius of A for certain nilpotent matrices C and A. The presented lower bound is conjectured to be exact as it coincides with numerical data provided in [U. Helmke et al., J. Global Optim., 23 (2002), pp. 283-308]