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:1810.09342 · Quantum Information Processing

Quantum annealing learning search for solving QUBO problems

Davide Pastorello, Enrico Blanzieri

Published Aug 20, 2019• 38 citations
arXivHTMLPDF
DOI
10.1007/s11128-019-2418-z

Related papers

Learning qubo Models for Quantum Annealing: A Constraint-Based Approach

Florian Richoux, Jean-François Baffier, Philippe Codognet

Lecture notes in computer science•Jan 1, 2023•9 citations

Quantum annealing learning search implementations

Andrea Bonomi, Thomas De Min, Enrico Zardini +3 more

This paper presents the details and testing of two implementations (in C++ and Python) of the hybrid quantum-classical algorithm Quantum Annealing Learning Search (QALS) on a D-Wave quantum annealer. QALS was proposed in 2019 as a novel technique to solve general QUBO problems that cannot be directly represented into the hardware architecture of a D-Wave machine. Repeated calls to the quantum machine within a classical iterative structure and a related convergence proof originate a learning mechanism to find an encoding of a given problem into the quantum architecture. The present work considers the Number Partitioning Problem (NPP) and the Travelling Salesman Problem (TSP) for the testing of QALS. The results turn out to be quite unexpected, with QALS not being able to perform as well as the other considered methods, especially in NPP, where classical methods outperform quantum annealing in general. Nevertheless, looking at the TSP tests, QALS has fulfilled its primary goal, i.e., processing QUBO problems not directly mappable to the QPU topology.

arXiv:2212.11132•Quantum Information and Computation•Feb 1, 2022•4 citations

Comparing Quantum Annealer and Metaheuristic Methods to Solve the Steiner Tree Problem

Darren M. Chitty, James Charles, Alberto Moraglio +1 more

Quantum computers are early-stage technology, but are progressing rapidly. Here, we compare metaheuristics with a quantum annealer (QA), a quantum computer tailored to solve combinatorial optimisation problems formulated as a Quadratic Unconstrained Binary Optimisation (QUBO) problem. Formulating non-trivial optimisation problems as QUBOs is a challenge, so it is to ensure that the direct comparison of classical and quantum search algorithms is conducted fairly. This paper illustrates the use of a streamlined methodology to derive a QUBO for a classical optimisation problem – the Steiner tree problem – and provides comprehensive experiments comparing D-WAVE pure QA and hybrid QA with classical methods including Simulated Annealing and Genetic Algorithms. We find that the pure QA suffers from considerable qubit noise but the hybrid QA is on a par with traditional methods.

Lecture notes in computer science•Nov 15, 2025•0 citations

Quantum annealing and its variants: Application to QUBO

Vrinda Mehta, Hans A. De Raedt, Kristel F. L. Michielsen +1 more

•Jan 1, 2025•0 citations

Quantum Annealing for Real-World Machine Learning Applications

Rajdeep Kumar Nath, Himanshu Thapliyal, Travis S. Humble

Springer eBooks•Aug 7, 2023•4 citations

Adaptive Bulk Search: Solving Quadratic Unconstrained Binary Optimization Problems on Multiple GPUs

Ryota Yasudo, Koji Nakano, Yasuaki Ito +4 more

The quadratic unconstrained binary optimization (QUBO) is recently gathering attention in conjunction with quantum annealing (QA), since it is equivalent to finding the ground state of an Ising model. Due to the limitation of current QA systems, classical computers may outperform them. Researchers have thus been proposed to solve QUBO on FPGAs, GPUs, and special purpose processors. In this paper, we propose an adaptive bulk search (ABS), a framework for solving QUBO that can perform many searches in parallel on multiple GPUs. It supports fully-connected Ising models with up to 32k spins and 16-bit weights. In our ABS, a CPU host performs genetic algorithm (GA) while GPUs asynchronously perform local searches. A bottleneck for solving QUBO exists in the evaluation of the energy function, which requires computational cost for each solution. We show this can be reduced to in our ABS. The experimental results show that, with four NVIDIA GeForce RTX 2080 Ti GPUs, our framework can search up to 1.24 × 1012 solutions per second. We also show that our system quickly solves maximum cut and traveling salesman problems.

Proceedings of the International Conference on Parallel Processing•Aug 9, 2020•13 citations
This paper presents the details and testing of two implementations (in C++ and Python) of the hybrid quantum-classical algorithm Quantum Annealing Learning Search (QALS) on a D-Wave quantum annealer. QALS was proposed in 2019 as a novel technique to solve general QUBO problems that cannot be directly represented into the hardware architecture of a D-Wave machine. Repeated calls to the quantum machine within a classical iterative structure and a related convergence proof originate a learning mechanism to find an encoding of a given problem into the quantum architecture. The present work considers the Number Partitioning Problem (NPP) and the Travelling Salesman Problem (TSP) for the testing of QALS. The results turn out to be quite unexpected, with QALS not being able to perform as well as the other considered methods, especially in NPP, where classical methods outperform quantum annealing in general. Nevertheless, looking at the TSP tests, QALS has fulfilled its primary goal, i.e., processing QUBO problems not directly mappable to the QPU topology.
Quantum computers are early-stage technology, but are progressing rapidly. Here, we compare metaheuristics with a quantum annealer (QA), a quantum computer tailored to solve combinatorial optimisation problems formulated as a Quadratic Unconstrained Binary Optimisation (QUBO) problem. Formulating non-trivial optimisation problems as QUBOs is a challenge, so it is to ensure that the direct comparison of classical and quantum search algorithms is conducted fairly. This paper illustrates the use of a streamlined methodology to derive a QUBO for a classical optimisation problem – the Steiner tree problem – and provides comprehensive experiments comparing D-WAVE pure QA and hybrid QA with classical methods including Simulated Annealing and Genetic Algorithms. We find that the pure QA suffers from considerable qubit noise but the hybrid QA is on a par with traditional methods.
The quadratic unconstrained binary optimization (QUBO) is recently gathering attention in conjunction with quantum annealing (QA), since it is equivalent to finding the ground state of an Ising model. Due to the limitation of current QA systems, classical computers may outperform them. Researchers have thus been proposed to solve QUBO on FPGAs, GPUs, and special purpose processors. In this paper, we propose an adaptive bulk search (ABS), a framework for solving QUBO that can perform many searches in parallel on multiple GPUs. It supports fully-connected Ising models with up to 32k spins and 16-bit weights. In our ABS, a CPU host performs genetic algorithm (GA) while GPUs asynchronously perform local searches. A bottleneck for solving QUBO exists in the evaluation of the energy function, which requires computational cost for each solution. We show this can be reduced to in our ABS. The experimental results show that, with four NVIDIA GeForce RTX 2080 Ti GPUs, our framework can search up to 1.24 × 1012 solutions per second. We also show that our system quickly solves maximum cut and traveling salesman problems.