Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2409.15426 · Physical Review A

Feedback-based optimally controlled quantum states

Lucas T. Brady, Stuart Hadfield

Published Jun 4, 2025• 11 citations
arXivHTMLPDF

Abstract

Quantum optimization, for both classical and quantum functions, is one of the most well-studied applications of quantum computing, but recent trends have relied on hybrid methods that push much of the fine-tuning off onto costly classical algorithms. Feedback-based quantum algorithms, such as FALQON, avoid these fine-tuning problems but at the cost of additional circuit depth and a lack of convergence guarantees. In this work we take the local greedy information collected by Lyapunov feedback control and develop an analytic framework to use it to perturbatively update previous control layers, similar to the global optimal control achievable using Pontryagin optimal control. This perturbative methodology, which we call feedback-based optimally controlled quantum states (FOCQS), can be used to improve the results of feedback-based algorithms, like FALQON, providing better convergence but still no formal guarantees of convergence. Furthermore, this perturbative method can be used to push smooth annealing-like control protocol closer to the control optimum, even providing an iterative approach, albeit with diminishing returns. In numerical testing, we show improvements in convergence and required depth due to these methods over existing quantum feedback control methods.

DOI
10.1103/physreva.111.062406

Related papers

Feedback-based quantum strategies for constrained combinatorial optimization problems

Salahuddin Abdul Rahman, Özkan Karabacak, Rafał Wiśniewski

Feedback-based quantum algorithms have recently emerged as potential methods for approximating the ground states of Hamiltonians . One such algorithm, the feedback-based algorithm for quantum optimization (FALQON), is specifically designed to solve quadratic unconstrained binary optimization problems. Its extension, the feedback-based algorithm for quantum optimization with constraints (FALQON-C), was introduced to handle constrained optimization problems with equality and inequality constraints . In this work, we extend the feedback-based quantum algorithms framework to address a broader class of constraints known as invalid configuration (IC) constraints, which explicitly prohibit specific configurations of decision variables. We first present a transformation technique that converts the constrained optimization problem with invalid configuration constraints into an equivalent unconstrained problem by incorporating a penalizing term into the cost function. Then, leaning upon control theory, we propose an alternative method tailored for feedback-based quantum algorithms that directly tackles IC constraints without requiring slack variables. Our approach introduces a new operator that encodes the optimal feasible solution of the constrained optimization problem as its ground state. Then, a controlled quantum system based on the Lyapunov control technique is designed to ensure convergence to the ground state of this operator. Two approaches are introduced in the design of this operator to address IC constraints: the folded spectrum approach and the deflation approach. These methods eliminate the need for slack variables, significantly reducing the quantum circuit depth and the number of qubits required. We show the effectiveness of our proposed algorithms through numerical simulations.

arXiv:2502.14369•Future Generation Computer Systems•Jul 7, 2025•3 citations

Time rescaling for second-order feedback-based quantum optimization

Leticia Bertuzzi, João P. Engster, Evandro C. R. da Rosa +1 more

Feedback-based quantum algorithms recently gained attention by demonstrating how quantum computers can be used to solve optimization problems without resorting to hybrid quantum-classical architectures. Recent progress made with Feedback-based Algorithm for Quantum Optimization (FALQON) variants significantly reduced the depth of the required circuits. In this work, we merge the time-rescaled and second-order FALQON variants into a unified framework. The results show an important improvement over past modifications, reducing circuit depth and allowing a more flexible choice of time-steps, while maintaining stable solutions. This FALQON variant makes it suitable for the NISQ era.

quant-pharXiv:2609.21640•Sep 21, 2026•0 citations

Accelerating Feedback-based Algorithms for Quantum Optimization Using Gradient Descent

Masih Mozakka, Mohsen Heidari

Feedback-based methods have gained significant attention as an alternative training paradigm for the Quantum Approximate Optimization Algorithm (QAOA) in solving combinatorial optimization problems such as MAX-CUT. In particular, Quantum Lyapunov Control (QLC) employs feedback-driven control laws that guarantee monotonic non-decreasing objective values, can substantially reduce the training overhead of QAOA, and mitigate barren plateaus. However, these methods might require long control sequences, leading to sub-optimal convergence rates. In this work, we propose a hybrid method that incorporates per-layer gradient estimation to accelerate the convergence of QLC while preserving its low training overhead and stability guarantees. By leveraging layer-wise gradient information, the proposed approach selects near-optimal control parameters, resulting in significantly faster convergence and improved robustness. We validate the effectiveness of the method through extensive numerical experiments across a range of problem instances and optimization settings.

