Recent increasing interest in quantum computers has spurred research into practical engineering applications for quantum algorithms. One potential application is process control. The unique quantum phenomena involved with quantum computing brings up interesting considerations for control. This work focuses on non-determinism, first through a motivating simulation utilizing a continuous stirred-tank reactor. Following this, two methods of potentially ensuring system stability in the presence of non-determinism are discussed. The first involves including an additional gate to the modified Grover’s algorithm presented in our previous work, which is designed to prevent a qubit state corresponding to an undesired control input from being measured. The second method involves defining an inner region where, if the state leaves the region, a classical stabilizing controller is activated to drive the state back inside the region.
Recent increasing interest in quantum computers has spurred research into practical engineering applications for quantum algorithms. One potential application is process control. The unique quantum phenomena involved with quantum computing brings up interesting considerations for control. This work focuses on non-determinism, first through a motivating simulation utilizing a continuous stirred-tank reactor. Following this, two methods of potentially ensuring system stability in the presence of non-determinism are discussed. The first involves including an additional gate to the modified Grover’s algorithm presented in our previous work, which is designed to prevent a qubit state corresponding to an undesired control input from being measured. The second method involves defining an inner region where, if the state leaves the region, a classical stabilizing controller is activated to drive the state back inside the region.
Processing and storage demands of industrial processes are causing fields such as optimization, scheduling, and control to assess the effectiveness of quantum devices in their applications. A key objective of control systems is to ensure process safety. This paper focuses on the potential of quantum devices to compute control inputs that maintain system safety despite sources of nondeterminism inherent to currently available quantum devices (quantum noise). In our previous work, we employed a quantum simulator to assess whether a quantum implementation of a proportional (P) control law could stabilize a single-input/single-output system under quantum noise approximated from a real quantum device. While one algorithm achieved this objective, another performed poorly, raising questions about the underlying reasons for their differing performance. This study explores how conventional control engineering techniques for handling nondeterminism (e.g., modifying sampling period lengths or applying only stabilizing control actions based on steady-state tracking) could enhance system response in the presence of noise. Utilizing IBM’s Qiskit, a quantum simulator was used to evaluate algorithmic and heuristic control strategies to improve the steady-state tracking performance of a P-control law under quantum noise. The objective here is to provide insight into the feasibility of near-term quantum devices to execute control actions with safety considerations.
Quantum computers, which utilize quantum states called ‘qubits’ to process information, are becoming of increased interest in a variety of fields because they have the potential to outperform classical computers in certain situations. However, many challenges and hurdles remain, including the development of quantum algorithms that offer a speedup and can be applied to practical problems (current quantum algorithms that offer any sort of speedup are often only applicable in specific and sometimes contrived circumstances). Our previous works have studied the use of quantum computers and quantum algorithms for process control applications. Our prior work evaluated the use of a gate-based quantum amplitude amplification algorithm when applied to a model predictive control optimization problem, specifically evaluating a linear systems example. The results suggested that the algorithm may be suited for the specific linear problem studied (meaning that there is a high probability of obtaining the desired result when measuring the quantum state after the algorithm has been applied). However, the results cannot be generalized to a wider class of systems or to systems containing nonlinearities. To begin to gain an understanding of how the amplitude amplification algorithm might be generalized, this work evaluates the use of the algorithm for the optimization-based control for a nonlinear dynamic system (specifically, a continuous stirred tank reactor). We seek to understand aspects of the problem, such as the development of a solution space, the effects of changing process and control parameters, and the operation of the amplitude amplification algorithm itself. The results demonstrate the challenges that still exist, as well as a method involving inverse sampling transformations to potentially address these issues.
The potential for greater algorithmic efficiency for some problems on quantum computers compared to classical computers is appealing in many fields including, for example, the process systems engineering field. While quantum algorithms have been studied for a variety of applications related to optimization, molecular modeling, and machine learning, there remain many applications in process systems engineering, including process control, where it is not clear how quantum computing algorithms would be beneficial. One idea for attempting to understand when a quantum algorithm might provide benefits for control is to start with algorithms that would be expected to benefit “similar” problems (e.g., optimization problems) and to see if controllers can be implemented within those algorithmic frameworks. Therefore, in this work, we study the use of a quantum computing algorithm related to Grover’s algorithm, which is an amplitude amplification strategy that can search an unordered list with improved efficiency compared to a classical algorithm for the task. It has been extended to perform a search for optimal paths over a graph. Given its potential utility for search and optimization, this is an example of an algorithm where we might wonder if it could be adjusted or used to provide speed-ups for large control problems if the controller could function within this algorithmic framework. This work provides the first steps toward attempting to address this question by investigating how optimization-based control problems would fit into this framework. A process described by ẋ=x+u is considered as a test case. The modified Grover’s algorithm requires the optimization problem to be mapped into quantum gates. We discuss ideas for attempting to represent an optimization-based controller known as model predictive control (MPC) in the modified Grover’s algorithm framework. We test how various parameters of the control and quantum algorithm designs, including fundamental parameters in MPC such as the number of sampling periods and length of the sampling periods, impact the success of using the quantum algorithm for the MPC. We provide analyses regarding why the results are what they are to give perspective on how quantum computing algorithms work and intersect with engineering problems.
Quantum computing is an emerging technology that has the potential to change the perspectives and applications of computing in general. A wide range of applications are enabled: from faster algorithmic solutions of classically still difficult problems to theoretically more secure communication protocols. A quantum computer uses the quantum mechanical effects of particles or particle-like systems, and a major similarity between quantum and classical computers consists of both being abstracted as information processing machines. Whereas a classical computer operates on classical digital information, the quantum computer processes quantum information, which shares similarities with analog signals. One of the central differences between the two types of information is that classical information is more fault-tolerant when compared to its quantum counterpart. Faults are the result of the quantum systems being interfered by external noise, but during the last decades quantum error correction codes (QECC) were proposed as methods to reduce the effect of noise. Reliable quantum circuits are the result of designing circuits that operate directly on encoded quantum information, but the circuit’s reliability is also increased by supplemental redundancies, such as sub-circuit repetitions. Reliable quantum circuits have not been widely used, and one of the major obstacles is their vast associated resource overhead, but recent quantum computing architectures show promising scalabilities. Consequently the number of particles used for computing can be more easily increased, and that the classical control hardware (inherent for quantum computation) is also more reliable. Reliable quantum circuits haev been investigated for almost as long as general quantum computing, but their limited adoption (until recently) has not generated enough interest into their systematic design. The continuously increasing practical relevance of reliability motivates the present thesis to investigate some of the first answers to questions related to the background and the methods forming a reliable quantum circuit design stack. The specifics of quantum circuits are analysed from two perspectives: their probabilistic behaviour and their topological properties when a particular class of QECCs are used. The quantum phenomena, such as entanglement and superposition, are the computational resources used for designing quantum circuits. The discrete nature of classical information is missing for quantum information. An arbitrary quantum system can be in an infinite number of states, which are linear combinations of an exponential number of basis states. Any nontrivial linear combination of more than one basis states is called a state superposition. The effect of superpositions becomes evident when the state of the system is inferred (measured), as measurements are probabilistic with respect to their output: a nontrivial state superposition will collapse to one of the component basis states, and the measurement result is known exactly only after the measurement. A quantum system is, in general, composed from identical subsystems, meaning that a quantum computer (the complete system) operates on multiple similar particles (subsystems). Entanglement expresses the impossibility of separating the state of the subsystems from the state of the complete system: the nontrivial interactions between the subsystems result into a single indivisible state. Entanglement is an additional source of probabilistic behaviour: by measuring the state of a subsystem, the states of the unmeasured subsystems will probabilistically collapse to states from a well defined set of possible states. Superposition and entanglement are the building blocks of quantum information teleportation protocols, which in turn are used in state-of-the-art fault-tolerant quantum computing architectures. Information teleportation implies that the state of a subsystem is moved to a second subsystem without copying any information during the process. The probabilistic approach towards the design of quantum circuits is initiated by the extension of classical test and diagnosis methods. Quantum circuits are modelled similarly to classical circuits by defining gate-lists, and missing quantum gates are modelled by the single missing gate fault. The probabilistic approaches towards quantum circuits are facilitated by comparing these to stochastic circuits, which are a particular type of classical digital circuits. Stochastic circuits can be considered an emulation of analogue computing using digital components. A first proposed design method, based on the direct comparison, is the simulation of quantum circuits using stochastic circuits by mapping each quantum gate to a stochastic computing sub-circuit. The resulting stochastic circuit is compiled and simulated on FPGAs. The obtained results are encouraging and illustrate the capabilities of the proposed simulation technique. However, the exponential number of possible quantum basis states was translated into an exponential number of stochastic computing elements. A second contribution of the thesis is the proposal of test and diagnosis methods for both stochastic and quantum circuits. Existing verification (tomographic) methods of quantum circuits were targeting the reconstruction of the gate-lists. The repeated execution of the quantum circuit was followed by different but specific measurement at the circuit outputs. The similarities between stochastic and quantum circuits motivated the proposal of test and diagnosis methods that use a restricted set of measurement types, which minimise the number of circuit executions. The obtained simulation results show that the proposed validation methods improve the feasibility of quantum circuit tomography for small and medium size circuits. A third contribution of the thesis is the algorithmic formalisation of a problem encountered in teleportation-based quantum computing architectures. The teleportation results are probabilistic and require corrections represented as quantum gates from a particular set. However, there are known commutation properties of these gates with the gates used in the circuit. The corrections are not applied as dynamic gate insertions (during the circuit’s execution) into the gate-lists, but their effect is tracked through the circuit, and the corrections are applied only at circuit outputs. The simulation results show that the algorithmic solution is applicable for very large quantum circuits. Topological quantum computing (TQC) is based on a class of fault-tolerant quantum circuits that use the surface code as the underlying QECC. Quantum information is encoded in lattice-like structures and error protection is enabled by the topological properties of the lattice. The 3D structure of the lattice allows TQC computations to be visualised similarly to knot diagrams. Logical information is abstracted as strands and strand interactions (braids) represent logical quantum gates. Therefore, TQC circuits are abstracted using a geometrical description, which allows circuit input-output transformations (correlations) to be represented as geometric sub-structures. TQC design methods were not investigated prior to this work, and the thesis introduces the topological computational model by first analysing the necessary concepts. The proposed TQC design stack follows a top-down approach: an arbitrary quantum circuit is decomposed into the TQC supported gate set; the resulting circuit is mapped to a lattice of appropriate dimensions; relevant resulting topological properties are extracted and expressed using graphs and Boolean formulas. Both circuit representations are novel and applicable to TQC circuit synthesis and validation. Moreover, the Boolean formalism is broadened into a formal mechanism for proving circuit correctness. The thesis introduces TQC circuit synthesis, which is based on a novel logical gate geometric description, whose formal correctness is demonstrated. Two synthesis methods are designed, and both use a general planar representation of the circuit. Initial simulation results demonstrate the practicality and performance of the methods. An additional group of proposed design methods solves the problem of automatic correlation construction. The methods use validity criteria which were introduced and analysed beforehand in the thesis. Input-output correlations existing in the circuit are inferred using both the graph and the Boolean representation. The thesis extends the TQC state-of-the-art by recognising the importance of correlations in the validation process: correlation construction is used as a sub-routine for TQC circuit validation. The presented cross-layer validation procedure is useful when investigating both the QECC and the circuit, while a second proposed method is QECC-independent. Both methods are scalable and applicable even to very large circuits. The thesis completes with the analysis of TQC circuit identities, where the developed Boolean formalism is used. The proofs of former known circuit identities were either missing or complex, and the presented approach reduces the length of the proofs and represents a first step towards standardising them. A new identity is developed and detailed during the process of illustrating the known circuit identities. Reliable quantum circuits are a necessity for quantum computing to become reality, and specialised design methods are required to support the quest for scalable quantum computers. This thesis used a twofold approach towards this target: firstly by focusing on the probabilistic behaviour of quantum circuits, and secondly by considering the requirements of a promising quantum computing architecture, namely TQC. Both approaches resulted in a set of design methods enabling the investigation of reliable quantum circuits. The thesis contributes with the proposal of a new quantum simulation technique, no
Quantum chaos theory offers a unique paradigm for controlling quantum systems, providing a pathway to unprecedented stability and precision. This paper introduces an adaptive quantum chaos algorithm designed to leverage this theory, emphasizing non-parametric control. We propose a novel method that dynamically adjusts control parameters based on the system's inherent quantum properties, effectively bypassing the need for pre-defined, fixed parameters. This approach allows for more robust and adaptable control, potentially surpassing the limitations of traditional approaches. This work focuses on the design and implementation of an algorithm that utilizes the principles of quantum chaos to achieve enhanced stability and accuracy in quantum system manipulation. The core claim is that this adaptive algorithm offers a significantly improved approach to non-parametric control compared to existing methods. This paper will detail the theoretical underpinnings of the algorithm, showcase its implementation using a simplified quantum system, and discuss its potential impact on various quantum applications.
Quantum computing has advanced in recent years to the point that there are now some quantum computers and quantum simulators available to the public for use. In addition, quantum computing is beginning to receive attention within the process systems engineering community for directions such as machine learning and optimization. A logical next step for its evaluation within process systems engineering is for control, specifically for computing control actions to be applied to process systems. In this work, we provide some initial studies regarding the implementation of control on quantum computers, including the implementation of a single-input/single-output proportional control law on a quantum simulator with noise, evaluation of potential impacts of nondeterminism on theory for advanced control laws, and discussion of consequences of the way that entanglement works for next-generation manufacturing communication objectives.