Search

This paper addresses the optimal control of quantum coherence in multi-level systems, modeled by the Lindblad master equation, which captures both unitary evolution and environmental dissipation. We develop an energy minimization framework to control the evolution of a qutrit (three-level) quantum system while preserving coherence between states. The control problem is formulated using Pontryagin's Minimum Principle in the form of Gamkrelidze, incorporating state constraints to ensure coherence remains within desired bounds. Our approach accounts for Markovian decoherence, demonstrating that the Lindblad operator is non-unital, which reflects the irreversible decay processes inherent in the system. The results provide insights into effectively maintaining quantum coherence in the presence of dissipation., Comment: 8 pages, 4 figures

This work collects some methodological insights for numerical solution of a "minimum-dispersion" control problem for nonlinear stochastic differential equations, a particular relaxation of the covariance steering task. The main ingredient of our approach is the theoretical foundation called $\infty$-order variational analysis. This framework consists in establishing an exact representation of the increment ($\infty$-order variation) of the objective functional using the duality, implied by the transformation of the nonlinear stochastic control problem to a linear deterministic control of the Fokker-Planck equation. The resulting formula for the cost increment analytically represents a "law-feedback" control for the diffusion process. This control mechanism enables us to learn time-dependent coefficients for a predefined Markovian control structure using Monte Carlo simulations with a modest population of samples. Numerical experiments prove the vitality of our approach.

This paper proposes an integrated quantum-classical approach that merges quantum computational dynamics with classical computing methodologies tailored to address control problems based on Pontryagin's minimum principle within a Physics-Informed Neural Network (PINN) framework. By leveraging a dynamic quantum circuit that combines Gaussian and non-Gaussian gates, the study showcases an innovative approach to optimizing quantum state manipulations. The proposed hybrid model effectively applies machine learning techniques to solve optimal control problems. This is illustrated through the design and implementation of a hybrid PINN network to solve a quantum state transition problem in a two and three-level system, highlighting its potential across various quantum computing applications., Comment: 9 pages, 5 figures

We propose an optimal control strategy to generate maximally entangled states in bipartite quantum systems. Leveraging the Pontryagin Principle, we derive time-dependent control fields that maximize the entanglement measure, specifically concurrence, within minimal time while adhering to input constraints. Our formulation addresses the Liouville-von Neumann dynamics of the reduced density matrix under unitary evolution. The strategy is numerically validated through simulations, demonstrating its ability to drive the system from an initial perturbed separable state to a maximally entangled target state. The results showcase the effectiveness of switching control fields in optimizing entanglement, with potential applications in quantum technologies, including communication, computation, and sensing., Comment: 6 pages, 2 figures

This paper introduces a Lyapunov-based control approach with homodyne measurement. We study two filtering approaches: (i) the traditional quantum filtering and (ii) a modified version of the extended Kalman filtering. We examine both methods in order to directly estimate the evolution of the coherence vector elements, using sequential homodyne current measurements. The latter case explicitly addresses the dynamics of a stochastic master equation with correlated noise, transformed into a state-space representation, ensuring by construction the quantum properties of the estimated state variable. In addition, we consider the case where the quantum-mechanical Hamiltonian is unknown, and the system experiences uncertainties. In this case, we show as expected that both filters lose performance, exhibiting large expected estimation errors. To address this problem, we propose a simple multiple model estimation scheme that can be directly applied to any of the studied filters. We then reconstruct the estimated density operator \( \hat{\rho} \), describing the full state of the system, and subject it to a control scheme. The proposed switching-based Lyapunov control scheme, which is fed with \( \hat{\rho} \), guarantees noise-to-state practically stable in probability of the desired stationary target set with respect to the estimation error variance. We demonstrate our approach's efficacy in stabilizing a qubit coupled to a leaky cavity under homodyne detection in the presence of uncertainty in resonance frequency., Comment: 11 pages, 9 figures

Control Lyapunov functions (CLFs) and Control Barrier Functions (CBFs) have been used to develop provably safe controllers by means of quadratic programs (QPs). This framework guarantees safety in the form of trajectory invariance with respect to a given set, but it can introduce undesirable equilibrium points to the closed loop system, which can be asymptotically stable. In this work, we present a detailed study of the formation and stability of equilibrium points with the QP framework for a class of nonlinear systems. We introduce the useful concept of compatibility between a CLF and a family of CBFs, regarding the number of stable equilibrium points other than the CLF minimum. Using this concept, we derive a set of compatibility conditions on the parameters of a quadratic CLF and a family of quadratic CBFs that guarantee that all undesirable equilibrium points are not attractive. Furthermore, we propose an extension to the QP-based controller that dynamically modifies the CLF geometry in order to satisfy the compatibility conditions, guaranteeing safety and quasi-global convergence of the system state to the CLF minimum. Numeric simulations illustrate the applicability of the proposed method for safety-critical, deadlock-free robotic navigation tasks., Comment: Submitted to IFAC Automatica. Under review

This chapter provides an in-depth analysis of the properties and phenomena associated with neutral K-mesons. Kaons are quantum systems illustrating strange behaviours. We begin by examining the significance of strangeness and charge parity violation in understanding these particles. The concept of strangeness oscillations is then introduced, explaining oscillations between $K^0$ and $\bar{K}^0$ states. The regeneration of $K_S$ is investigated, uncovering the underlying mechanisms involved. The discussion moves on to quasi-spin space, exploring its bases and their implications. The entangled states of kaon pairs $(K^0,\bar K^0)$ are considered, with a focus on maximally entangled neutral kaons and non-maximally entangled states. Decoherence effects on entangled kaons are examined, utilizing the density matrix description to capture the dynamics. A dedicated decoherence parameter is introduced to quantify the impact of decoherence. Furthermore, the chapter investigates the loss of entanglement through measures such as Von Neumann entanglement entropy, entanglement of formation, and concurrence. These measures provide insights into quantifying and characterizing entanglement in the context of neutral kaons. Through this comprehensive exploration of properties, phenomena, and entanglement dynamics, this chapter aims to pointing out recent works on neutral kaons, contributing to advancements in particle physics.

We investigate a time and energy minimization optimal control problem for open quantum systems, whose dynamics is governed through the Lindblad (or Gorini-Kossakowski-Sudarshan-Lindblad) master equation. The dissipation is Markovian time-independent, and the control is governed by the Hamiltonian of a quantum-mechanical system. We are specifically interested to study the purity in a dissipative system constrained by state and control inputs. The idea for solving this problem is by the combination of two following techniques. We deal with the state constraints through Gamkrelidze revisited method, while handling control constraints through the idea of saturation functions and system extensions. This is the first time that quantum purity conservation is formulated in such framework. We obtain the necessary conditions of optimality through the Pontryagin Minimum Principle. Finally, the resulted boundary value problem is solved by a Physics-Informed Neural Network (PINN) approach. The exploited Pontryagin PINN technique is also new in quantum control context. We show that these PINNs play an effective role in learning optimal control actions., Comment: 6 pages, 2 figures

Motivated by the problem of designing robust composite pulses for Bloch equations in the presence of natural perturbations, we study an abstract optimal ensemble control problem in a probabilistic setting with a general nonlinear performance criterion. The model under study addresses mean-field dynamics described by a linear continuity equation in the space of probability measures. For the resulting optimization problem, we derive an exact representation of the increment of the cost functional in terms of the flow of the driving vector field. Relying on the exact increment formula, a descent method is designed that is free of any internal line search. The numerical method is applied to solve new control problems for distributed ensembles of Bloch equations.

