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:2506.09214 · Physical review. E

Classical algorithm inspired by the feedback-based algorithm for quantum optimization and local counterdiabatic driving

Takuya Hatomura

Published Oct 8, 2025• 0 citations
arXivHTMLPDF

Abstract

We propose a quantum-inspired classical algorithm for combinatorial optimization problems, named the counterdiabaticity-assisted classical algorithm for optimization (CACAO). In this algorithm, a solution of a given combinatorial optimization problem is heuristically searched with classical spin dynamics based on quantum Lyapunov control of local counterdiabatic driving. We compare the performance of CACAO with that of quantum time-evolution algorithms, i.e., quantum annealing, the feedback-based algorithm for quantum optimization (known as FALQON), and the counterdiabatic feedback-based quantum algorithm (known as CD-FQA). We also study the performance of CACAO applied to large systems up to 10000 spins.

DOI
10.1103/v7t1-42gh

Related papers

Feedback-based quantum algorithm inspired by counterdiabatic driving

Rajesh K. Malla, Hiroki Sukeno, Hongye Yu +3 more

In recent quantum algorithmic developments, a feedback-based approach has shown promise for preparing quantum many-body system ground states and solving combinatorial optimization problems. This method utilizes quantum Lyapunov control to iteratively construct quantum circuits. Here, we propose a substantial enhancement by implementing a protocol that uses ideas from quantum Lyapunov control and the counterdiabatic driving protocol, a key concept from quantum adiabaticity. Our approach introduces an additional control field inspired by counterdiabatic driving. We apply our algorithm to prepare ground states in one-dimensional quantum Ising spin chains. Comprehensive simulations demonstrate a remarkable acceleration in population transfer to low-energy states within a significantly reduced time frame compared to conventional feedback-based quantum algorithms. This acceleration translates to a reduced quantum circuit depth, a critical metric for potential quantum computer implementation. We validate our algorithm on the IBM cloud computer, highlighting its efficacy in expediting quantum computations for many-body systems and combinatorial optimization problems. Published by the American Physical Society 2024

arXiv:2401.15303•Physical Review Research•Oct 25, 2024•21 citations

Feedback-based quantum optimization and its classical counterpart: quantum advantage and the power of classical algorithms

Tomohiro Hattori, Takuya Hatomura

Feedback-based quantum optimization is a quantum approach to combinatorial optimization. In this paper, we introduce the classical counterpart of feedback-based quantum optimization by using the quantum-classical correspondence of spin systems to discuss the possibility of quantum advantage. It also enables us to develop higher-order theory of a previously proposed classical approach to feedback-based quantum optimization. First, we compare the feedback-based algorithm for quantum optimization (FALQON) and its variant with their classical counterparts. Then, we perform benchmark tests of various quantum and classical algorithms with small-scale instances, and of classical algorithms with large-scale instances. Main findings are that (i) quantum algorithms can be advantageous to classical algorithms in terms of the quality of solutions, while classical algorithms tend to show faster convergence than quantum ones, and (ii) one of the classical algorithms discussed in this paper shows significant scalability for higher-order unconstrained binary optimization problems. These findings highlight the importance of quantumness and the usefulness of classical approaches.

quant-pharXiv:2605.13082•May 14, 2026•0 citations

Lyapunov controlled counterdiabatic quantum optimization

Pranav Chandarana, Koushik Paul, Kasturi Ranjan Swain +2 more

Abstract We introduce a quantum algorithm that integrates counterdiabatic (CD) protocols with quantum Lyapunov control (QLC) to address combinatorial optimization problems. This approach offers versatility, allowing implementation as either a digital-analog or purely digital algorithm based on selected control strategies. By examining spin-glass Hamiltonians, we illustrate how the algorithm can explore alternative paths to enhance solution outcomes compared to conventional CD techniques. This method reduces dependence on extensive higher-order CD terms and on classical optimization techniques, making it more suitable for existing quantum computing platforms. The combination of digital compression via CD protocols and the adaptable nature of QLC methods positions this approach as a promising candidate for near-term quantum devices.

arXiv:2409.12525•Quantum Science and Technology•Jun 15, 2026•12 citations

Digitized-counterdiabatic quantum approximate optimization algorithm

Pranav Chandarana, Narendra N. Hegade, Koushik Paul +4 more

The quantum approximate optimization algorithm (QAOA) has proved to be an effective classical-quantum algorithm serving multiple purposes, from solving combinatorial optimization problems to finding the ground state of many-body quantum systems. Since the QAOA is an Ansatz-dependent algorithm, there is always a need to design Ans\"atze for better optimization. To this end, we propose a digitized version of the QAOA enhanced via the use of shortcuts to adiabaticity. Specifically, we use a counterdiabatic (CD) driving term to design a better Ansatz, along with the Hamiltonian and mixing terms, enhancing the global performance. We apply our digitized-CD QAOA to Ising models, classical optimization problems, and the $P$-spin model, demonstrating that it outperforms the standard QAOA in all cases we study.

arXiv:2107.02789•Physical Review Research•Feb 22, 2022•123 citations

A Model Predictive Control-Inspired Quantum Algorithm

Dominic Messina, Alicia B. Magann, Mohan Sarovar +1 more

