More Like this

1. Time optimal quantum state transfer in a fully-connected quantum computer

   https://doi.org/10.1088/2058-9565/ad0770  

   Jameson, Casey; Basyildiz, Bora; Moore, Daniel; Clark, Kyle; Gong, Zhexuan (November 2023, Quantum Science and Technology)

   Abstract The speed limit of quantum state transfer (QST) in a system of interacting particles is not only important for quantum information processing, but also directly linked to Lieb–Robinson-type bounds that are crucial for understanding various aspects of quantum many-body physics. For strongly long-range interacting systems such as a fully-connected quantum computer, such a speed limit is still unknown. Here we develop a new quantum brachistochrone method that can incorporate inequality constraints on the Hamiltonian. This method allows us to prove an exactly tight bound on the speed of QST on a subclass of Hamiltonians experimentally realizable by a fully-connected quantum computer. 

   more » « less
2. Automatic amortized resource analysis with the Quantum physicist’s method

   https://doi.org/10.1145/3473581  

   Kahn, David_M; Hoffmann, Jan (August 2021, Proceedings of the ACM on Programming Languages)

   We present a novel method for working with the physicist's method of amortized resource analysis, which we call the quantum physicist's method. These principles allow for more precise analyses of resources that are not monotonically consumed, like stack. This method takes its name from its two major features, worldviews and resource tunneling, which behave analogously to quantum superposition and quantum tunneling. We use the quantum physicist's method to extend the Automatic Amortized Resource Analysis (AARA) type system, enabling the derivation of resource bounds based on tree depth. In doing so, we also introduce remainder contexts, which aid bookkeeping in linear type systems. We then evaluate this new type system's performance by bounding stack use of functions in the Set module of OCaml's standard library. Compared to state-of-the-art implementations of AARA, our new system derives tighter bounds with only moderate overhead. 

   more » « less
3. Control of a Noncooperative Positive Nonlinear System by Augmented Positive Linear System Regulation

   https://doi.org/10.1109/LCSYS.2024.3522944  

   Liu, Guanyun; Menezes, Amor A (December 2024, IEEE Control Systems Letters)

   Positive systems, which are systems whose states are always non-negative, can have both positive linear and positive nonlinear approximations that are valid dynamical models in a prescribed domain. When a linearization of a nonlinear system in a domain near an operating point is equivalent to another linear system representation, a reference-tracking controller for that linear system should also achieve reference-tracking control of the nonlinear system in that domain. Here, we show that only if a linearized positive nonlinear system (PNS) is a positive system (i.e., the PNS is cooperative) will a reference-tracking controller for an equivalent positive linear system realization achieve similar results on the nonlinear system. For an example noncooperative PNS of human blood coagulation, where a published reference-tracking controller assumed a positive linear plant, we develop feedforward and feedback controllers that augment the prior controller to overcome noncooperativity and similarly control the positive nonlinear model. 

   more » « less
4. Unified Necessary and Sufficient Conditions for the Robust Stability of Interconnected Sector-Bounded Systems

   https://doi.org/10.1109/CDC40024.2019.9029605  

   Cyrus, Saman; Lessard, Laurent (December 2019, IEEE Conference on Decision and Control)

   Classical conditions for ensuring the robust stability of a linear system in feedback with a sector-bounded nonlinearity include small gain, circle, passivity, and conicity theorems. In this work, we present a similar stability condition, but expressed in terms of relations defined on a general semi-inner product space. This increased generality leads to a clean result that can be specialized in a variety of ways. First, we show how to recover both sufficient and necessary-and-sufficient versions of the afore-mentioned classical results. Second, we show that suitably choosing the semi-inner product space leads to a new necessary and sufficient condition for weighted stability, which is in turn sufficient for exponential stability. 

   more » « less
5. Reach-SDP: Reachability Analysis of Closed-Loop Systems with Neural Network Controllers via Semidefinite Programming

   https://doi.org/10.1109/CDC42340.2020.9304296  

   Hu, Haimin; Fazlyab, Mahyar; Morari, Manfred; Pappas, George J. (December 2020, IEEE Conference on Decision and Control)

   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 quadratic constraints, which leads to an outer-approximation of forward reachable sets of the closed-loop system. We show that we can compute these approximate reachable sets using semidefinite programming. We illustrate our method in a quadrotor example, in which we first approximate a nonlinear model predictive controller via a deep neural network and then apply our analysis tool to certify finite-time reachability and constraint satisfaction of the closed-loop system. 

   more » « less