Il full-text non è disponibile per scelta dell'autore.
(
Contatta l'autore)
Abstract
The Feedback-based Algorithm for Quantum Optimization (FALQON) is a Lyapunov inspired quantum algorithm proposed to tackle combinatorial optimization problems.
In this thesis, we examine the robustness of FALQON against coherent control errors, a class of multiplicative errors that affect the control input, and shot noise. We show that the algorithm is asymptotically robust with respect to systematic errors, and we derive robustness bounds for independent errors. We prove marginal stability in presence of shot noise. Additionally, we propose a robust version of FALQON which minimizes a regularized Lyapunov function, allowing the algorithm to reach the optimum even in conditions where standard FALQON fails. Finally, we generalize the Lyapunov-based approach to Quantum Machine Learning (QML) problems, providing a general theoretical foundation that can be implemented with a variety of circuit architectures.
Our theoretical results are supported through simulations for medium-scale common problems. The results related to robustness are tested on a MaxCut problem, while the QML results are tested on simple regression and binary classification tasks.
Abstract
The Feedback-based Algorithm for Quantum Optimization (FALQON) is a Lyapunov inspired quantum algorithm proposed to tackle combinatorial optimization problems.
In this thesis, we examine the robustness of FALQON against coherent control errors, a class of multiplicative errors that affect the control input, and shot noise. We show that the algorithm is asymptotically robust with respect to systematic errors, and we derive robustness bounds for independent errors. We prove marginal stability in presence of shot noise. Additionally, we propose a robust version of FALQON which minimizes a regularized Lyapunov function, allowing the algorithm to reach the optimum even in conditions where standard FALQON fails. Finally, we generalize the Lyapunov-based approach to Quantum Machine Learning (QML) problems, providing a general theoretical foundation that can be implemented with a variety of circuit architectures.
Our theoretical results are supported through simulations for medium-scale common problems. The results related to robustness are tested on a MaxCut problem, while the QML results are tested on simple regression and binary classification tasks.
Tipologia del documento
Tesi di laurea
(Laurea magistrale)
Autore della tesi
Legnini, Mirko
Relatore della tesi
Correlatore della tesi
Scuola
Corso di studio
Ordinamento Cds
DM270
Parole chiave
Quantum Lyapunov Control, Quantum Computing, Discrete Optimization
Data di discussione della Tesi
24 Marzo 2025
URI
Altri metadati
Tipologia del documento
Tesi di laurea
(NON SPECIFICATO)
Autore della tesi
Legnini, Mirko
Relatore della tesi
Correlatore della tesi
Scuola
Corso di studio
Ordinamento Cds
DM270
Parole chiave
Quantum Lyapunov Control, Quantum Computing, Discrete Optimization
Data di discussione della Tesi
24 Marzo 2025
URI
Gestione del documento: