Using quantum computers in control: interval matrix properties (2403.17711v1)
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.
- P. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM Review, vol. 41, no. 2, pp. 303–332, 1999.
- L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Proc. 28th ACM Symposium on the Theory of Computing, 1996, pp. 212–219.
- A. W. Harrow, A. Hassidim, and S. Lloyd, “Quantum algorithm for linear systems of equations,” Physical Review Letters, vol. 103, no. 15, p. 150502, 2009.
- D. Giannakis, A. Ourmazd, P. Pfeffer, J. Schumacher, and J. Slawinska, “Embedding classical dynamics in a quantum computer,” Physical Review A, vol. 105, p. 052404, 2022.
- M. A. Schalkers and M. Möllers, “Efficient and fail-safe collisionless quantum Boltzmann method,” arXiv:2211.14269, 2022.
- R. P. Feynman, “Simulating physics with computers,” Int. J. Theor. Phys., vol. 21, p. 467, 1982.
- J. Preskill, “Quantum computing in the NISQ era and beyond,” Quantum, vol. 2, p. 79, 2018.
- M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo, K. Fujii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio, and P. J. Coles, “Variational quantum algorithms,” Nature Reviews Physics, vol. 3, pp. 625–644, 2021.
- E. Farhi, J. Goldstone, and S. Gutmann, “A quantum approximate optimization algorithm,” arXiv:1411.4028, 2014.
- J. Berberich and D. Fink, “Quantum computing through the lens of control: a tutorial introduction,” arXiv:2310.12571, 2023.
- D. Inoue and H. Yoshida, “Model predictive control for finite input systems using the D-wave quantum annealer,” arXiv:2001.01400, 2020.
- S. A. Deshpande and A. A. Kulkarni, “The quantum advantage in decentralized control,” arXiv:2207.12075, 2022.
- S. Poljak and J. Rohn, “Checking robust nonsingularity is NP-hard,” Mathematics of Control, Signals, and Systems, vol. 6, pp. 1–9, 1993.
- A. Nemirovskii, “Several NP-hard problems arising in robust stability analysis,” Math. Control Signals Systems, vol. 6, pp. 99–105, 1993.
- V. Blondel and J. N. Tsitsiklis, “NP-hardness of some linear control design problems,” SIAM J. Control Optim., vol. 35, no. 6, pp. 2118–2127, 1997.
- J. C. Doyle, “Analysis of feedback systems with structured uncertainties,” in Proc. IEEE, 1982, pp. 242–250.
- J. Rohn, “Checking positive definiteness or stability of symmetric interval matrices is NP-hard,” Comment. Math. Univ. Carolin., vol. 35, no. 4, pp. 795–797, 1994.
- S. Hadfield, “On the representation of boolean and real functions as hamiltonians for quantum computing,” ACM Transactions on Quantum Computing, vol. 2, no. 4, p. 18, 2021.
- M. Meisami-Azad, J. Mohammadpour, and K. M. Grigoriadis, “Dissipative analysis and control of state-space symmetric systems,” in Proc. American Control Conf. (ACC), 2008, pp. 413–418.