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

Lyapunov Control-Inspired Quantum Algorithms for Ground State Preparation.

James Larsen, Matthew Grace, Andrew Baczewski, Alicia B Magann

Published Oct 1, 2022• 0 citations
Publisher
DOI
10.2172/2005650

Related papers

Lyapunov control-inspired protocol for quantum optimization.

Alicia B Magann, Kenneth Rudinger, Matthew Grace +1 more

Lyapunov control-inspired protocol for quantum optimization

•Mar 1, 2021•0 citations

Preparing entangled states by Lyapunov control

Z. C. Shi, L. C. Wang, X. X. Yi

Quantum Information Processing•Sep 20, 2016•10 citations

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

Solving Lyapunov equation by quantum algorithm

He Sun, Jing Zhang

Control Theory and Technology•Nov 1, 2017•8 citations

Weighted Feedback-Based Quantum Algorithm for Excited States Calculation

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

Drawing inspiration from the Lyapunov control technique for quantum systems, feedback-based quantum al-gorithms have been proposed for calculating the ground states of Hamiltonians. In this work, we consider extending these algorithms to tackle calculating excited states. Inspired by the weighted subspace-search variational quantum eigensolver al-gorithm, we propose a novel weighted feedback-based quantum algorithm for excited state calculation. We show that depending on how we design the weights and the feedback law, we can prepare the pth excited state or lowest energy states up to the pth excited state. Through an application in quantum chemistry, we show the effectiveness of the proposed algorithm, evaluating its efficacy via numerical simulations.

arXiv:2404.19386•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•5 citations

Lyapunov-based unified control method for closed quantum systems

Shuang Cong, Lei Zhou, Fangfang Meng

Journal of the Franklin Institute•Jul 13, 2020•9 citations
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
Drawing inspiration from the Lyapunov control technique for quantum systems, feedback-based quantum al-gorithms have been proposed for calculating the ground states of Hamiltonians. In this work, we consider extending these algorithms to tackle calculating excited states. Inspired by the weighted subspace-search variational quantum eigensolver al-gorithm, we propose a novel weighted feedback-based quantum algorithm for excited state calculation. We show that depending on how we design the weights and the feedback law, we can prepare the pth excited state or lowest energy states up to the pth excited state. Through an application in quantum chemistry, we show the effectiveness of the proposed algorithm, evaluating its efficacy via numerical simulations.