Robust H∞ controller design for a class of linear quantum systems with time delay

Time delay is frequently encountered in practical quantum feedback control systems with long transmission lines and measurement process. This paper is concerned with measurement‐based feedback H^∞ control for quantum systems with time delays appearing in the feedback loops. A physical model is presented for the quantum time‐delay system described by complex quantum stochastic differential equations. Quantum versions of some fundamental properties, such as dissipativity and stability, are discussed for this model. A numerical procedure is proposed for H^∞ controller synthesis, which can deal with a non‐convex optimization problem arising in the design processes. Copyright © 2016 John Wiley & Sons, Ltd.     

Outer factor ‘absorption’ for H∞ control problems

We present a constructive method for ‘absorbing’ an irrational outer factor of a plant into the ‘Q-parameter’ in the H ^∞ optimal weighted sensitivity problem for single-input/single-output distributed parameter systems, when the plant has finitely many irrational zeros on the imaginary axis. This problem could not be solved using previous results. We also extend our new results to the mixed sensitivity problem.     

H∞ control for discrete‐time nonlinear switching systems

This paper formulates and solves the robust H^∞ control problem for discrete‐time nonlinear switching systems. The H^∞ control problem is interpreted as the l₂ finite gain control problem and is studied using a dissipative systems theory for switched systems. Both state and measurement feedback control problems are formulated as dynamic games and solved using dynamic programming. The partially observed dynamic game corresponding to the measurement feedback control problem is solved by transforming into a completely observed, full state infinite‐dimensional game problem using information states. Our results are illustrated with an example. Copyright © 2007 John Wiley & Sons, Ltd.     

Parameterization of Sampled‐Data H∞ Output Feedback Controllers for General Nonlinear Systems

In this paper, we consider the H^∞ control problem for general nonlinear systems under sampled measurements. Sufficient conditions for the existence of H^∞ output feedback controllers are derived. The major contribution of this paper is to characterize a family of H^∞ output feedback controllers for nonaffine nonlinear systems under sampled measurements.     

How to Steer a Quantum System over a Schrödinger Bridge

A new approach to the steering problem for the Schrödinger equation relying on stochastic mechanics and on the theory of Schrödinger bridges is presented. Given the initial and final states ₀ and ₁, respectively, the desired quantum evolution is constructed with the aid of a reference quantum evolution. The Nelson process corresponding to the latter evolution is used as reference process in a Schrödinger bridge problem with marginal probability densities | ₀|² and | ₁|². This approach is illustrated by working out a simple Gaussian example. PACS: 03.65.-w     

H∞ control and filtering with initial uncertainty for infinite dimensional systems

The H_∞-control problem with a non-zero initial condition for infinite dimensional systems is considered The initial conditions are assumed to be in some subspace. First the H_∞ problem with full information is considered and necessary and sufficient conditions for the norm of an input-output operator to be less than a given number are obtained, The characterization of all admissible controllers is also given. This result is then used to solve the general H^∞ control problem and the filtering problem with initial uncertainty. The filtering problem on finite horizon involves the estimate of the state at final time. The set of all suboptimal filters is given both on finite and infinite horizons.     

Cascade cavity realization for a class of complex transfer functions arising in coherent quantum feedback control

This paper presents a realization algorithm for a class of complex transfer function matrices corresponding to physically realizable linear quantum systems. The aim of the realization algorithm is to enable a coherent quantum feedback controller, which has been synthesized using methods such as quantum H^∞ control or quantum LQG control, to be constructed using optical components such as cavities and phase-shifters. The class of linear quantum systems under consideration are passive linear quantum systems which can be described purely in terms of annihilation operators. The proposed algorithm enables a complex transfer function matrix to be realized as a pure cascade connection involving only cavities and phase-shifters.     

Mathematical models of quantum computation

