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

Towards a measureable pathway for learning quantum annealing

Elizabeth Behrman, James E. Steck

Published Mar 13, 2017• 0 citations
OpenAlex

Related papers

Learning quantum annealing

Elizabeth Behrman, James E. Steck

arXiv:1605.05445•Mar 14, 2016•4 citations

Learning quantum annealing

Elizabeth Behrman, James E. Steck, M.A. Moustafa

We propose and develop a new procedure, whereby a quantum system can learn to anneal to a desired ground state. We demonstrate successful learning to produce an entangled state for a two-qubit system, then demonstrate generalizability to larger systems. The amount of additional learning necessary decreases as the size of the system increases. Because current technologies limit measurement of the states of quantum annealing machines to determination of the average spin at each site, we then construct a “broken pathway” between the initial and desired states, at each step of which the average spins are nonzero, and show successful learning of that pathway. Using this technique we show we can direct annealing to multiqubit GHZ and W states, and verify that we have done so. Because quantum neural networks are robust to noise and decoherence we expect our method to be readily implemented experimentally; we show some preliminary results which support this.

arXiv:1603.01752•Quantum Information and Computation•Apr 1, 2017•9 citations

Quantum annealing – foundations and frontiers

Eliahu Cohen, Boaz Tamir

arXiv:1408.5784•The European Physical Journal Special Topics•Feb 1, 2015•19 citations

Quantum Annealing for Machine Learning: Applications in Feature Selection, Instance Selection, and Clustering

Pomeroy, Chloe, Aleksandar Pramov, Karishma Thakrar +1 more

This paper explores the applications of quantum annealing (QA) and classical simulated annealing (SA) to a suite of combinatorial optimization problems in machine learning, namely feature selection, instance selection, and clustering. We formulate each task as a Quadratic Unconstrained Binary Optimization (QUBO) problem and implement both quantum and classical solvers to compare their effectiveness. For feature selection, we propose several QUBO configurations that balance feature importance and redundancy, showing that quantum annealing (QA) produces solutions that are computationally more efficient. In instance selection, we propose a few novel heuristics for instance-level importance measures that extend existing methods. For clustering, we embed a classical-to-quantum pipeline, using classical clustering followed by QUBO-based medoid refinement, and demonstrate consistent improvements in cluster compactness and retrieval metrics. Our results suggest that QA can be a competitive and efficient tool for discrete machine learning optimization, even within the constraints of current quantum hardware.

arXiv:2507.15063•Jul 20, 2025•3 citations

Application of quantum annealing to computation of molecular properties

P. Sahoo, V. S. Prasannaa, B. P. Das

We present the results of our quantum annealing computations of the permanent electric dipole moments of several molecules. By applying an electric field as a perturbation and measuring the corresponding energy responses, the molecular electric dipole moments are obtained numerically through the finite field method. The ground-state electronic wavefunctions and energies are obtained using the quantum annealer eignsolver algorithm. This work provides a pathway for the computation of molecular properties in the quantum annealing paradigm.

arXiv:2508.12779•Physical Review A•May 4, 2026•2 citations

Perspectives of quantum annealing: Methods and implementations

秀稔 西森, Hidetoshi Nishimori

•May 1, 2020•0 citations
We propose and develop a new procedure, whereby a quantum system can learn to anneal to a desired ground state. We demonstrate successful learning to produce an entangled state for a two-qubit system, then demonstrate generalizability to larger systems. The amount of additional learning necessary decreases as the size of the system increases. Because current technologies limit measurement of the states of quantum annealing machines to determination of the average spin at each site, we then construct a “broken pathway” between the initial and desired states, at each step of which the average spins are nonzero, and show successful learning of that pathway. Using this technique we show we can direct annealing to multiqubit GHZ and W states, and verify that we have done so. Because quantum neural networks are robust to noise and decoherence we expect our method to be readily implemented experimentally; we show some preliminary results which support this.
This paper explores the applications of quantum annealing (QA) and classical simulated annealing (SA) to a suite of combinatorial optimization problems in machine learning, namely feature selection, instance selection, and clustering. We formulate each task as a Quadratic Unconstrained Binary Optimization (QUBO) problem and implement both quantum and classical solvers to compare their effectiveness. For feature selection, we propose several QUBO configurations that balance feature importance and redundancy, showing that quantum annealing (QA) produces solutions that are computationally more efficient. In instance selection, we propose a few novel heuristics for instance-level importance measures that extend existing methods. For clustering, we embed a classical-to-quantum pipeline, using classical clustering followed by QUBO-based medoid refinement, and demonstrate consistent improvements in cluster compactness and retrieval metrics. Our results suggest that QA can be a competitive and efficient tool for discrete machine learning optimization, even within the constraints of current quantum hardware.
We present the results of our quantum annealing computations of the permanent electric dipole moments of several molecules. By applying an electric field as a perturbation and measuring the corresponding energy responses, the molecular electric dipole moments are obtained numerically through the finite field method. The ground-state electronic wavefunctions and energies are obtained using the quantum annealer eignsolver algorithm. This work provides a pathway for the computation of molecular properties in the quantum annealing paradigm.