quant-pharXiv:2602.12387•Feb 16, 2026•1 citation

Feedback-based quantum algorithms for ground state preparation

James B. Larsen, Matthew Grace, Andrew Baczewski +1 more

The ground state properties of quantum many-body systems are a subject of interest across chemistry, materials science, and physics. Thus, algorithms for finding ground states can have broad impacts. Variational quantum algorithms are one class of ground state algorithms that has received significant attention in recent years. These algorithms utilize a hybrid quantum-classical computing framework to prepare ground states on quantum computers. However, this requires solving a classical optimization problem that can become prohibitively expensive in high dimensions. Here, we develop formulations of feedback-based quantum algorithms for ground state preparation that can be used to address this challenge for two broad classes of Hamiltonians: Fermi-Hubbard Hamiltonians, and molecular Hamiltonians represented in second quantization. Feedback-based quantum algorithms are optimization-free; in place of classical optimization, quantum circuit parameters are set according to a deterministic feedback law derived from quantum Lyapunov control principles. This feedback law guarantees a monotonic improvement in solution quality with respect to the depth of the quantum circuit. A variety of numerical illustrations are provided that analyze the convergence and robustness of feedback-based quantum algorithms for these problem classes. Published by the American Physical Society 2024

arXiv:2303.02917•Physical Review Research•Sep 25, 2024•27 citations

Feedback-based quantum optimization with low depth and measurement

Zi-Wen Huang, Jia-Cheng Fan, Xiao-Hui Ni +5 more

Feedback-based ALgorithm for Quantum OptimizatioN (FALQON) is a hybrid quantum-classical algorithm for solving combinatorial optimization problems, which circumvents classical parameter optimization but requires a deep quantum circuit. To reduce circuit depth, Arai et al. proposed second-order FALQON (SO-FALQON), achieving the best depth reduction among existing approaches. However, SO-FALQON brings a 2.3 times per-step measurement overhead, as it needs to calculate an additional second-order control coefficient. In this paper, inspired by the Backtracking Line Search (BLS) theory, we propose another method called BLS-FALQON, which not only reduces circuit depth to a comparable extent, but also achieves fewer measurements than SO-FALQON. Numerical simulations on max-cut problem with 8 to 20 vertices demonstrate that BLS-FALQON reduces the total measurement count by 37.7% compared to SO-FALQON, while maintaining a comparable circuit depth. Furthermore, we conduct real quantum hardware experiments on the Tianyan-176 quantum computer, which uses the zuchongzhi2 superconducting quantum processor, confirming that BLS-FALQON remains effective under real quantum hardware conditions.

quant-pharXiv:2609.32433•Sep 29, 2026•0 citations

Feedback-Based Quantum Algorithms for Optimization

Salahuddin Abdul Rahman