In this paper, we introduce two mathematical models of realistic quantum computation. First, we develop a theory of bulk quantum computation such as NMR (Nuclear Magnetic Resonance) quantum computation. For this purpose, we define bulk quantum Turing machine (BQTM for short) as a model of bulk quantum computation. Then, we define complexity classes EBQP, BBQP and ZBQP as counterparts of the quantum complexity classes EQP, BQP and ZQP, respectively, and show that EBQP=EQP, BBQP=BQP and ZBQP=ZQP. This implies that BQTMs are polynomially related to ordinary QTMs as long as they are used to solve decision problems. We also show that these two types of QTMs are also polynomially related when they solve a function problem which has a unique solution. Furthermore, we show that BQTMs can solve certain instances of NP-complete problems efficiently. On the other hand, in the theory of quantum computation, only feed-forward quantum circuits are investigated, because a quantum circuit represents a sequence of applications of time evolution operators. But, if a quantum computer is a physical device where the gates are interactions controlled by a current computer such as laser pulses on trapped ions, NMR and most implementation proposals, it is natural to describe quantum circuits as ones that have feedback loops if we want to visualize the total amount of the necessary hardware. For this purpose, we introduce a quantum recurrent circuit model, which is a quantum circuit with feedback loops. LetC be a quantum recurrent circuit which solves the satisfiability problem for a blackbox Boolean function includingn variables with probability at least 1/2. And lets be the size ofC (i.e. the number of the gates inC) andt be the number of iterations that is needed forC to solve the satisfiability problem. Then, we show that, for those quantum recurrent circuits, the minimum value ofmax(s, t) isO(n ²2 ^n/3). Tetsuro Nishino, D.Sc.: He is presently an Associate Professor in the Department of Information and Communication Engineering, The University of Electro-Communications. He received the B.S., M.S. and D.Sc degrees in mathematics from Waseda University, in 1982, 1984 and 1991 respectively. From 1984 to 1987, he joined Tokyo Research Laboratory, IBM Japan. From 1987 to 1992, he was a Research Associate of Tokyo Denki University, and from 1992 to 1994, he was an Associate Professor of Japan Advanced Institute of Science and Technology, Hokuriku. His main interests are circuit complexity theory, computational learning theory and quantum complexity theory.     

A first principles solution to the non-singular H∞ control problem

This paper presents an elementary solution to the non-singular H^∞ control problem. In this control problem, the underlying linear system satisfies a set of assumptions which ensures that the solution can be obtained by solving just two algebraic Riccati equations of the game type. This leads to the central solution to the H^∞ control problem. The solution presented in this paper uses only elementary ideas beginning with the Bounded Real Lemma.     

H∞ preview tracking in output feedback setting

The performance of preview control is investigated in terms of H^∞‐criterion. In the output feedback setting, an H^∞ preview control problem is discussed and the analytic solution is characterized by introducing matrix Riccati equations. The strength and the limitation of the H^∞ preview performance are illustrated with numerical examples. Copyright © 2004 John Wiley & Sons, Ltd.     

Robust H∞ estimation of uncertain linear quantum systems

We consider classical estimators for a class of physically realizable linear quantum systems. Optimal estimation using a complex Kalman filter for this problem has been previously explored. Here, we study robust H_∞ estimation for uncertain linear quantum systems. The estimation problem is solved by converting it to a suitably scaled H_∞ control problem. The solution is obtained in the form of two algebraic Riccati equations. Relevant examples involving dynamic squeezers are presented to illustrate the efficacy of our method. Copyright © 2016 John Wiley & Sons, Ltd.     

On the quantum and randomized approximation of linear functionals on function spaces

We deal with quantum and randomized algorithms for approximating a class of linear continuous functionals. The functionals are defined on a H?lder space of functions f of d variables with r continuous partial derivatives, the rth derivative being a H?lder function with exponent ρ. For a certain class of such linear problems (which includes the integration problem), we define algorithms based on partitioning the domain of f into a large number of small subdomains, and making use of the well-known quantum or randomized algorithms for summation of real numbers. For N information evaluations (quantum queries in the quantum setting), we show upper bounds on the error of order N ^−(γ+1) in the quantum setting, and N ^−(γ+1/2) in the randomized setting, where γ = (r + ρ)/d is the regularity parameter. Hence, we obtain for a wider class of linear problems the same upper bounds as those known for the integration problem. We give examples of functionals satisfying the assumptions, among which we discuss functionals defined on the solution of Fredholm integral equations of the second kind, with complete information about the kernel. We also provide lower bounds, showing in some cases sharpness of the obtained results, and compare the power of quantum, randomized and deterministic algorithms for the exemplary problems.     

Robust H ∞ control via a stable decentralized nonlinear output feedback controller

This paper presents a new method to construct a decentralized nonlinear robust H ^∞ controller for a class of large‐scale nonlinear uncertain systems. The admissible uncertainties and nonlinearities in the system satisfy integral quadratic constraints and global Lipschitz conditions, respectively. The decentralized controller, which is required to be stable, is capable of exploiting known nonlinearities and interconnections between subsystems without treating them as uncertainties. Instead, additional uncertainties are introduced because of the discrepancies between nondecentralized and decentralized nonlinear output feedback controllers. The H ^∞ control objective is to achieve an absolutely stable closed‐loop system with a specified disturbance attenuation level. A solution to this control problem involves stabilizing solutions to algebraic Riccati equations parametrized by scaling constants corresponding to the uncertainties and nonlinearities. This formulation is nonconvex; hence, an evolutionary optimization method is applied to solve the control problem considered. Copyright © 2012 John Wiley & Sons, Ltd.     

Adiabatic quantum counting by geometric phase estimation

