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:1505.01545 · Physical Review X

Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly

Helmut G. Katzgraber, Firas Hamze, Zheng Zhu, Andrew J. Ochoa, H. Munoz-Bauza

Published Sep 1, 2015• 117 citations
arXivHTMLPDF

Abstract

While manufacturing limitations are imposing constraints on Moore's law, researchers are searching for novel computing architectures based on quantum-mechanical effects. However, it remains to be shown that quantum annealing techniques consistently outperform classical simulated annealing to minimize optimization problems.
DOI
10.1103/physrevx.5.031026

Related papers

Quantum Optimization of Fully Connected Spin Glasses

Davide Venturelli, Salvatore Mandrà, Sergey Knysh +3 more

Quantum computing promises to be more efficient and significantly faster than today's classical computing. Researchers compare the performance of a quantum annealer with that of classical algorithms for the first time on hard spin-glass problems.

arXiv:1406.7553•Physical Review X•Sep 18, 2015•227 citations

First application of quantum annealing to IMRT beamlet intensity optimization

Daryl P. Nazareth, J Spaans

Optimization methods are critical to radiation therapy. A new technology, quantum annealing (QA), employs novel hardware and software techniques to address various discrete optimization problems in many fields. We report on the first application of quantum annealing to the process of beamlet intensity optimization for IMRT. We apply recently-developed hardware which natively exploits quantum mechanical effects for improved optimization. The new algorithm, called QA, is most similar to simulated annealing, but relies on natural processes to directly minimize a system's free energy. A simple quantum system is slowly evolved into a classical system representing the objective function. If the evolution is sufficiently slow, there are probabilistic guarantees that a global minimum will be located. To apply QA to IMRT-type optimization, two prostate cases were considered. A reduced number of beamlets were employed, due to the current QA hardware limitations. The beamlet dose matrices were computed using CERR and an objective function was defined based on typical clinical constraints, including dose-volume objectives, which result in a complex non-convex search space. The objective function was discretized and the QA method was compared to two standard optimization methods, simulated annealing and Tabu search, run on a conventional computing cluster. Based on several runs, the average final objective function value achieved by the QA was 16.9 for the first patient, compared with 10.0 for Tabu and 6.7 for the simulated annealing (SA) method. For the second patient, the values were 70.7 for the QA, 120.0 for Tabu and 22.9 for the SA. The QA algorithm required 27-38% of the time required by the other two methods. In this first application of hardware-enabled QA to IMRT optimization, its performance is comparable to Tabu search, but less effective than the SA in terms of final objective function values. However, its speed was 3-4 times faster than the other two methods. This initial experiment suggests that more research into QA-based heuristics may offer significant speedup over conventional clinical optimization methods, as quantum annealing hardware scales to larger sizes.

Physics in Medicine and Biology•May 1, 2015•32 citations

Quantum Accelerated Simulated Annealing

Jincheng Zhang

Simulated annealing (SA) is a widely used metaheuristic algorithm for solving optimization problems. However, its performance is often limited by the slow exploration of the search space. This paper explores the potential of accelerating simulated annealing using quantum computing. We propose a framework where the search space of SA is mapped to the quantum state space, leveraging quantum superposition and interference to expedite the search for the global optimum. The core claim is that quantum computation can significantly speed up the search process within simulated annealing. The mechanism relies on utilizing quantum algorithms to explore the solution space far more efficiently than classical methods. This work introduces a novel approach to optimization, demonstrating the potential of harnessing quantum mechanical phenomena to enhance the performance of classical optimization algorithms. The theoretical framework and conceptual design are presented, outlining a possible architecture for a quantum-accelerated simulated annealing system. The potential speedup is analyzed, and future research directions are discussed.

•Sep 7, 2026•0 citations

Demonstration of a Scaling Advantage for a Quantum Annealer over Simulated Annealing

Tameem Albash, Daniel A. Lidar

Benchmarks of a quantum information processor establish, for the first time, an advantage for a quantum annealer over classical simulated annealing, an important milestone in the development of quantum optimizers and in the journey towards demonstrating a quantum speedup over classical computers.

arXiv:1705.07452•Physical Review X•Jul 19, 2018•266 citations

Test Case Minimization with Quantum Annealers

Xinyi Wang, Asmar Muqeet, Tao Yue +2 more