Reliable high-fidelity quantum state transformation has always been considered as an inseparable part of quantum information processing. In this regard, Pontryagin maximum principle has proved to play an important role to achieve the maximum fidelity in an optimum time or energy. Motivated by this, in this work, we formulate a control constrained optimal control problem where we aim to minimize time and also energy subjected to a quantum system satisfying the bilinear Schrodinger equation. We derive the first order optimality conditions through the application of Pontryagin Maximum (minimum) Principle, which results in a boundary value problem. Next, in order to obtain efficient numerical results, we exploit a particular family of physics-informed neural networks that are specifically designed to tackle the indirect method based on the Maximum Principle of Pontryagin. This method has not yet been studied in the quantum context, but it can significantly speed up the process. To this end, we first obtain a set of relations which finally let us compute the optimal control strategy to determine the time- and energy-optimal protocol driving a general initial state to a target state by a quantum Hamiltonian with bounded control. We make use of the so-called "qutip" package in python, and the newly developed "tfc" python package.

In this study, we address a control-constrained optimal control problem pertaining to the transformation of quantum states. Our objective is to navigate a quantum system from an initial state to a desired target state while adhering to the principles of the Liouville-von Neumann equation. To achieve this, we introduce a cost functional that balances the dual goals of fidelity maximization and energy consumption minimization. We derive optimality conditions in the form of the Pontryagin Maximum Principle (PMP) for the matrix-valued dynamics associated with this problem. Subsequently, we present a time-discretized computational scheme designed to solve the optimal control problem. This computational scheme is rooted in an indirect method grounded in the PMP, showcasing its versatility and efficacy. To illustrate the practicality and applicability of our methodology, we employ it to address the case of a spin $\frac{1}{2}$ particle subjected to interaction with a magnetic field. Our findings shed light on the potential of this approach to tackle complex quantum control scenarios and contribute to the broader field of quantum state transformations.

We study a problem of designing ``robust'' external excitations for control and synchronization of an assembly of homotypic harmonic oscillators representing so-called theta neurons. The model of theta neurons (Theta model) captures, in main, the bursting behavior of spiking cells in the brain of biological beings, enduring periodic oscillations of the electric potential in their membrane. We study the following optimization problem: to design an external stimulus (control), which steers all neurons of a given population to their desired phases (i.e., excites/slows down its spiking activity) with the highest probability. This task is formulated as an optimal mean-field control problem for the local continuity equation in the space of probability measures. To solve this problem numerically, we propose an indirect deterministic descent method based on an exact representation of the increment (infinite-order variation) of the objective functional. We discuss some aspects of practical realization of the proposed method, and provide results of numerical experiments.

This work makes explicit the degrees of freedom involved in modeling the dynamics of a network, or some other first-order property of a network, such as a measurement function. In previous work, an admissible function in a network was constructed through the evaluation of what we called oracle components. These oracle components are defined through some minimal properties that they are expected to obey. This is a high-level description in the sense that it is not clear how one could design such an object. The goal is to obtain a low-level representation of these objects by unwrapping them into their degrees of freedom. To achieve this, we introduce two decompositions. The first one is the more intuitive one and allows us to define the important concept of coupling order. The second decomposition is built on top of the first one and is valid for the class of coupling components that have finite coupling order. Despite this requirement, we show that this is still a very useful tool for designing coupling components with infinite coupling orders, through a limit approach., Comment: main text has 40 pages and 3 figures. Supplementary appendix has 14 pages

In this paper, we introduce a fast row-stochastic decentralized algorithm, referred to as FRSD, to solve consensus optimization problems over directed communication graphs. The proposed algorithm only utilizes row-stochastic weights, leading to certain practical advantages in broadcast communication settings over those requiring column-stochastic weights. Under the assumption that each node-specific function is smooth and strongly convex, we show that the FRSD iterate sequence converges with a linear rate to the optimal consensus solution. In contrast to the existing methods for directed networks, FRSD enjoys linear convergence without employing a gradient tracking (GT) technique explicitly, rather it implements GT implicitly with the use of a novel momentum term, which leads to a significant reduction in communication and storage overhead for each node when FRSD is implemented for solving high-dimensional problems over small-to-medium scale networks. In the numerical tests, we compare FRSD with other state-of-the-art methods, which use row-stochastic and/or column-stochastic weights.

