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

Bulletin of the American Physical Society

Challenges and opportunities for hybrid quantum-classical machine learning and optimization

Masoud Mohseni

Published Mar 2, 2020• 0 citations
OpenAlex

Related papers

Hybrid Quantum and Classical Machine Learning

Zeph Hardie

Queensland University of Technology eBooks•Jan 1, 2026•0 citations

Unsupervised Machine Learning on a Hybrid Quantum Computer

Johannes Otterbach, Riccardo Manenti, Nima Alidoust +27 more

Machine learning techniques have led to broad adoption of a statistical model of computing. The statistical distributions natively available on quantum processors are a superset of those available classically. Harnessing this attribute has the potential to accelerate or otherwise improve machine learning relative to purely classical performance. A key challenge toward that goal is learning to hybridize classical computing resources and traditional learning techniques with the emerging capabilities of general purpose quantum processors. Here, we demonstrate such hybridization by training a 19-qubit gate model processor to solve a clustering problem, a foundational challenge in unsupervised learning. We use the quantum approximate optimization algorithm in conjunction with a gradient-free Bayesian optimization to train the quantum machine. This quantum/classical hybrid algorithm shows robustness to realistic noise, and we find evidence that classical optimization can be used to train around both coherent and incoherent imperfections.

arXiv:1712.05771•Dec 15, 2017•219 citations

Quantum variational optimization

Andrea Delgado, Kathleen E. Hamilton

This chapter introduces variational quantum algorithms, a class of hybrid methods that leverage parametrized quantum circuits and classical optimization to solve problems in chemistry, optimization, and machine learning. Focusing on the variational quantum eigensolver and the quantum approximate optimization algorithm, we explore their algorithmic structure, theoretical motivation, and practical implementation on near-term devices. We discuss key challenges such as barren plateaus, ansatz design, and measurement overhead, as well as opportunities for adaptive circuits, noise-aware optimization, and emerging applications in quantum machine learning. The chapter lays the foundation for understanding variational classifiers and generative models in subsequent chapters.

Institute of Physics eBooks•Dec 1, 2025•0 citations

Challenges and opportunities in quantum machine learning

Marco Cerezo, Guillaume Verdon, Hsin-Yuan Huang +2 more

arXiv:2303.09491•Nature Computational Science•Sep 15, 2022•705 citations

Investigating Hybrid Algorithms for Quantum Computing in Machine Learning: Improving Data Processing Speed and Handling Complex Problems

K Nandini, Davinder Pal Singh, Velayutham Rethnagurusamy Kavitha +3 more

Quantum computers acting as ML accelerators have attracted considerable interest as a promising avenue for addressing the limitations of classical computing confronted with solving complex, high-dimensional problems and handling large data sets. The most exciting aspect of quantum computing lies in its quantum advantage via techniques such as quantum parallelism, superposition, and entanglement which allows not only for rapid data processing, but also a means to resolve complex optimization problems beyond the capacity of classical algorithms. Nevertheless, the usage of quantum computing in machine learning is still a fledgling domain, with challenges concerning quantum noise, hardware restrictions, and algorithmic development. In particular, this research is concerned with the development of and study on hybrid quantum-classical algorithms that target to improve ML models in terms of computational capabilities by making use of the best of both worlds. To address this, researchers are developing hybrid algorithms that leverage the strengths of quantum computing for specific tasks, like optimization and pattern recognition, while still relying on classical computing for more flexible and larger-scale processing, ultimately achieving more efficient machine learning systems that can handle large datasets and complex problem-solving more effectively. It includes potential hybrid approaches like quantum-enhanced optimization algorithms, quantum neural networks, and quantum support vector machines, and examines how such algorithms can be used for practical ML problems including data classification, regression and clustering. Furthermore, the paper proposes that hybrid quantum algorithms offer several advantages over their classical counterparts, such as faster convergence rates, higher accuracy in high-dimensional spaces, and improved handling of non-linear and complex problem landscapes. Key advancements in the area of data processing speed and efficiency in problem-solving with and without quantum in the machine learning workflow are also highlighted in the research through comparative analysis and simulation studies. Lastly, the paper concludes by outlining the obstacles yet to be surmounted and the opportunities that lie ahead for hybrid quantum-classical algorithms, such as further improvement of quantum hardware and error mitigation methods, as well as the design of new algorithmic paradigms that seamlessly integrates the classical and quantum computing spaces.

