2000 character limit reached
Quantum optimization for Nonlinear Model Predictive Control (2410.19467v2)
Published 25 Oct 2024 in eess.SY, cs.SY, and quant-ph
Abstract: Nonlinear Model Predictive Control (NMPC) is a general and flexible control approach, used in many industrial contexts, and is based on the online solution of a nonlinear optimization problem. This operation requires in general a high computational cost, which may compromise the NMPC implementation in ``fast'' applications, especially if a large number variables is involved. To overcome this issue, we propose a quantum computing approach for the solution of the NMPC optimization problem. Assuming the availability of an efficient quantum computer, the approach has the potential to considerably decrease the computational time and/or enhance the solution quality compared to classical algorithms.
- D. Mayne, J. Rawlings, C. Rao, and P. Scokaert, “Constrained model predictive control: Stability and optimality,” Automatica, vol. 36, no. 6, pp. 789–814, 2000.
- R. Findeisen and F. Allgower, “An introduction to nonlinear model predictive control,” in 21st Benelux Meeting on Systems and Control, (Veldhoven, The Netherlands), pp. 1–23, 2002.
- E. Camacho and C. Bordons, Model Predictive Control. Springer, 2007.
- 2019.
- D. Inoue and H. Yoshida, “Model predictive control for finite input systems using the d-wave quantum annealer,” Scientific Reports, vol. 10, 2020.
- F. D. Grossi and C. Circi, “Nonlinear model predictive control leveraging quantum-inspired optimization in the three body problem with uncertainty,” Acta Astronautica, vol. 205, 2023.
- T. S. Humble, H. Thapliyal, E. Munoz-Coreas, F. A. Mohiyaddin, and R. S. Bennink, “Quantum computing circuits and devices,” IEEE Design & Test, vol. 36, no. 3, pp. 69–94, 2019.
- S. Slussarenko and G. J. Pryde, “Photonic quantum information processing: A concise review,” Applied Physics Reviews, vol. 6, no. 4, 2019.
- N. S. Yanofsky and M. A. Mannucci, Quantum Computing for Computer Scientists. Cambridge University Press, 2008.
- M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information. Cambridge University Press, 10th anniversary edition ed., 2010.
- S. Aaronson, Quantum Computing Since Democritus. Cambridge University Press, 2013.
- J. Preskill, “Quantum computing in the nisq era and beyond,” Quantum, vol. 2, p. 79, 2018.
- T. Albash and D. A. Lidar, “Demonstration of a scaling advantage for a quantum annealer over simulated annealing,” Physical Review X, vol. 8, no. 3, p. 031016, 2018.
- S. Boixo, G. Ortiz, and R. Somma, “Fast quantum methods for optimization,” The European Physical Journal Special Topics, vol. 224, pp. 35–49, 2 2015.
- P. Hauke, H. G. Katzgraber, W. Lechner, H. Nishimori, and W. D. Oliver, “Perspectives of quantum annealing: Methods and implementations,” Reports on Progress in Physics, vol. 83, no. 5, p. 054401, 2020.
- T. Kadowaki and H. Nishimori, “Quantum annealing in the transverse ising model,” Physical Review E, vol. 58, no. 5, p. 5355, 1998.
- S. Morita and H. Nishimori, “Mathematical foundation of quantum annealing,” Journal of Mathematical Physics, vol. 49, p. 125210, 12 2008.
- R. Cagienard, P. Grieder, E. Kerrigan, and M. Morari, “Move blocking strategies in receding horizon control,” Journal of Process Control, vol. 17, no. 6, pp. 563–570, 2007.
- M. W. Johnson, M. H. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A. J. Berkley, J. Johansson, P. Bunyk, et al., “Quantum annealing with manufactured spins,” Nature, vol. 473, no. 7346, pp. 194–198, 2011.
- “D-Wave Systems, www.dwavesys.com.”
- T. Zanca and G. E. Santoro, “Quantum annealing speedup over simulated annealing on random ising chains,” Phys. Rev. B, vol. 93, p. 224431, Jun 2016.
- P. Xavier, P. Ripper, T. Andrade, J. Garcia, N. Maculan, and D. B. Neira, “Qubo.jl: A julia ecosystem for quadratic unconstrained binary optimization,” https://arxiv.org/abs/2307.02577, 2023.
- T. Gabor, M. L. Rosenfeld, S. Feld, and C. Linnhoff-Popien, “How to approximate any objective function via quadratic unconstrained binary optimization,” https://arxiv.org/abs/2204.11035, 2022.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.
