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

Acta Physica Sinica

Machine learning assisted quantum adiabatic algorithm design

Jian Hui Lin, Meng Ye, Jiawei Zhu, Xiaopeng Li

Published Jan 1, 2021• 3 citations
Publisher

Abstract

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.

DOI
10.7498/aps.70.20210831

Related papers

Quantum adiabatic algorithm design using reinforcement learning

Jian Hui Lin, Zhong Yuan Lai, Xiaopeng Li

Quantum algorithm design plays a crucial role in exploiting the computational advantage of quantum devices. Here we develop a deep-reinforcement-learning based approach for quantum adiabatic algorithm design. Our approach is generically applicable to a class of problems with solution hard-to-find but easy-to-verify, e.g., searching and NP-complete problems. We benchmark this approach in Grover-search and 3-SAT problems, and find that the adiabatic algorithm obtained by our RL approach leads to significant improvement in the resultant success probability. In application to Grover search, our RL design automatically produces an adiabatic quantum algorithm that has the quadratic speedup. We find for all our studied cases that quantitatively the RL-designed algorithm has a better performance compared to the analytically constructed nonlinear Hamiltonian path when the encoding Hamiltonian is solvable, and that this RL-design approach remains applicable even when the nonlinear Hamiltonian path is not analytically available. In 3-SAT we find RL design has fascinating transferability---the adiabatic algorithm obtained by training on a specific choice of clause number leads to better performance consistently over the linear algorithm on different clause numbers. These findings suggest the applicability of reinforcement learning for automated quantum adiabatic algorithm design. Further considering the established complexity equivalence of circuit and adiabatic quantum algorithms, we expect the RL-designed adiabatic algorithm to inspire novel circuit algorithms as well. Our approach is potentially applicable to different quantum hardware from trapped ions and optical lattices to superconducting-qubit devices.

arXiv:1812.10797•Physical Review A•May 18, 2020•41 citations

Quantum-Assisted Machine Learning by Means of Adiabatic Quantum Computing

Leonardo Tomazeli Duarte, Yannick Deville

Motivated by the potential performance gains offered by quantum computing (QC), a recent research focus — known as quantum-assisted machine learning (QAML) — aims to develop machine learning algorithms tailored for execution on quantum computers while processing data that originate from a classical (i.e. non-quantum) phenomenon. QAML has been studied in various quantum computing (QC) paradigms. This paper, in particular, offers a brief overview of QAML within the context of adiabatic quantum computing (AQC). The major challenge in this case is to reformulate the machine learning task as a quadratic unconstrained binary optimization (QUBO) problem, which lies at the core of existing AQC physical implementations. We provide examples of machine learning techniques tailored to AQC, along with applications in remote sensing.

IEEE Mediterranean and Middle-East Geoscience and Remote Sensing Symposium (M2GARSS)•Apr 15, 2024•5 citations

Quantum Machine Learning: A comprehensive review on optimization of machine learning algorithms

R. Divya, James Dinesh Peter

Quantum technologies can provide innovative solutions to many complex problems, and thus quantum machine learning has taken a unique place in the world of computing. Quantum technology reaches an advanced level when the potential of quantum computing features is used for machine learning. Applying quantum computing features in traditional algorithms provides an exceptional parallel computing capability for solving complex problems. The essence of this paper is a comparative study of the basic concepts of quantum computing and their superior capabilities over classical computing. This article describes the application based algorithms such as QSVM, QPCA, and Q-KNN along with Grover's algorithm, which is the most popular and fundamental quantum machine learning algorithm. This study aims to understand various learning models that incorporate the advantages of computing into quantum circuits for enhancing classical machine learning functionalities.

International Conference on Microelectronics, Signals & Systems (ICMSS)•Nov 18, 2021•17 citations

Machine Learning Algorithms in Quantum Computing: A Survey

Somayeh Bakhtiari Ramezani, Alexander Sommers, Harish Kumar Manchukonda +2 more

