Using quantum computers in control: interval matrix properties

Abstract

Quantum computing provides a powerful framework for tackling computational problems that are classically intractable. The goal of this paper is to explore the use of quantum computers for solving relevant problems in systems and control theory. In the recent literature, different quantum algorithms have been developed to tackle binary optimization, which plays an important role in various control-theoretic problems. As a prototypical example, we consider the verification of interval matrix properties such as non-singularity and stability on a quantum computer. We present a quantum algorithm solving these problems and we study its performance in simulation. Our results demonstrate that quantum computers provide a promising tool for control whose applicability to further computationally complex problems remains to be explored.

Final version, accepted for publication in Proc. European Control Conference (ECC), 2024

References in corpus (6)

• Quantum algorithm for solving linear systems of equations
• Variational Quantum Algorithms
• A Quantum Approximate Optimization Algorithm
• Model Predictive Control for Finite Input Systems using the D-Wave Quantum Annealer
• Quantum computing through the lens of control: A tutorial introduction
• The Quantum Advantage in Decentralized Control

Cited by in corpus (2)

• Quantum computing through the lens of control: A tutorial introduction
• Bringing Quantum Systems under Control: A Tutorial Invitation to Quantum Computing and Its Relation to Bilinear Control Systems