arXiv subjects

U. Helmke

Publications and source records attributed to U. Helmke.

6 recordsLinked to original sources

arXiv2015

Network Flows that Solve Linear Equations

We study distributed network flows as solvers in continuous time for the linear algebraic equation $\mathbf{z}=\mathbf{H}\mathbf{y}$. Each node $i$ has access to a row $\mathbf{h}_i^{\rm T}$ of the matrix $\mathbf{H}$ and the corresponding entry $z_i$ in the vector $\mathbf{z}$. The first "consensus + projection" flow under investigation consists of two terms, one from standard consensus dynamics and the other contributing to projection onto each affine subspace specified by the $\mathbf{h}_i$ and $z_i$. The second "projection consensus" flow on the other hand simply replaces the relative state feedback in consensus dynamics with projected relative state feedback. Without dwell-time assumption on switching graphs as well as without positively lower bounded assumption on arc weights, we prove that all node states converge to a common solution of the linear algebraic equation, if there is any. The convergence is global for the "consensus + projection" flow while local for the "projection consensus" flow in the sense that the initial values must lie on the affine subspaces. If the linear equation has no exact solutions, we show that the node states can converge to a ball around the least squares solution whose radius can be made arbitrarily small through selecting a sufficiently large gain for the "consensus + projection" flow under fixed bidirectional graphs. Semi-global convergence to approximate least squares solutions is demonstrated for general switching directed graphs under suitable conditions. It is also shown that the "projection consensus" flow drives the average of the node states to the least squares solution with complete graph. Numerical examples are provided as illustrations of the established results.

eess.SY↗

arXiv2011

Riemannian optimization on tensor products of Grassmann manifolds: Applications to generalized Rayleigh-quotients

We introduce a generalized Rayleigh-quotient on the tensor product of Grassmannians enabling a unified approach to well-known optimization tasks from different areas of numerical linear algebra, such as best low-rank approximations of tensors (data compression), geometric measures of entanglement (quantum computing) and subspace clustering (image processing). We briefly discuss the geometry of the constraint set, we compute the Riemannian gradient of the generalized Rayleigh-quotient, we characterize its critical points and prove that they are generically non-degenerated. Moreover, we derive an explicit necessary condition for the non-degeneracy of the Hessian. Finally, we present two intrinsic methods for optimizing the generalized Rayleigh-quotient - a Newton-like and a conjugated gradient - and compare our algorithms tailored to the above-mentioned applications with established ones from the literature.

math.OC↗

arXiv2009

Algebraic Decoding for Doubly Cyclic Convolutional Codes

An iterative decoding algorithm for convolutional codes is presented. It successively processes $N$ consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be corrected. The algorithm can be efficiently used on a particular class of convolutional codes, known as doubly cyclic convolutional codes. Due to their highly algebraic structure those codes are well suited for the algorithm and the main step of the procedure can be carried out using Reed-Solomon decoding. Examples illustrate the decoding and a comparison with existing algorithms is being made.

cs.IT↗

arXiv2009

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

In view of controlling finite dimensional open quantum systems, we provide a unified Lie-semigroup framework describing the structure of completely positive trace-preserving maps. It allows (i) to identify the Kossakowski-Lindblad generators as the Lie wedge of a subsemigroup, (ii) to link properties of Lie semigroups such as divisibility with Markov properties of quantum channels, and (iii) to characterise reachable sets and controllability in open systems. We elucidate when time-optimal controls derived for the analogous closed system already give good fidelities in open systems and when a more detailed knowledge of the open system (e.g., in terms of the parameters of its Kossakowski-Lindblad master equation) is actually required for state-of-the-art optimal-control algorithms. -- As an outlook, we sketch the structure of a new, potentially more efficient numerical approach explicitly making use of the corresponding Lie wedge.

quant-ph↗

arXiv2008

Gradient Flows for Optimisation and Quantum Control: Foundations and Applications

For addressing optimisation tasks on finite dimensional quantum systems, we give a comprehensive account of the foundations of gradient flows on Riemannian manifolds including new developments: we extend former results from Lie groups such as the full unitary group to closed subgroups like partitionings by factorisation into tensor products, where the finest partitioning consists of purely local unitary operations. Moreover, the common framework is kept sufficiently general and allows for setting up gradient flows on (sub-)manifolds, Lie (sub-)groups, quotient groups, and reductive homogeneous spaces. Relevant convergence conditions are discussed meant to serve as justification for recent and new achievements, and as foundation for further research. Exploiting the differential geometry of quantum dynamics under different scenarios helps to provide highly useful algorithms: (a) On an abstract level, gradient flows may establish the exact upper bounds of pertinent quality functions, i.e. upper bounds reachable within the underlying manifold of the state space dynamics; (b) in a second stage referring to a concrete experimental setting, gradient flows on the manifold of piecewise constant control amplitudes $\R^m$ may be set up to provide (approximations to) optimal control of quantum devices under realistic conditions. Illustrative examples and new applications are given relating to distance measures of pure-state entanglement. We establish the correspondence to best rank-1 approximations of higher-order tensors.

quant-ph↗

arXiv2007

Relative $C$"-Numerical Ranges for Applications in Quantum Control and Quantum Information

Motivated by applications in quantum information and quantum control, a new type of $C$"-numerical range, the relative $C$"-numerical range denoted $W_K(C,A)$, is introduced. It arises upon replacing the unitary group U(N) in the definition of the classical $C$"-numerical range by any of its compact and connected subgroups $K \subset U(N)$. The geometric properties of the relative $C$"-numerical range are analysed in detail. Counterexamples prove its geometry is more intricate than in the classical case: e.g. $W_K(C,A)$ is neither star-shaped nor simply-connected. Yet, a well-known result on the rotational symmetry of the classical $C$"-numerical range extends to $W_K(C,A)$, as shown by a new approach based on Lie theory. Furthermore, we concentrate on the subgroup $SU_{\rm loc}(2^n) := SU(2)\otimes ... \otimes SU(2)$, i.e. the $n$-fold tensor product of SU(2), which is of particular interest in applications. In this case, sufficient conditions are derived for $W_{K}(C,A)$ being a circular disc centered at origin of the complex plane. Finally, the previous results are illustrated in detail for $SU(2) \otimes SU(2)$.

math-ph↗