International Conference on Networks and Cryptology (NETCRYPT)•May 29, 2025•1 citation

Opportunities and Challenges in Quantum-Assisted Machine Learning

Alejandro Perdomo‐Ortiz

Bulletin of the American Physical Society•Mar 5, 2019•1 citation
Machine learning techniques have led to broad adoption of a statistical model of computing. The statistical distributions natively available on quantum processors are a superset of those available classically. Harnessing this attribute has the potential to accelerate or otherwise improve machine learning relative to purely classical performance. A key challenge toward that goal is learning to hybridize classical computing resources and traditional learning techniques with the emerging capabilities of general purpose quantum processors. Here, we demonstrate such hybridization by training a 19-qubit gate model processor to solve a clustering problem, a foundational challenge in unsupervised learning. We use the quantum approximate optimization algorithm in conjunction with a gradient-free Bayesian optimization to train the quantum machine. This quantum/classical hybrid algorithm shows robustness to realistic noise, and we find evidence that classical optimization can be used to train around both coherent and incoherent imperfections.
This chapter introduces variational quantum algorithms, a class of hybrid methods that leverage parametrized quantum circuits and classical optimization to solve problems in chemistry, optimization, and machine learning. Focusing on the variational quantum eigensolver and the quantum approximate optimization algorithm, we explore their algorithmic structure, theoretical motivation, and practical implementation on near-term devices. We discuss key challenges such as barren plateaus, ansatz design, and measurement overhead, as well as opportunities for adaptive circuits, noise-aware optimization, and emerging applications in quantum machine learning. The chapter lays the foundation for understanding variational classifiers and generative models in subsequent chapters.
Quantum computers acting as ML accelerators have attracted considerable interest as a promising avenue for addressing the limitations of classical computing confronted with solving complex, high-dimensional problems and handling large data sets. The most exciting aspect of quantum computing lies in its quantum advantage via techniques such as quantum parallelism, superposition, and entanglement which allows not only for rapid data processing, but also a means to resolve complex optimization problems beyond the capacity of classical algorithms. Nevertheless, the usage of quantum computing in machine learning is still a fledgling domain, with challenges concerning quantum noise, hardware restrictions, and algorithmic development. In particular, this research is concerned with the development of and study on hybrid quantum-classical algorithms that target to improve ML models in terms of computational capabilities by making use of the best of both worlds. To address this, researchers are developing hybrid algorithms that leverage the strengths of quantum computing for specific tasks, like optimization and pattern recognition, while still relying on classical computing for more flexible and larger-scale processing, ultimately achieving more efficient machine learning systems that can handle large datasets and complex problem-solving more effectively. It includes potential hybrid approaches like quantum-enhanced optimization algorithms, quantum neural networks, and quantum support vector machines, and examines how such algorithms can be used for practical ML problems including data classification, regression and clustering. Furthermore, the paper proposes that hybrid quantum algorithms offer several advantages over their classical counterparts, such as faster convergence rates, higher accuracy in high-dimensional spaces, and improved handling of non-linear and complex problem landscapes. Key advancements in the area of data processing speed and efficiency in problem-solving with and without quantum in the machine learning workflow are also highlighted in the research through comparative analysis and simulation studies. Lastly, the paper concludes by outlining the obstacles yet to be surmounted and the opportunities that lie ahead for hybrid quantum-classical algorithms, such as further improvement of quantum hardware and error mitigation methods, as well as the design of new algorithmic paradigms that seamlessly integrates the classical and quantum computing spaces.