We design an adiabatic quantum algorithm for the counting problem, i.e., approximating the proportion, α, of the marked items in a given database. As the quantum system undergoes a designed cyclic adiabatic evolution, it acquires a Berry phase 2πα. By estimating the Berry phase, we can approximate α, and solve the problem. For an error bound e{\epsilon}, the algorithm can solve the problem with cost of order (\frac1e)^3/2{(\frac{1}{\epsilon})^{3/2}}, which is not as good as the optimal algorithm in the quantum circuit model, but better than the classical random algorithm. Moreover, since the Berry phase is a purely geometric feature, the result may be robust to decoherence and resilient to certain noise.     

Solving Connected Dominating Set Faster than 2<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

In the connected dominating set problem we are given an n-node undirected graph, and we are asked to find a minimum cardinality connected subset S of nodes such that each node not in S is adjacent to some node in S. This problem is also equivalent to finding a spanning tree with maximum number of leaves. Despite its relevance in applications, the best known exact algorithm for the problem is the trivial Ω(2 ⁿ ) algorithm that enumerates all the subsets of nodes. This is not the case for the general (unconnected) version of the problem, for which much faster algorithms are available. Such a difference is not surprising, since connectivity is a global property, and non-local problems are typically much harder to solve exactly. In this paper we break the 2 ⁿ barrier, by presenting a simple O(1.9407 ⁿ ) algorithm for the connected dominating set problem. The algorithm makes use of new domination rules, and its analysis is based on the Measure and Conquer technique. An extended abstract of this paper appeared in the proceedings of FSTTCS’06. Fedor V. Fomin was additionally supported by the Research Council of Norway.     

Complete solution of the 4‐block H∞ control problem with infinite and finite jω‐axis zeros

This paper discusses the 4‐block H^∞ control problem with infinite and finite jω‐axis invariant zeros in the state‐space realizations of the transfer functions from the control input to the controlled output and from the disturbance input to the measurement output, where these realizations are induced from a stabilizable and detectable realization of the generalized plant. This paper extends the DGKF approach to the H^∞ control problem but permitting infinite and finite jω‐axis invariant zeros by using the eigenstructures related to these zeros. Necessary and sufficient conditions are presented for checking solvability through checking the stabilizing solutions of two reduced‐order Riccati equations and examining matrix norm conditions related to the jω‐axis zeros. The parameterization of all suitable controllers is given in terms of a linear fractional transformation involving a certain fixed transfer function matrix and together with a stable transfer function matrix with gain less than 1 which is free apart from satisfying certain interpolation conditions. Copyright © 2000 John Wiley & Sons, Ltd.     

A transfer matrix framework approach to the synthesis of H∞ controllers

This paper presents a transfer matrix framework approach to the now well-known Riccati solution to the nonsingular H^∞ control problem. The approach taken is a frequency-domain one based on the concepts of coprime factorization and J-lossless transfer matrices that lead to the development of relatively simple method for obtaining the state-space solutions. Using two dual pairs of coupled coprime factorizations of certain chain scattering-matrices which describe the problem, we derive an identity, analogous to the Bezout identity for all stabilizing controllers, to generate all proper real-rational H^∞ controllers. We also point out the connections between algebraic Riccati solutions and J-lossless matrices.     

Global robust stabilization of nonlinear systems subject to input constraints

Our main purpose in this paper is to further address the global stabilization problem for affine systems by means of bounded feedback control functions, taking into account a large class of control value sets: p, r ‐weighted balls ??^m _r (p), with 1<p?∞, defined via p, r ‐weighted gauge functions. Observe that p=∞ is allowed, so that m‐dimensional r ‐hyperboxes ??^m _r (∞)?[?r₁^?,r₁⁺]×???×[?r_m^?,r_m⁺], r_j^±>0 are also considered. Working along the line of Artstein–Sontag's approach, we construct an explicit formula for a one‐parameterized family of continuous feedback controls taking values in ?? _r ^m(p) that globally asymptotically stabilize an affine system, provided an appropriate control Lyapunov function is known. The designed family of controls is suboptimal with respect to the robust stability margin for uncertain systems. The problem of achieving disturbance attenuation for persistent disturbances is also considered. Copyright © 2002 John Wiley & Sons, Ltd.     

Mixed LQG and H∞ coherent feedback control for linear quantum systems

The purpose of this paper is to study the mixed linear quadratic Gaussian (LQG) and H_∞ optimal control problem for linear quantum stochastic systems, where the controller itself is also a quantum system, often referred to as ‘coherent feedback controller’. A lower bound of the LQG control is proved. Then two different methods, rank-constrained linear matrix inequality method and genetic algorithm are for controller design. A passive system (cavity) and a non-passive one (degenerate parametric amplifier) demonstrate the effectiveness of these two proposed algorithms.