We introduce a new hybrid quantum-classical algorithm inspired by an advanced control strategy known as model predictive control (MPC). This algorithm unifies the optimization-based design of variational quantum algorithms (VQAs) with the feedback-based design of feedback-based quantum algorithms (FQAs). Variational circuit parameters are optimized using a layer-wise receding horizon strategy, where observable measurements after every layer initialize a classically simulated dynamic model used to predict quantum state evolution and optimize over future parameterized gates. This hybrid algorithm can be used for applications such as ground state preparation and approximate combinatorial optimization, and presents an ideal use case for the integration of quantum computers with high-performance computing, where the latter resource can be used to increase the scale and efficiency of the predictions critical to MPC. We show through mathematical proof and numerical evidence that the MPC-based algorithm can be guaranteed to at least match the performance of FQAs. Through simulations on Max-Cut problems and a two-dimensional transverse-field Ising model, we demonstrate that relaxed implementations of the MPC-based algorithm can also provide improved performance in practice compared to an FQA.

quant-pharXiv:2607.24992•Jul 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
We propose a quantum-inspired classical algorithm for combinatorial optimization problems, named the counterdiabaticity-assisted classical algorithm for optimization (CACAO). In this algorithm, a solution of a given combinatorial optimization problem is heuristically searched with classical spin dynamics based on quantum Lyapunov control of local counterdiabatic driving. We compare the performance of CACAO with that of quantum time-evolution algorithms, i.e., quantum annealing, the feedback-based algorithm for quantum optimization (known as FALQON), and the counterdiabatic feedback-based quantum algorithm (known as CD-FQA). We also study the performance of CACAO applied to large systems up to 10000 spins.
In recent quantum algorithmic developments, a feedback-based approach has shown promise for preparing quantum many-body system ground states and solving combinatorial optimization problems. This method utilizes quantum Lyapunov control to iteratively construct quantum circuits. Here, we propose a substantial enhancement by implementing a protocol that uses ideas from quantum Lyapunov control and the counterdiabatic driving protocol, a key concept from quantum adiabaticity. Our approach introduces an additional control field inspired by counterdiabatic driving. We apply our algorithm to prepare ground states in one-dimensional quantum Ising spin chains. Comprehensive simulations demonstrate a remarkable acceleration in population transfer to low-energy states within a significantly reduced time frame compared to conventional feedback-based quantum algorithms. This acceleration translates to a reduced quantum circuit depth, a critical metric for potential quantum computer implementation. We validate our algorithm on the IBM cloud computer, highlighting its efficacy in expediting quantum computations for many-body systems and combinatorial optimization problems. Published by the American Physical Society 2024
Feedback-based quantum optimization is a quantum approach to combinatorial optimization. In this paper, we introduce the classical counterpart of feedback-based quantum optimization by using the quantum-classical correspondence of spin systems to discuss the possibility of quantum advantage. It also enables us to develop higher-order theory of a previously proposed classical approach to feedback-based quantum optimization. First, we compare the feedback-based algorithm for quantum optimization (FALQON) and its variant with their classical counterparts. Then, we perform benchmark tests of various quantum and classical algorithms with small-scale instances, and of classical algorithms with large-scale instances. Main findings are that (i) quantum algorithms can be advantageous to classical algorithms in terms of the quality of solutions, while classical algorithms tend to show faster convergence than quantum ones, and (ii) one of the classical algorithms discussed in this paper shows significant scalability for higher-order unconstrained binary optimization problems. These findings highlight the importance of quantumness and the usefulness of classical approaches.
Abstract We introduce a quantum algorithm that integrates counterdiabatic (CD) protocols with quantum Lyapunov control (QLC) to address combinatorial optimization problems. This approach offers versatility, allowing implementation as either a digital-analog or purely digital algorithm based on selected control strategies. By examining spin-glass Hamiltonians, we illustrate how the algorithm can explore alternative paths to enhance solution outcomes compared to conventional CD techniques. This method reduces dependence on extensive higher-order CD terms and on classical optimization techniques, making it more suitable for existing quantum computing platforms. The combination of digital compression via CD protocols and the adaptable nature of QLC methods positions this approach as a promising candidate for near-term quantum devices.
The quantum approximate optimization algorithm (QAOA) has proved to be an effective classical-quantum algorithm serving multiple purposes, from solving combinatorial optimization problems to finding the ground state of many-body quantum systems. Since the QAOA is an Ansatz-dependent algorithm, there is always a need to design Ans\"atze for better optimization. To this end, we propose a digitized version of the QAOA enhanced via the use of shortcuts to adiabaticity. Specifically, we use a counterdiabatic (CD) driving term to design a better Ansatz, along with the Hamiltonian and mixing terms, enhancing the global performance. We apply our digitized-CD QAOA to Ising models, classical optimization problems, and the PPP-spin model, demonstrating that it outperforms the standard QAOA in all cases we study.
We introduce a new hybrid quantum-classical algorithm inspired by an advanced control strategy known as model predictive control (MPC). This algorithm unifies the optimization-based design of variational quantum algorithms (VQAs) with the feedback-based design of feedback-based quantum algorithms (FQAs). Variational circuit parameters are optimized using a layer-wise receding horizon strategy, where observable measurements after every layer initialize a classically simulated dynamic model used to predict quantum state evolution and optimize over future parameterized gates. This hybrid algorithm can be used for applications such as ground state preparation and approximate combinatorial optimization, and presents an ideal use case for the integration of quantum computers with high-performance computing, where the latter resource can be used to increase the scale and efficiency of the predictions critical to MPC. We show through mathematical proof and numerical evidence that the MPC-based algorithm can be guaranteed to at least match the performance of FQAs. Through simulations on Max-Cut problems and a two-dimensional transverse-field Ising model, we demonstrate that relaxed implementations of the MPC-based algorithm can also provide improved performance in practice compared to an FQA.
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.