Average consensus protocols emerge with a central role in distributed systems and decision-making such as distributed information fusion, distributed optimization, distributed estimation, and control. A key advantage of these protocols is that agents exchange and reveal their state information only to their neighbors. Yet, it can raise privacy concerns in situations where the agents' states contain sensitive information. In this paper, we propose a novel (noiseless) privacy preserving distributed algorithms for multi-agent systems to reach an average consensus. The main idea of the algorithms is that each agent runs a (small) network with a crafted structure and dynamics to form a network of networks (i.e., the connection between the newly created networks and their interconnections respecting the initial network connections). Together with a re-weighting of the dynamic parameters dictating the inter-agent dynamics and the initial states, we show that it is possible to ensure that the value of each node converges to the consensus value of the original network. Furthermore, we show that, under mild assumptions, it is possible to craft the dynamics such that the design can be achieved in a distributed fashion. Finally, we illustrate the proposed algorithm with examples.

In this paper, given a linear time-invariant strongly connected network, we study the problem of determining the minimum number of state variables that need to be simultaneously actuated and measured to ensure structural controllability and observability, respectively. This problem is fundamental in the design of multi-agent systems, where there are economic constraints in the decision of which agents to equip with a more costly on-board system that will allow the agent to have both actuation and sensing capabilities. Despite the combinatorial nature of this problem, we present a solution that couples the design of both structural controllability and structural observability counterparts to address it with polynomial-time complexity.

Humans tend to build environments with structure, which consists of mainly planar surfaces. From the intersection of planar surfaces arise straight lines. Lines have more degrees-of-freedom than points. Thus, line-based Structure-from-Motion (SfM) provides more information about the environment. In this paper, we present solutions for SfM using lines, namely, incremental SfM. These approaches consist of designing state observers for a camera's dynamical visual system looking at a 3D line. We start by presenting a model that uses spherical coordinates for representing the line's moment vector. We show that this parameterization has singularities, and therefore we introduce a more suitable model that considers the line's moment and shortest viewing ray. Concerning the observers, we present two different methodologies. The first uses a memory-less state-of-the-art framework for dynamic visual systems. Since the previous states of the robotic agent are accessible -- while performing the 3D mapping of the environment -- the second approach aims at exploiting the use of memory to improve the estimation accuracy and convergence speed. The two models and the two observers are evaluated in simulation and real data, where mobile and manipulator robots are used., Comment: To appear in IEEE Transactions on Robotics \c{opyright} 2021 IEEE

Fractional-order dynamical networks are increasingly being used to model and describe processes demonstrating long-term memory or complex interlaced dependencies amongst the spatial and temporal components of a wide variety of dynamical networks. Notable examples include networked control systems or neurophysiological networks which are created using electroencephalographic (EEG) or blood-oxygen-level-dependent (BOLD) data. As a result, the estimation of the states of fractional-order dynamical networks poses an important problem. To this effect, this paper addresses the problem of minimum-energy state estimation for discrete-time fractional-order dynamical networks (DT-FODN), where the state and output equations are affected by an additive noise that is considered to be deterministic, bounded, and unknown. Specifically, we derive the corresponding estimator and show that the resulting estimation error is exponentially input-to-state stable with respect to the disturbances and to a signal that is decreasing with the increase of the accuracy of the adopted approximation model. An illustrative example shows the effectiveness of the proposed method on real-world neurophysiological networks., Comment: 9 pages, 7 figures

In this paper, we provide an overview of the research conducted in the context of structural systems since the latest survey by Dion et al. in 2003. We systematically consider all the papers that cite this survey as well as the seminal work in this field that took place on and after the publication of the later survey, are published in peer-reviewed venues and in English. Structural systems theory deals with parametric systems where parameters might be unknown and, therefore, addresses the study of systems properties that depend only on the system's structure (or topology) described by the inter-dependencies between state variables. Remarkably, structural systems properties hold generically (i.e., almost always) under the assumption that parameters are independent. Therefore, it constitutes an approach to assess necessary conditions that systems should satisfy. In recent years, structural systems theory was applied to design systems that attain such properties, as well as to endure resilient/security and privacy properties. Furthermore, structural systems theory enables the formulation of such topics as combinatorial optimization problems, which allow us to understand their computational complexity and find algorithms that are efficiently deployed in the context of large-scale systems. In particular, we present an overview of how structural systems theory has been used in the context of linear time-invariant systems, as well as other dynamical models, for which a brief description of the different problem statements and solutions approaches are presented. Next, we describe recent variants of structural systems theory, as well as different applications of the classical and new approaches. Finally, we provide an overview of recent and future directions in this field.

