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

Benchmarks and Controls for Optimization with Quantum Annealing

Erica Grant

Published Jan 1, 2020• 0 citations
OpenAlex

Related papers

Quantum-Optimized Control of the Inverted-Pendulum System

George T. Stamatiou, Kostas Magoutis

Model Predictive Control (MPC) requires solving an optimization problem at every control step, and this perstep optimization becomes the bottleneck as the horizon grows. We investigate whether Quantum Annealing (QA) is a practical solver for this problem, using the inverted pendulum as a benchmark. We translate the MPC cost function into Quadratic Unconstrained Binary Optimization (QUBO) form, deploy it on a D-Wave quantum annealer, and benchmark four solvers (Gurobi, Simulated Annealing, hybrid, and QA) on both solution quality and a wall-clock decomposition (QPU access, service, communication, and minor-embedding time). We further characterize the minor embedding of the resulting clique graph on the QPU topology. The QA-based controller tracks the reference effectively, though with higher variance than the classical baselines. The dominant cost is cloud communication and queueing, not annealing itself. We discuss what these results imply for real-time hybrid quantum-classical control.

IEEE International Conference on Quantum Software (QSW)•Jul 1, 2026•0 citations

Quantum Annealing and Related Optimization Methods

Arnab Das, Bikas K. Chakrabarti

•Jan 1, 2008•142 citations

Benchmarking Quantum Annealing Controls with Portfolio Optimization

Erica Grant, Travis S. Humble, Benjamin Stump

Quantum annealing offers an approach to finding the optimal solutions for a variety of computational problems, where the quantum annealing controls influence the observed performance and error mechanisms by tuning the underlying quantum dynamics. However, the influence of the available controls is often poorly understood, and methods for evaluating the effects of these controls are necessary to tune quantum computational performance. Here we use portfolio optimization as a case study by which to benchmark quantum annealing controls and their relative effects on computational accuracy. We compare empirical results from the D-Wave $2000{\mathrm{Q}}^{\mathrm{TM}}$ quantum annealer to the computational ground truth for a variety of portfolio optimization instances. We evaluate both forward and reverse annealing methods and we identify control variations that yield optimal performance in terms of probability of success and probability of chain breaks.

arXiv:2007.03005•Physical Review Applied•Jan 8, 2021•101 citations

Beyond Standard Quantum Annealing

Tameem Albash

Bulletin of the American Physical Society•Mar 4, 2020•0 citations

Optimal quantum control with digitized Quantum Annealing

Glen Bigan Mbeng, Rosario Fazio, Giuseppe E. Santoro

We show how a digitized version of Quantum Annealing can be made optimal, realizing the best possible solution allowed by quantum mechanics in the shortest time, without any prior knowledge on the location and properties of the spectral gap. Our findings elucidate the intimate relation between digitized-QA, optimal Quantum Control, and recently proposed hybrid quantum-classical variational algorithms for quantum-state preparation and optimization. We illustrate this on the simple benchmark problem of an unfrustrated antiferromagnetic Ising chain in a transverse field.

arXiv:1911.12259•Nov 25, 2019•26 citations

Benchmarking Quantum Annealing for a Greenhouse-Inspired Control QUBO

Hamzeh Alavirad, Maryam Bahrami Zanjani

We benchmark current annealing-based optimization workflows on a greenhouse-inspired quadratic unconstrained binary optimization problem for binary heater scheduling, where the horizon H denotes the number of hourly control decisions. For the main one-day instance (H=24), all solver outputs are decoded back into heater schedules and evaluated in the original greenhouse simulator using the same physical objective and feasibility criterion. Classical simulated annealing and path-integral simulated quantum annealing produce feasible near-optimal solutions in all repetitions, with best objectives close to the exact optimum. In contrast, the tested D-Wave Leap Hybrid BQM workflow is less reliable and does not outperform the classical baselines under 15--60~s requested time limits. Direct D-Wave QPU execution on reduced instances remains feasible in all runs and recovers the exact optimum for H=10 and H=12, but the exact-hit rate drops from 5/10 to 2/10 and then to 0/10 at H=14, with substantially higher variance than the classical baselines. The results do not indicate quantum advantage, but provide a reproducible, physically decoded benchmark that exposes the current strengths and limitations of classical, hybrid, and direct quantum annealing workflows on structured control QUBOs.

quant-pharXiv:2605.27670•May 28, 2026•0 citations
Model Predictive Control (MPC) requires solving an optimization problem at every control step, and this perstep optimization becomes the bottleneck as the horizon grows. We investigate whether Quantum Annealing (QA) is a practical solver for this problem, using the inverted pendulum as a benchmark. We translate the MPC cost function into Quadratic Unconstrained Binary Optimization (QUBO) form, deploy it on a D-Wave quantum annealer, and benchmark four solvers (Gurobi, Simulated Annealing, hybrid, and QA) on both solution quality and a wall-clock decomposition (QPU access, service, communication, and minor-embedding time). We further characterize the minor embedding of the resulting clique graph on the QPU topology. The QA-based controller tracks the reference effectively, though with higher variance than the classical baselines. The dominant cost is cloud communication and queueing, not annealing itself. We discuss what these results imply for real-time hybrid quantum-classical control.
Quantum annealing offers an approach to finding the optimal solutions for a variety of computational problems, where the quantum annealing controls influence the observed performance and error mechanisms by tuning the underlying quantum dynamics. However, the influence of the available controls is often poorly understood, and methods for evaluating the effects of these controls are necessary to tune quantum computational performance. Here we use portfolio optimization as a case study by which to benchmark quantum annealing controls and their relative effects on computational accuracy. We compare empirical results from the D-Wave 2000QTM2000{\mathrm{Q}}^{\mathrm{TM}}2000QTM quantum annealer to the computational ground truth for a variety of portfolio optimization instances. We evaluate both forward and reverse annealing methods and we identify control variations that yield optimal performance in terms of probability of success and probability of chain breaks.
We show how a digitized version of Quantum Annealing can be made optimal, realizing the best possible solution allowed by quantum mechanics in the shortest time, without any prior knowledge on the location and properties of the spectral gap. Our findings elucidate the intimate relation between digitized-QA, optimal Quantum Control, and recently proposed hybrid quantum-classical variational algorithms for quantum-state preparation and optimization. We illustrate this on the simple benchmark problem of an unfrustrated antiferromagnetic Ising chain in a transverse field.
We benchmark current annealing-based optimization workflows on a greenhouse-inspired quadratic unconstrained binary optimization problem for binary heater scheduling, where the horizon H denotes the number of hourly control decisions. For the main one-day instance (H=24), all solver outputs are decoded back into heater schedules and evaluated in the original greenhouse simulator using the same physical objective and feasibility criterion. Classical simulated annealing and path-integral simulated quantum annealing produce feasible near-optimal solutions in all repetitions, with best objectives close to the exact optimum. In contrast, the tested D-Wave Leap Hybrid BQM workflow is less reliable and does not outperform the classical baselines under 15--60~s requested time limits. Direct D-Wave QPU execution on reduced instances remains feasible in all runs and recovers the exact optimum for H=10 and H=12, but the exact-hit rate drops from 5/10 to 2/10 and then to 0/10 at H=14, with substantially higher variance than the classical baselines. The results do not indicate quantum advantage, but provide a reproducible, physically decoded benchmark that exposes the current strengths and limitations of classical, hybrid, and direct quantum annealing workflows on structured control QUBOs.