Machine Learning (ML) aims at designing models that learn from previous experience, without being explicitly formulated. Applications of machine learning are inexhaustible, including recognizing patterns, predicting future trends and making decisions, and they are capable of handling sizable quantities of multi-dimensional data in the form of large vectors and tensors. To perform these operations on classical computers, however, requires vast time and computational resources. Unlike the classical computers that rely on computations using binary bits, Quantum Computers (QC) benefit from qubits which can hold combinations of 0 and 1 at the same time via superposition and entanglement. This makes QCs powerful at handling and post processing large tensors, making them a prime target for implementing ML algorithms. While several models used for ML on QCs are based on concepts from their classical computing counterparts, utilization of the QC's potential has made them the superior of the two. This paper presents an overview of the current state of knowledge in application of ML on QC, and evaluates the speed up, and complexity advantages of using quantum machines.

International Joint Conference on Neural Networks (IJCNN)•Jul 1, 2020•138 citations

Quantum Machine Learning: Scope for real-world problems

Abhishek Jadhav, Akhtar Rasool, Manasi Gyanchandani

Quantum computing with its inherent parallelism provides a quantum advantage over classical computing. Its potential to offer breakthrough advances in various areas of science and engineering is foreseen. Machine learning is one of the key areas where the power of quantum computing can be utilized. Though many machine learning algorithms have been successfully developed to solve a variety of problems in the past decades, these algorithms take a long time to train. Also working on today's colossal datasets makes these algorithms computationally intensive. Quantum machine learning by utilizing the concepts of superposition and entanglement promises a solution to this problem. Quantum machine learning algorithms are in surface for the past few years and majority of the current research has dealt with the two machine learning problems namely classification and clustering. In this paper, a brief review of the recent techniques and algorithms of quantum machine learning and its scope in solving real world problems is studied.

Procedia Computer Science•Jan 1, 2023•77 citations

Advancements in Quantum Algorithms for Optimization Problems

Dr. Amina Shah

Quantum computing has emerged as a transformative technology, particularly for solving optimization problems, which are notoriously difficult for classical computers. Quantum algorithms, leveraging quantum parallelism and entanglement, promise significant speedups for a wide range of optimization tasks, from combinatorial optimization to machine learning. This paper reviews recent advancements in quantum algorithms for optimization problems, highlighting key algorithms such as Grover’s search algorithm, the Quantum Approximate Optimization Algorithm (QAOA), and the Quantum Alternating Operator Ansatz (QAOA). We also explore the challenges and potential of quantum computing in addressing real-world optimization problems, such as in logistics, finance, and machine learning. The paper discusses the current state of quantum hardware, as well as theoretical and practical limitations in implementing these quantum algorithms. Finally, we propose future research directions to overcome existing challenges and enhance the application of quantum algorithms in solving complex optimization problems