This paper addresses the problem of steering a robotic vehicle along a geometric path specified with respect to a reference frame moving in three dimensions, termed the Moving Path Following (MPF) motion control problem. The MPF motion control problem is solved for a large class of robotic vehicles that require a minimum positive forward speed to operate, which poses additional constraints, and is developed using geometric concepts, wherein the attitude control problem is formulated on Special Orthogonal group SO(3). Furthermore, the proposed control law is derived from a novel MPF error model formulation that allows to exclude the conservative constraints on the initial position of the vehicle with respect to the reference path by enabling the explicit control of the progression of a virtual point moving along the reference path. The task of the MPF control law is then to steer the vehicle towards the moving path and converge to the virtual point. Formal stability and convergence guarantees are provided using the Input-to-State Stability concept. In particular, we show that the proposed controller is robust to imperfect tracking errors by the autopilot and wind gusts. Simulation results are presented to illustrate the efficacy of the proposed MPF control law., Comment: Technical Report. Longer version of the paper to be submitted to the relevant conference/letters

Control Lyapunov functions (CLFs) and control barrier functions (CBFs) have been used to develop provably safe controllers by means of quadratic programs (QPs), guaranteeing safety in the form of trajectory invariance with respect to a given set. In this manuscript, we show that this framework can introduce equilibrium points (particularly at the boundary of the unsafe set) other than the minimum of the Lyapunov function into the closed-loop system. We derive explicit conditions under which these undesired equilibria (which can even appear in the simple case of linear systems with just one convex unsafe set) are asymptotically stable. To address this issue, we propose an extension to the QP-based controller unifying CLFs and CBFs that explicitly avoids undesirable equilibria on the boundary of the safe set. The solution is illustrated in the design of a collision-free controller., Comment: 6 pages, 4 figures, submitted to the 59th Conference on Decision and Control

Recovering the 3D structure of the surrounding environment is an essential task in any vision-controlled Structure-from-Motion (SfM) scheme. This paper focuses on the theoretical properties of the SfM, known as the incremental active depth estimation. The term incremental stands for estimating the 3D structure of the scene over a chronological sequence of image frames. Active means that the camera actuation is such that it improves estimation performance. Starting from a known depth estimation filter, this paper presents the stability analysis of the filter in terms of the control inputs of the camera. By analyzing the convergence of the estimator using the Lyapunov theory, we relax the constraints on the projection of the 3D point in the image plane when compared to previous results. Nonetheless, our method is capable of dealing with the cameras' limited field-of-view constraints. The main results are validated through experiments with simulated data., Comment: 7 pages, 3 figures, conference

The 3D depth estimation and relative pose estimation problem within a decentralized architecture is a challenging problem that arises in missions that require coordination among multiple vision-controlled robots. The depth estimation problem aims at recovering the 3D information of the environment. The relative localization problem consists of estimating the relative pose between two robots, by sensing each other's pose or sharing information about the perceived environment. Most solutions for these problems use a set of discrete data without taking into account the chronological order of the events. This paper builds on recent results on continuous estimation to propose a framework that estimates the depth and relative pose between two non-holonomic vehicles. The basic idea consists in estimating the depth of the points by explicitly considering the dynamics of the camera mounted on a ground robot, and feeding the estimates of 3D points observed by both cameras in a filter that computes the relative pose between the robots. We evaluate the convergence for a set of simulated scenarios and show experimental results validating the proposed framework., Comment: 6 pages, 7 figures, conference

