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

Advances in intelligent systems and computing

Hybrid Quantum-Classical Dynamic Programming Algorithm

Chih-Chieh Chen, Kodai Shiba, Masaru Sogabe, Katsuyoshi Sakamoto, Tomah Sogabe

Published Jan 1, 2021• 1 citation
Publisher
DOI
10.1007/978-3-030-73113-7_18

Related papers

Hybrid quantum-classical Ulam-von Neumann linear solver-based quantum dynamic programing algorithm

Chih-Chieh Chen

The Japanese Society for Artificial Intelligence•Apr 1, 2020•8 citations

SHARC meets TEQUILA: mixed quantum-classical dynamics on a quantum computer using a hybrid quantum-classical algorithm

Eduarda Sangiogo Gil, Markus Oppel, Jakob S. Kottmann +1 more

Recent developments in quantum computing are highly promising, particularly in the realm of quantum chemistry. Due to the noisy nature of currently available quantum hardware, hybrid quantum-classical algorithms have emerged as a reliable option for near-term simulations. Mixed quantum-classical dynamics methods effectively capture nonadiabatic effects by integrating classical nuclear dynamics with quantum chemical computations of the electronic properties. However, these methods face challenges due to the high computational cost of the quantum chemistry part. To mitigate the computational demand, we propose a method where the required electronic properties are computed through a hybrid quantum-classical approach on combination of classical and quantum hardware. This framework employs the variational quantum eigensolver and variational quantum deflation algorithms to obtain ground and excited state energies, gradients, nonadiabatic coupling vectors, and transition dipole moments. These quantities are used to propagate the nonadiabatic molecular dynamics using the Tully’s fewest switches surface hopping method, although the implementation is also compatible with other molecular dynamics approaches. The approach, implemented by integrating the molecular dynamics program package SHARC with the TEQUILA quantum computing framework, is validated by studying the cis-trans photoisomerization of methanimine and the electronic relaxation of ethylene. The results show qualitatively accurate molecular dynamics that align with experimental findings and other computational studies. This work is expected to mark a significant step towards achieving a "quantum advantage" for realistic chemical simulations.

Chemical Science•Nov 28, 2024•10 citations

Quantum Algorithms for Approximate Dynamic Programming

Pooya Ronagh

Bulletin of the American Physical Society•Mar 5, 2020•0 citations

Quantum-Classical Hybrid Algorithms

Belal Ehsan Baaquie, L. C. Kwek

Springer eBooks•Jan 1, 2023•3 citations

Quantum Algorithms for Optimization

Ansh Bansal

IOSR Journal of Computer Engineering•Oct 1, 2025•0 citations

Quantum Speed-ups for Single-machine Scheduling Problems

Camille Grange, Eric Bourreau, Michaël Poss +1 more

Grover search is currently one of the main approaches to obtain quantum speed-ups for combinatorial optimization problems. The combination of Quantum Minimum Finding (obtained from Grover search) with dynamic programming has proved particularly efficient to improve the worst-case complexity of several NP-hard optimization problems. Specifically, for these problems, the classical dynamic programming complexity (ignoring the polynomial factors) in O* (cn) can be reduced by a bounded-error hybrid quantum-classical algorithm to O* (cnquant) for cquant < c. In this paper, we extend the resulting hybrid dynamic programming algorithm to three examples of single-machine scheduling problems: minimizing the total weighted completion time with deadlines, minimizing the total weighted completion time with precedence constraints, and minimizing the total weighted tardiness. The extension relies on the inclusion of a pseudo-polynomial term in the state space of the dynamic programming as well as an additive term in the recurrence.

Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 15, 2023•2 citations
Recent developments in quantum computing are highly promising, particularly in the realm of quantum chemistry. Due to the noisy nature of currently available quantum hardware, hybrid quantum-classical algorithms have emerged as a reliable option for near-term simulations. Mixed quantum-classical dynamics methods effectively capture nonadiabatic effects by integrating classical nuclear dynamics with quantum chemical computations of the electronic properties. However, these methods face challenges due to the high computational cost of the quantum chemistry part. To mitigate the computational demand, we propose a method where the required electronic properties are computed through a hybrid quantum-classical approach on combination of classical and quantum hardware. This framework employs the variational quantum eigensolver and variational quantum deflation algorithms to obtain ground and excited state energies, gradients, nonadiabatic coupling vectors, and transition dipole moments. These quantities are used to propagate the nonadiabatic molecular dynamics using the Tully’s fewest switches surface hopping method, although the implementation is also compatible with other molecular dynamics approaches. The approach, implemented by integrating the molecular dynamics program package SHARC with the TEQUILA quantum computing framework, is validated by studying the cis-trans photoisomerization of methanimine and the electronic relaxation of ethylene. The results show qualitatively accurate molecular dynamics that align with experimental findings and other computational studies. This work is expected to mark a significant step towards achieving a "quantum advantage" for realistic chemical simulations.
Grover search is currently one of the main approaches to obtain quantum speed-ups for combinatorial optimization problems. The combination of Quantum Minimum Finding (obtained from Grover search) with dynamic programming has proved particularly efficient to improve the worst-case complexity of several NP-hard optimization problems. Specifically, for these problems, the classical dynamic programming complexity (ignoring the polynomial factors) in O* (cn) can be reduced by a bounded-error hybrid quantum-classical algorithm to O* (cnquant) for cquant < c. In this paper, we extend the resulting hybrid dynamic programming algorithm to three examples of single-machine scheduling problems: minimizing the total weighted completion time with deadlines, minimizing the total weighted completion time with precedence constraints, and minimizing the total weighted tardiness. The extension relies on the inclusion of a pseudo-polynomial term in the state space of the dynamic programming as well as an additive term in the recurrence.