Quantum annealers are specialized quantum computers for solving combinatorial optimization problems with special quantum computing characteristics, e.g., superposition and entanglement. Theoretically, quantum annealers can outperform classic computers. However, current quantum annealers are constrained by a limited number of qubits and cannot demonstrate quantum advantages. Nonetheless, research is needed to develop novel mechanisms to formulate combinatorial optimization problems for quantum annealing (QA). However, QA applications in software engineering remain unexplored. Thus, we propose BootQA , the very first effort at solving test case minimization (TCM) problems on classical software with QA. We provide a novel TCM formulation for QA and utilize bootstrap sampling to optimize the qubit usage. We also implemented our TCM formulation in three other optimization processes: simulated annealing (SA), QA without problem decomposition, and QA with an existing D-Wave problem decomposition strategy, and conducted an empirical evaluation with three real-world TCM datasets. Results show that BootQA outperforms QA without problem decomposition and QA with the existing decomposition strategy regarding effectiveness. Moreover, BootQA ’s effectiveness is similar to SA. Finally, BootQA has higher efficiency in terms of time when solving large TCM problems than the other three optimization processes.

arXiv:2308.05505•ACM Transactions on Software Engineering and Methodology•Jul 27, 2024•16 citations

Quantum AI, Quantum Annealing, and Quantum-Inspired Applications: From Emerging Paradigms to Practical Deployment [Guest Editorial]

Chia‐Ho Ou, Shao‐Ku Kao

IEEE Nanotechnology Magazine•Oct 1, 2026•0 citations
Optimization methods are critical to radiation therapy. A new technology, quantum annealing (QA), employs novel hardware and software techniques to address various discrete optimization problems in many fields. We report on the first application of quantum annealing to the process of beamlet intensity optimization for IMRT. We apply recently-developed hardware which natively exploits quantum mechanical effects for improved optimization. The new algorithm, called QA, is most similar to simulated annealing, but relies on natural processes to directly minimize a system's free energy. A simple quantum system is slowly evolved into a classical system representing the objective function. If the evolution is sufficiently slow, there are probabilistic guarantees that a global minimum will be located. To apply QA to IMRT-type optimization, two prostate cases were considered. A reduced number of beamlets were employed, due to the current QA hardware limitations. The beamlet dose matrices were computed using CERR and an objective function was defined based on typical clinical constraints, including dose-volume objectives, which result in a complex non-convex search space. The objective function was discretized and the QA method was compared to two standard optimization methods, simulated annealing and Tabu search, run on a conventional computing cluster. Based on several runs, the average final objective function value achieved by the QA was 16.9 for the first patient, compared with 10.0 for Tabu and 6.7 for the simulated annealing (SA) method. For the second patient, the values were 70.7 for the QA, 120.0 for Tabu and 22.9 for the SA. The QA algorithm required 27-38% of the time required by the other two methods. In this first application of hardware-enabled QA to IMRT optimization, its performance is comparable to Tabu search, but less effective than the SA in terms of final objective function values. However, its speed was 3-4 times faster than the other two methods. This initial experiment suggests that more research into QA-based heuristics may offer significant speedup over conventional clinical optimization methods, as quantum annealing hardware scales to larger sizes.
Simulated annealing (SA) is a widely used metaheuristic algorithm for solving optimization problems. However, its performance is often limited by the slow exploration of the search space. This paper explores the potential of accelerating simulated annealing using quantum computing. We propose a framework where the search space of SA is mapped to the quantum state space, leveraging quantum superposition and interference to expedite the search for the global optimum. The core claim is that quantum computation can significantly speed up the search process within simulated annealing. The mechanism relies on utilizing quantum algorithms to explore the solution space far more efficiently than classical methods. This work introduces a novel approach to optimization, demonstrating the potential of harnessing quantum mechanical phenomena to enhance the performance of classical optimization algorithms. The theoretical framework and conceptual design are presented, outlining a possible architecture for a quantum-accelerated simulated annealing system. The potential speedup is analyzed, and future research directions are discussed.
Quantum annealers are specialized quantum computers for solving combinatorial optimization problems with special quantum computing characteristics, e.g., superposition and entanglement. Theoretically, quantum annealers can outperform classic computers. However, current quantum annealers are constrained by a limited number of qubits and cannot demonstrate quantum advantages. Nonetheless, research is needed to develop novel mechanisms to formulate combinatorial optimization problems for quantum annealing (QA). However, QA applications in software engineering remain unexplored. Thus, we propose BootQA , the very first effort at solving test case minimization (TCM) problems on classical software with QA. We provide a novel TCM formulation for QA and utilize bootstrap sampling to optimize the qubit usage. We also implemented our TCM formulation in three other optimization processes: simulated annealing (SA), QA without problem decomposition, and QA with an existing D-Wave problem decomposition strategy, and conducted an empirical evaluation with three real-world TCM datasets. Results show that BootQA outperforms QA without problem decomposition and QA with the existing decomposition strategy regarding effectiveness. Moreover, BootQA ’s effectiveness is similar to SA. Finally, BootQA has higher efficiency in terms of time when solving large TCM problems than the other three optimization processes.