This thesis develops a control-theoretic framework for the design and analysis of quantum optimization algorithms.The central idea is to model quantum algorithms as controlled dynamical systems in which quantum gates act as control inputs that steer the system's state toward the ground or excited states of a target Hamiltonian.Within this framework, the thesis advances the family of feedback-based quantum algorithms (FQAs), building on Lyapunov-inspired feedback principles introduced in prior work, and develops new algorithmic extensions for constrained optimization and excited state preparation.This work is motivated by the potential of FQAs to tackle complex optimization problems, such as preparing ground states of Hamiltonians, which underpin a wide range of applications in engineering, chemistry, and combinatorial optimization.This work enhances the performance of FQAs and extends their applicability to a broader class of quantum optimization problems.It consists of three main parts.The first part focuses on enhancing the performance and robustness of FQAs.It introduces an adaptive sampling noise mitigation technique that incorporates a new control law into the algorithm design to improve robustness and convergence with limited measurements.The second part extends the feedback-based framework to excited state preparation, yielding two new algorithms: the feedback-based quantum algorithm for excited states preparation (FQAE) and the weighted feedback-based quantum algorithm for excited states preparation (WFQAE), with applications in quantum chemistry and many-body physics.The third part generalizes the feedback-based framework to tackle more complex combinatorial optimization problems, specifically those with inequality and invalid configuration constraints, by proposing the feedback-based algorithm for quantum optimization with constraints (FALQON-C) and the feedback-based algorithm for quantum optimization with invalid configuration constraints (FALQON-IC).The design of these algorithms leverages control theory to reduce circuit depth while maintaining convergence efficiency within the feedback framework.The thesis demonstrates that control-theoretic tools such as Lyapunov stability analysis and feedback design provide a systematic foundation for developing quantum algorithms with improved robustness, generalization, and scalability.The results offer new insights into quantum optimization and highlight the role of control theory as a guiding principle for the development of efficient feedback-based quantum algorithms.iii ResuméDenne afhandling handler om, hvordan man kan bruge kontrolteori til at udvikle og analysere kvantealgoritmer til optimering.Hovedideen er at betragte kvantealgoritmer som dynamiske systemer, der kan styres, hvor kvanteoperatorer fungerer som styringssignaler, der gradvist bringer systemet hen mod en ønsket tilstand, for eksempel grundtilstanden af en given Hamilton-operator.Inden for denne ramme videreudvikler afhandlingen såkaldte feedback-baserede kvantealgoritmer (FQAs).Disse algoritmer bruger løbende målinger og feedback til at justere sig selv, inspireret af klassiske principper fra kontrolteori.Afhandlingen bygger videre på tidligere arbejde og introducerer nye metoder, som gør det muligt både at løse optimeringsproblemer med begrænsninger og at beregne exciterede tilstande.Motivation for arbejdet er, at denne type algoritmer har potentiale til at løse svære optimeringsproblemer, som f.eks.at finde grundtilstande af Hamiltonoperatorer.Sådanne problemer er centrale i mange anvendelser inden for ingeniørvidenskab, kemi og kombinatorisk optimering.Afhandlingen forbedrer både ydeevnen og anvendeligheden af feedback-baserede kvantealgoritmer og er opdelt i tre hoveddele.Den første del fokuserer på at gøre algoritmerne mere robuste og mindre følsomme over for støj i målinger, blandt andet ved at indføre en adaptiv metode, som fungerer bedre, når antallet af målinger er begrænset.Den anden del udvider metoden til også at kunne beregne exciterede tilstande.Dette fører til to nye algoritmer, som kan anvendes inden for blandt andet kvantekemi og mangelegeme-fysik.Den tredje del viser, hvordan den feedback-baserede tilgang kan bruges til mere komplekse optimeringsproblemer, hvor der er begrænsninger eller ugyldige løsninger.Her introduceres nye algoritmer, der er designet til at håndtere sådanne problemer effektivt, samtidig med at kvantekredsløbene holdes så simple som muligt.Samlet set viser afhandlingen, at værktøjer fra kontrolteori, som stabilitetsanalyse og feedback-design, giver et solidt og systematisk grundlag for at udvikle mere robuste, fleksible og skalerbare kvantealgoritmer.Resultaterne giver ny indsigt i kvanteoptimering og understreger kontrolteoriens vigtige rolle i udviklingen af effektive feedback-baserede kvantealgoritmer.

