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:1909.06870 · Quantum Machine Intelligence

Learning adiabatic quantum algorithms over optimization problems

Davide Pastorello, Enrico Blanzieri, Valter Cavecchia

Published Jan 3, 2021• 12 citations
arXivHTMLPDF
DOI
10.1007/s42484-020-00030-w

Related papers

Adiabatic Training for Variational Quantum Algorithms

Ernesto Acosta, Carlos Cano, Guillermo Botella +1 more

arXiv:2410.18618•Lecture notes in computer science•Jan 1, 2025•3 citations

Optimizing adiabatic quantum pathways via a learning algorithm

Xiaodong Yang, Ran Liu, Jun Li +1 more

Designing proper time-dependent control fields for slowly varying the system to the ground state that encodes the problem solution is crucial for adiabatic quantum computation. However, inevitable perturbations in real applications demand us to accelerate the evolution so that the adiabatic errors can be prevented from accumulation. Here, by treating this trade-off task as a multiobjective optimization problem, we propose a gradient-free learning algorithm with pulse smoothing technique to search optimal adiabatic quantum pathways and apply it to the Landau-Zener Hamiltonian and Grover search Hamiltonian. Numerical comparisons with a linear schedule, local adiabatic theorem induced schedule, and gradient-based algorithm searched schedule reveal that the proposed method can achieve significant performance improvements in terms of the adiabatic time and the instantaneous ground-state population maintenance. The proposed method can be used to solve more complex and real adiabatic quantum computation problems.

arXiv:2006.15300•Physical Review A•Jul 16, 2020•11 citations

Quantum Algorithms for Optimization Problems

Dilnoz Muhamediyeva, Rustam Raximov, Shavkat Urokov

Lecture notes in computer science•Jul 29, 2025•1 citation

Learning quantum operator by quantum adiabatic computation

Ding Liu, Minghu Jiang

In this article, we introduce the quantum adiabatic computation to the research field of quantum operator learning. Compared with existing conventional optimization approaches, the adiabatic algorithm ensures to reach the global optimal solution, and thus avoids the local minimum problem. The performance of the experiments on two tasks indicates the feasibility and potentiality of this novel method. We firmly believe that the quantum adiabatic computation can be applied to other tasks of machine learning.

International Conference on Signal Processing•Oct 1, 2014•2 citations

Speedup in adiabatic evolution based quantum algorithms

Jie Sun, Songfeng Lu, Fang Liu

Science China Physics Mechanics and Astronomy•Jul 19, 2012•21 citations

Reinforcement-Learning-Based Quantum Adiabatic Algorithm Design for Integer Programming

Jiawei Zhu

Adiabatic quantum computing (AQC) is a computation protocol to solve difficult problems exploiting quantum advantage, directly applicable to optimization problems. In performing the AQC, different configurations of the Hamiltonian path could lead to dramatic differences in the computation efficiency. It is thus crucial to configure the Hamiltonian path to optimize the computation performance of AQC. Here we apply a reinforcement learning approach to configure AQC for integer programming, where we find the learning process automatically converges to a quantum algorithm that exhibits scaling advantage over the trivial AQC using a linear Hamiltonian path. This reinforcement-learning-based approach for quantum adiabatic algorithm design for integer programming can well be adapted to the quantum resources in different quantum computation devices, due to its built-in flexibility.

SPIN•Sep 1, 2021•0 citations
Designing proper time-dependent control fields for slowly varying the system to the ground state that encodes the problem solution is crucial for adiabatic quantum computation. However, inevitable perturbations in real applications demand us to accelerate the evolution so that the adiabatic errors can be prevented from accumulation. Here, by treating this trade-off task as a multiobjective optimization problem, we propose a gradient-free learning algorithm with pulse smoothing technique to search optimal adiabatic quantum pathways and apply it to the Landau-Zener Hamiltonian and Grover search Hamiltonian. Numerical comparisons with a linear schedule, local adiabatic theorem induced schedule, and gradient-based algorithm searched schedule reveal that the proposed method can achieve significant performance improvements in terms of the adiabatic time and the instantaneous ground-state population maintenance. The proposed method can be used to solve more complex and real adiabatic quantum computation problems.
In this article, we introduce the quantum adiabatic computation to the research field of quantum operator learning. Compared with existing conventional optimization approaches, the adiabatic algorithm ensures to reach the global optimal solution, and thus avoids the local minimum problem. The performance of the experiments on two tasks indicates the feasibility and potentiality of this novel method. We firmly believe that the quantum adiabatic computation can be applied to other tasks of machine learning.
Adiabatic quantum computing (AQC) is a computation protocol to solve difficult problems exploiting quantum advantage, directly applicable to optimization problems. In performing the AQC, different configurations of the Hamiltonian path could lead to dramatic differences in the computation efficiency. It is thus crucial to configure the Hamiltonian path to optimize the computation performance of AQC. Here we apply a reinforcement learning approach to configure AQC for integer programming, where we find the learning process automatically converges to a quantum algorithm that exhibits scaling advantage over the trivial AQC using a linear Hamiltonian path. This reinforcement-learning-based approach for quantum adiabatic algorithm design for integer programming can well be adapted to the quantum resources in different quantum computation devices, due to its built-in flexibility.