Computer Science Bulletin•Dec 31, 2025•0 citations
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.
Quantum algorithm design plays a crucial role in exploiting the computational advantage of quantum devices. Here we develop a deep-reinforcement-learning based approach for quantum adiabatic algorithm design. Our approach is generically applicable to a class of problems with solution hard-to-find but easy-to-verify, e.g., searching and NP-complete problems. We benchmark this approach in Grover-search and 3-SAT problems, and find that the adiabatic algorithm obtained by our RL approach leads to significant improvement in the resultant success probability. In application to Grover search, our RL design automatically produces an adiabatic quantum algorithm that has the quadratic speedup. We find for all our studied cases that quantitatively the RL-designed algorithm has a better performance compared to the analytically constructed nonlinear Hamiltonian path when the encoding Hamiltonian is solvable, and that this RL-design approach remains applicable even when the nonlinear Hamiltonian path is not analytically available. In 3-SAT we find RL design has fascinating transferability---the adiabatic algorithm obtained by training on a specific choice of clause number leads to better performance consistently over the linear algorithm on different clause numbers. These findings suggest the applicability of reinforcement learning for automated quantum adiabatic algorithm design. Further considering the established complexity equivalence of circuit and adiabatic quantum algorithms, we expect the RL-designed adiabatic algorithm to inspire novel circuit algorithms as well. Our approach is potentially applicable to different quantum hardware from trapped ions and optical lattices to superconducting-qubit devices.
Motivated by the potential performance gains offered by quantum computing (QC), a recent research focus — known as quantum-assisted machine learning (QAML) — aims to develop machine learning algorithms tailored for execution on quantum computers while processing data that originate from a classical (i.e. non-quantum) phenomenon. QAML has been studied in various quantum computing (QC) paradigms. This paper, in particular, offers a brief overview of QAML within the context of adiabatic quantum computing (AQC). The major challenge in this case is to reformulate the machine learning task as a quadratic unconstrained binary optimization (QUBO) problem, which lies at the core of existing AQC physical implementations. We provide examples of machine learning techniques tailored to AQC, along with applications in remote sensing.
Quantum technologies can provide innovative solutions to many complex problems, and thus quantum machine learning has taken a unique place in the world of computing. Quantum technology reaches an advanced level when the potential of quantum computing features is used for machine learning. Applying quantum computing features in traditional algorithms provides an exceptional parallel computing capability for solving complex problems. The essence of this paper is a comparative study of the basic concepts of quantum computing and their superior capabilities over classical computing. This article describes the application based algorithms such as QSVM, QPCA, and Q-KNN along with Grover's algorithm, which is the most popular and fundamental quantum machine learning algorithm. This study aims to understand various learning models that incorporate the advantages of computing into quantum circuits for enhancing classical machine learning functionalities.
Machine Learning (ML) aims at designing models that learn from previous experience, without being explicitly formulated. Applications of machine learning are inexhaustible, including recognizing patterns, predicting future trends and making decisions, and they are capable of handling sizable quantities of multi-dimensional data in the form of large vectors and tensors. To perform these operations on classical computers, however, requires vast time and computational resources. Unlike the classical computers that rely on computations using binary bits, Quantum Computers (QC) benefit from qubits which can hold combinations of 0 and 1 at the same time via superposition and entanglement. This makes QCs powerful at handling and post processing large tensors, making them a prime target for implementing ML algorithms. While several models used for ML on QCs are based on concepts from their classical computing counterparts, utilization of the QC's potential has made them the superior of the two. This paper presents an overview of the current state of knowledge in application of ML on QC, and evaluates the speed up, and complexity advantages of using quantum machines.
Quantum computing with its inherent parallelism provides a quantum advantage over classical computing. Its potential to offer breakthrough advances in various areas of science and engineering is foreseen. Machine learning is one of the key areas where the power of quantum computing can be utilized. Though many machine learning algorithms have been successfully developed to solve a variety of problems in the past decades, these algorithms take a long time to train. Also working on today's colossal datasets makes these algorithms computationally intensive. Quantum machine learning by utilizing the concepts of superposition and entanglement promises a solution to this problem. Quantum machine learning algorithms are in surface for the past few years and majority of the current research has dealt with the two machine learning problems namely classification and clustering. In this paper, a brief review of the recent techniques and algorithms of quantum machine learning and its scope in solving real world problems is studied.
Quantum computing has emerged as a transformative technology, particularly for solving optimization problems, which are notoriously difficult for classical computers. Quantum algorithms, leveraging quantum parallelism and entanglement, promise significant speedups for a wide range of optimization tasks, from combinatorial optimization to machine learning. This paper reviews recent advancements in quantum algorithms for optimization problems, highlighting key algorithms such as Grover’s search algorithm, the Quantum Approximate Optimization Algorithm (QAOA), and the Quantum Alternating Operator Ansatz (QAOA). We also explore the challenges and potential of quantum computing in addressing real-world optimization problems, such as in logistics, finance, and machine learning. The paper discusses the current state of quantum hardware, as well as theoretical and practical limitations in implementing these quantum algorithms. Finally, we propose future research directions to overcome existing challenges and enhance the application of quantum algorithms in solving complex optimization problems