The Significance of the -Numerical Range and the Local -Numerical Range in Quantum Control and Quantum Information
arXiv:math-ph/0701035 · doi:10.1080/03081080701544114
Abstract
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.
arXiv commentupdate relating to math-ph/0702005
References in corpus (9)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Algorithms Revisited
- Geometric measure of entanglement and applications to bipartite and multipartite quantum states
- Sub-Riemannian Geometry and Time Optimal Control of Three Spin Systems: Quantum Gates and Coherence Transfer
- Optimal Control-Based Efficient Synthesis of Building Blocks of Quantum Algorithms Seen in Perspective from Network Complexity towards Time Complexity
- The quantum query complexity of the hidden subgroup problem is polynomial
- Quantum Algorithms and the Fourier Transform
- Complete hierarchies of efficient approximations to problems in entanglement theory
- Relative "-Numerical Ranges for Applications in Quantum Control and Quantum Information
Cited by in corpus (9)
- Lie-Semigroup Structures for Reachability and Control of Open Quantum Systems: Viewing Markovian Quantum Channels as Lie Semigroups and GKS-Lindblad Generators as Lie Wedge
- Restricted numerical range: a versatile tool in the theory of quantum information
- Gradient Flows for Optimisation and Quantum Control: Foundations and Applications
- Product numerical range in a space with tensor product structure
- Uncertainty relations from graph theory
- Relative "-Numerical Ranges for Applications in Quantum Control and Quantum Information
- Restricted numerical shadow and geometry of quantum entanglement
- An approach to constructing genuinely entangled subspaces of maximal dimension
- The C-Numerical Range in Infinite Dimensions