This paper addresses the design of an optimization-based cooperative path-following control law for multiple robotic vehicles that optimally balances the transient trade-off between coordination and path-following errors. To this end, we formulate a more general multi-agent framework where each agent is associated with (i) a continuous-time dynamical model, which governs the evolution of its state, and (ii) an output equation that is a function of both the state of the agent and a coordination vector. According to a given network topology, each agent can access its state and coordination vector, as well as the coordination vectors of the neighboring agents. In this setup, the goal is to design a distributed control law that steers the output signals to the origin, while simultaneously driving the coordination vectors of the agents of the network to consensus. To solve this, we propose a model predictive control scheme that builds on a pre-existing auxiliary consensus control law to design a performance index that combines the output regulation objective with the consensus objective. Convergence guarantees under which one can solve this coordinated output regulation problem are provided. Numerical simulations display the effectiveness of the proposed scheme applied to a cooperative path following control problem of a network of 3D nonholonomic robotic vehicles.

This paper addresses the design of finite-dimensional feedback control laws for linear discrete-time fractional-order systems with additive state disturbance. A set of sufficient conditions are provided to guarantee convergence of the state trajectories to an ultimate bound around the origin with size increasing with the magnitude of the disturbances. Performing a suitable change of coordinates, the latter result can be used to design a controller that is able to track reference trajectories that are solutions of the unperturbed fractional-order system. To overcome the challenges associated with the generation of such solutions, we address the practical case where the references to be tracked are generated as a solution of a specific finite-dimensional approximation of the original fractional-order system. In this case, the tracking error trajectory is driven to an asymptotic bound that is increasing with the magnitude of the disturbances and decreases with the increment in the accuracy of the approximation. The proposed controllers are finite-dimensional, in the sense that the computation of the control input only requires a finite number of previous state and input vectors of the system. Numerical simulations illustrate the proposed design methods in different scenarios.

This paper proposes a low-level visual navigation algorithm to improve visual localization of a mobile robot. The algorithm, based on artificial potential fields, associates each feature in the current image frame with an attractive or neutral potential energy, with the objective of generating a control action that drives the vehicle towards the goal, while still favoring feature rich areas within a local scope, thus improving the localization performance. One key property of the proposed method is that it does not rely on mapping, and therefore it is a lightweight solution that can be deployed on miniaturized aerial robots, in which memory and computational power are major constraints. Simulations and real experimental results using a mini quadrotor equipped with a downward looking camera demonstrate that the proposed method can effectively drive the vehicle to a designated goal through a path that prevents localization failure., Comment: accepted for ICRA 2018. arXiv admin note: text overlap with arXiv:1709.04687

This paper proposes a novel solution for improving visual localization in an active fashion. The solution, based on artificial potential field, associates each feature in the current image frame with an attractive or neutral potential energy. The resultant action drives the vehicle towards the goal, while still favoring feature rich areas. Experimental results with a mini quadrotor equipped with a downward looking camera assess the performance of the proposed method., Comment: 11 pages, 6 figures, to published on ROBOT'17: Third Iberian Robotics Conference

This paper addresses the problem of minimum cost resilient actuation-sensing-communication co-design for regular descriptor systems while ensuring selective strong structural system's properties. More specifically, the problem consists of determining the minimum cost deployment of actuation and sensing technology, as well as communication between the these, such that decentralized control approaches are viable for an arbitrary realization of regular descriptor systems satisfying a pre-specified selective structure, i.e., some entries can be zero, nonzero, or either zero/nonzero. Towards this goal, we rely on strong structural systems theory and extend it to cope with the selective structure that casts resiliency/robustness properties and uncertainty properties of system's model. Upon such framework, we introduce the notion of selective strong structural fixed modes as a characterization of the feasibility of decentralized control laws. Also, we provide necessary and sufficient conditions for this property to hold, and show how these conditions can be leveraged to determine the minimum cost resilient placement of actuation-sensing-communication technology ensuring feasible solutions. In particular, we study the minimum cost resilient actuation and sensing placement, upon which we construct the solution to our problem. Finally, we illustrate the applicability the main results of this paper on an electric power grid example.