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

APS

Progress in the quantum Adiabatic algorithm

Edward Farhi

Published Mar 1, 2015• 1 citation
OpenAlex

Related papers

The complexity of the Quantum Adiabatic Algorithm

A. P. Young, Sergey Knysh, Vadim Smelyanskiy

Computer Physics Communications•Jun 9, 2010•7 citations

Complexity of the Quantum Adiabatic Algorithm

Itay Hen

The Quantum Adiabatic Algorithm (QAA) has been proposed as a mechanism for efficiently solving optimization problems on a quantum computer. Since adiabatic computation is analog in nature and does not require the design and use of quantum gates, it can be thought of as a simpler and perhaps more profound method for performing quantum computations that might also be easier to implement experimentally. While these features have generated substantial research in QAA, to date there is still a lack of solid evidence that the algorithm can outperform classical optimization algorithms.

Bulletin of the American Physical Society•Mar 18, 2013•0 citations

Topological Obstructions in Quantum Adiabatic Algorithms

Prathamesh S. Joshi, Emil Prodan

We point out that, when an optimization problem has more than one solution, the quantum adiabatic algorithms (QAA) encounter topological obstructions leading to adiabatic spectral flows where spectral branches unavoidably traverse the spectral gap above the ground states of the quantum Hamiltonians. This raises serious doubts about the validity of the algorithms in such situations. However, using the Max-Cut problem as an example, we explain and demonstrate here that QAAs correctly detect all existing solutions in one single run. This newly discovered capacity of QAAs to simultaneously detect multiple solutions to an optimization problem can have an important impact on future developments of quantum variational algorithms

quant-pharXiv:2603.20567•Mar 24, 2026•0 citations

Adiabatic Quantum Computation

Catherine C. McGeoch

Synthesis lectures on quantum computing•Jan 1, 2014•8 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

Machine learning assisted quantum adiabatic algorithm design

Jian Hui Lin, Meng Ye, Jiawei Zhu +1 more

Quantum computing has made dramatic progress in the last decade. The quantum platforms including superconducting qubits, photonic devices, and atomic ensembles, have all reached a new era, with unprecedented quantum control capability developed. Quantum computation advantage over classical computers has been reported on certain computation tasks. A promising computing protocol of using the computation power in these controllable quantum devices is implemented through quantum adiabatic computing, where quantum algorithm design plays an essential role in fully using the quantum advantage. Here in this paper, we review recent developments in using machine learning approach to design the quantum adiabatic algorithm. Its applications to 3-SAT problems, and also the Grover search problems are discussed.

Acta Physica Sinica•Jan 1, 2021•3 citations
The Quantum Adiabatic Algorithm (QAA) has been proposed as a mechanism for efficiently solving optimization problems on a quantum computer. Since adiabatic computation is analog in nature and does not require the design and use of quantum gates, it can be thought of as a simpler and perhaps more profound method for performing quantum computations that might also be easier to implement experimentally. While these features have generated substantial research in QAA, to date there is still a lack of solid evidence that the algorithm can outperform classical optimization algorithms.
We point out that, when an optimization problem has more than one solution, the quantum adiabatic algorithms (QAA) encounter topological obstructions leading to adiabatic spectral flows where spectral branches unavoidably traverse the spectral gap above the ground states of the quantum Hamiltonians. This raises serious doubts about the validity of the algorithms in such situations. However, using the Max-Cut problem as an example, we explain and demonstrate here that QAAs correctly detect all existing solutions in one single run. This newly discovered capacity of QAAs to simultaneously detect multiple solutions to an optimization problem can have an important impact on future developments of quantum variational algorithms
Quantum computing has made dramatic progress in the last decade. The quantum platforms including superconducting qubits, photonic devices, and atomic ensembles, have all reached a new era, with unprecedented quantum control capability developed. Quantum computation advantage over classical computers has been reported on certain computation tasks. A promising computing protocol of using the computation power in these controllable quantum devices is implemented through quantum adiabatic computing, where quantum algorithm design plays an essential role in fully using the quantum advantage. Here in this paper, we review recent developments in using machine learning approach to design the quantum adiabatic algorithm. Its applications to 3-SAT problems, and also the Grover search problems are discussed.