In this manuscript, we investigate optimal control problems which arise in connection with manipulation of dissipative quantum dynamics. These problems motivate the study of a class of dissipative bilinear control systems. For these systems it is shown that the optimal solution and the reachable set can be found by solving a semidefinite program. In practice, solutions to these problems generate optimal methods for control of quantum mechanical phenomena in presence of dissipation. In the area of coherent spectroscopy, this translates into the maximum signal to noise ratio that can be obtained in a spectroscopy experiment.
We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box or an ellipsoid, we provide a method to compute certified outer approximations of the reachable set. The proposed method consists of building a hierarchy of relaxations for an infinite-dimensional moment problem. Under certain assumptions, the optimal value of this problem is the volume of the reachable set and the optimum solution is the restriction of the …
Max-Min Bilinear Completely Positive Programs: A Semidefinite Relaxation with Tightness Guarantees
Lee Kong Chian School of Business, Singapore Management University（新加坡管理大学李光前商学院）；Department of Mathematics, Hong Kong Baptist University（香港浸会大学数学系）；Institute for Research and Continuing Education, Hong Kong Baptist University（香港浸会大学持续教育学院）；Department of Applied Mathematics, The Hong Kong Polytechnic University（香港理工大学应用数学系）
There has been an increasing interest in using neural networks in closed-loop control systems to improve performance and reduce computational costs for on-line implementation. However, providing safety and stability guarantees for these systems is challenging due to the nonlinear and compositional structure of neural networks. In this paper, we propose a novel forward reachability analysis method for the safety verification of linear time-varying systems with neural networks in feedback interconnection. Our technical approach relies on abstracting the nonlinear activation functions by quadrati…
In the framework of bilinear control systems, we present reachable sets of coherently controllable open quantum systems with switchable coupling to a thermal bath of arbitrary temperature $T geq 0$. The core problem boils down to studying points in the standard simplex amenable to two types of controls that can be used interleaved: (i) permutations within the simplex, (ii) contractions by a dissipative one-parameter semigroup. Our work illustrates how the solutions of the core problem pertain to the reachable set of the original controlled Markovian quantum system. We completely characterize t…
We consider the linear degenerate wave equation, on the interval $(0, 1)$ $$ w_{tt} - (x^αw_x)_x = p(t) μ(x) w, $$ with bilinear control $p$ and Neumann boundary conditions. We study the controllability of this nonlinear control system, locally around a constant reference trajectory, the ground state. We prove that, generically with respect to $μ$, any target close to the ground state in the $H^3\times H^2$ topology (suitably adapted to the underlying degenerate operator) is reachable in time $T > \frac{4}{2-α}$, with controls in $L^2((0, T ),\mathbb R)$. Under some classical and generic assum…
We propose a bilinear decomposition for the Burer-Monteiro method and combine it with the standard Alternating Direction Method of Multipliers algorithm for semidefinite programming. Bilinear decomposition reduces the degree of the augmented Lagrangian from four to two, which makes each of the subproblems a quadratic programming and hence computationally efficient. Our approach is able to solve a class of large-scale SDPs with diagonal constraints. We prove that our ADMM algorithm converges globally to a first-order stationary point, and show by exploiting the negative curvature that the algor…
We study the problem of finding the Lowner-John ellipsoid, i.e., an ellipsoid with minimum volume that contains a given convex set. We reformulate the problem as a generalized copositive program, and use that reformulation to derive tractable semidefinite programming approximations for instances where the set is defined by affine and quadratic inequalities. We prove that, when the underlying set is a polytope, our method never provides an ellipsoid of higher volume than the one obtained by scaling the maximum volume inscribed ellipsoid. We empirically demonstrate that our proposed method gener…
In quantum systems theory one of the fundamental problems boils down to: Given an initial state, which final states can be reached by the dynamic system in question? Formulated in the framework of bilinear control systems, the evolution shall be governed by an inevitable Hamiltonian drift term, finitely many control Hamiltonians allowing for (at least) piecewise constant control amplitudes, plus a (possibly bang-bang switchable) noise term in Kossakowski-Lindblad form. Now assuming switchable coupling of finite-dimensional systems to a thermal bath of arbitrary temperature, the core problem of…