•Jan 1, 2026•0 citations
Quantum optimization, for both classical and quantum functions, is one of the most well-studied applications of quantum computing, but recent trends have relied on hybrid methods that push much of the fine-tuning off onto costly classical algorithms. Feedback-based quantum algorithms, such as FALQON, avoid these fine-tuning problems but at the cost of additional circuit depth and a lack of convergence guarantees. In this work we take the local greedy information collected by Lyapunov feedback control and develop an analytic framework to use it to perturbatively update previous control layers, similar to the global optimal control achievable using Pontryagin optimal control. This perturbative methodology, which we call feedback-based optimally controlled quantum states (FOCQS), can be used to improve the results of feedback-based algorithms, like FALQON, providing better convergence but still no formal guarantees of convergence. Furthermore, this perturbative method can be used to push smooth annealing-like control protocol closer to the control optimum, even providing an iterative approach, albeit with diminishing returns. In numerical testing, we show improvements in convergence and required depth due to these methods over existing quantum feedback control methods.
Feedback-based quantum algorithms have recently emerged as potential methods for approximating the ground states of Hamiltonians . One such algorithm, the feedback-based algorithm for quantum optimization (FALQON), is specifically designed to solve quadratic unconstrained binary optimization problems. Its extension, the feedback-based algorithm for quantum optimization with constraints (FALQON-C), was introduced to handle constrained optimization problems with equality and inequality constraints . In this work, we extend the feedback-based quantum algorithms framework to address a broader class of constraints known as invalid configuration (IC) constraints, which explicitly prohibit specific configurations of decision variables. We first present a transformation technique that converts the constrained optimization problem with invalid configuration constraints into an equivalent unconstrained problem by incorporating a penalizing term into the cost function. Then, leaning upon control theory, we propose an alternative method tailored for feedback-based quantum algorithms that directly tackles IC constraints without requiring slack variables. Our approach introduces a new operator that encodes the optimal feasible solution of the constrained optimization problem as its ground state. Then, a controlled quantum system based on the Lyapunov control technique is designed to ensure convergence to the ground state of this operator. Two approaches are introduced in the design of this operator to address IC constraints: the folded spectrum approach and the deflation approach. These methods eliminate the need for slack variables, significantly reducing the quantum circuit depth and the number of qubits required. We show the effectiveness of our proposed algorithms through numerical simulations.
Feedback-based quantum algorithms recently gained attention by demonstrating how quantum computers can be used to solve optimization problems without resorting to hybrid quantum-classical architectures. Recent progress made with Feedback-based Algorithm for Quantum Optimization (FALQON) variants significantly reduced the depth of the required circuits. In this work, we merge the time-rescaled and second-order FALQON variants into a unified framework. The results show an important improvement over past modifications, reducing circuit depth and allowing a more flexible choice of time-steps, while maintaining stable solutions. This FALQON variant makes it suitable for the NISQ era.
Feedback-based methods have gained significant attention as an alternative training paradigm for the Quantum Approximate Optimization Algorithm (QAOA) in solving combinatorial optimization problems such as MAX-CUT. In particular, Quantum Lyapunov Control (QLC) employs feedback-driven control laws that guarantee monotonic non-decreasing objective values, can substantially reduce the training overhead of QAOA, and mitigate barren plateaus. However, these methods might require long control sequences, leading to sub-optimal convergence rates. In this work, we propose a hybrid method that incorporates per-layer gradient estimation to accelerate the convergence of QLC while preserving its low training overhead and stability guarantees. By leveraging layer-wise gradient information, the proposed approach selects near-optimal control parameters, resulting in significantly faster convergence and improved robustness. We validate the effectiveness of the method through extensive numerical experiments across a range of problem instances and optimization settings.
The ground state properties of quantum many-body systems are a subject of interest across chemistry, materials science, and physics. Thus, algorithms for finding ground states can have broad impacts. Variational quantum algorithms are one class of ground state algorithms that has received significant attention in recent years. These algorithms utilize a hybrid quantum-classical computing framework to prepare ground states on quantum computers. However, this requires solving a classical optimization problem that can become prohibitively expensive in high dimensions. Here, we develop formulations of feedback-based quantum algorithms for ground state preparation that can be used to address this challenge for two broad classes of Hamiltonians: Fermi-Hubbard Hamiltonians, and molecular Hamiltonians represented in second quantization. Feedback-based quantum algorithms are optimization-free; in place of classical optimization, quantum circuit parameters are set according to a deterministic feedback law derived from quantum Lyapunov control principles. This feedback law guarantees a monotonic improvement in solution quality with respect to the depth of the quantum circuit. A variety of numerical illustrations are provided that analyze the convergence and robustness of feedback-based quantum algorithms for these problem classes. Published by the American Physical Society 2024
Feedback-based ALgorithm for Quantum OptimizatioN (FALQON) is a hybrid quantum-classical algorithm for solving combinatorial optimization problems, which circumvents classical parameter optimization but requires a deep quantum circuit. To reduce circuit depth, Arai et al. proposed second-order FALQON (SO-FALQON), achieving the best depth reduction among existing approaches. However, SO-FALQON brings a 2.3 times per-step measurement overhead, as it needs to calculate an additional second-order control coefficient. In this paper, inspired by the Backtracking Line Search (BLS) theory, we propose another method called BLS-FALQON, which not only reduces circuit depth to a comparable extent, but also achieves fewer measurements than SO-FALQON. Numerical simulations on max-cut problem with 8 to 20 vertices demonstrate that BLS-FALQON reduces the total measurement count by 37.7% compared to SO-FALQON, while maintaining a comparable circuit depth. Furthermore, we conduct real quantum hardware experiments on the Tianyan-176 quantum computer, which uses the zuchongzhi2 superconducting quantum processor, confirming that BLS-FALQON remains effective under real quantum hardware conditions.
This thesis develops a control-theoretic framework for the design and analysis of quantum optimization algorithms.The central idea is to model quantum algorithms as controlled dynamical systems in which quantum gates act as control inputs that steer the system's state toward the ground or excited states of a target Hamiltonian.Within this framework, the thesis advances the family of feedback-based quantum algorithms (FQAs), building on Lyapunov-inspired feedback principles introduced in prior work, and develops new algorithmic extensions for constrained optimization and excited state preparation.This work is motivated by the potential of FQAs to tackle complex optimization problems, such as preparing ground states of Hamiltonians, which underpin a wide range of applications in engineering, chemistry, and combinatorial optimization.This work enhances the performance of FQAs and extends their applicability to a broader class of quantum optimization problems.It consists of three main parts.The first part focuses on enhancing the performance and robustness of FQAs.It introduces an adaptive sampling noise mitigation technique that incorporates a new control law into the algorithm design to improve robustness and convergence with limited measurements.The second part extends the feedback-based framework to excited state preparation, yielding two new algorithms: the feedback-based quantum algorithm for excited states preparation (FQAE) and the weighted feedback-based quantum algorithm for excited states preparation (WFQAE), with applications in quantum chemistry and many-body physics.The third part generalizes the feedback-based framework to tackle more complex combinatorial optimization problems, specifically those with inequality and invalid configuration constraints, by proposing the feedback-based algorithm for quantum optimization with constraints (FALQON-C) and the feedback-based algorithm for quantum optimization with invalid configuration constraints (FALQON-IC).The design of these algorithms leverages control theory to reduce circuit depth while maintaining convergence efficiency within the feedback framework.The thesis demonstrates that control-theoretic tools such as Lyapunov stability analysis and feedback design provide a systematic foundation for developing quantum algorithms with improved robustness, generalization, and scalability.The results offer new insights into quantum optimization and highlight the role of control theory as a guiding principle for the development of efficient feedback-based quantum algorithms.iii ResuméDenne afhandling handler om, hvordan man kan bruge kontrolteori til at udvikle og analysere kvantealgoritmer til optimering.Hovedideen er at betragte kvantealgoritmer som dynamiske systemer, der kan styres, hvor kvanteoperatorer fungerer som styringssignaler, der gradvist bringer systemet hen mod en ønsket tilstand, for eksempel grundtilstanden af en given Hamilton-operator.Inden for denne ramme videreudvikler afhandlingen såkaldte feedback-baserede kvantealgoritmer (FQAs).Disse algoritmer bruger løbende målinger og feedback til at justere sig selv, inspireret af klassiske principper fra kontrolteori.Afhandlingen bygger videre på tidligere arbejde og introducerer nye metoder, som gør det muligt både at løse optimeringsproblemer med begrænsninger og at beregne exciterede tilstande.Motivation for arbejdet er, at denne type algoritmer har potentiale til at løse svære optimeringsproblemer, som f.eks.at finde grundtilstande af Hamiltonoperatorer.Sådanne problemer er centrale i mange anvendelser inden for ingeniørvidenskab, kemi og kombinatorisk optimering.Afhandlingen forbedrer både ydeevnen og anvendeligheden af feedback-baserede kvantealgoritmer og er opdelt i tre hoveddele.Den første del fokuserer på at gøre algoritmerne mere robuste og mindre følsomme over for støj i målinger, blandt andet ved at indføre en adaptiv metode, som fungerer bedre, når antallet af målinger er begrænset.Den anden del udvider metoden til også at kunne beregne exciterede tilstande.Dette fører til to nye algoritmer, som kan anvendes inden for blandt andet kvantekemi og mangelegeme-fysik.Den tredje del viser, hvordan den feedback-baserede tilgang kan bruges til mere komplekse optimeringsproblemer, hvor der er begrænsninger eller ugyldige løsninger.Her introduceres nye algoritmer, der er designet til at håndtere sådanne problemer effektivt, samtidig med at kvantekredsløbene holdes så simple som muligt.Samlet set viser afhandlingen, at værktøjer fra kontrolteori, som stabilitetsanalyse og feedback-design, giver et solidt og systematisk grundlag for at udvikle mere robuste, fleksible og skalerbare kvantealgoritmer.Resultaterne giver ny indsigt i kvanteoptimering og understreger kontrolteoriens vigtige rolle i udviklingen af effektive feedback-baserede kvantealgoritmer.