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

IEEE High Performance Extreme Computing Conference

QxSQA: GPGPU-Accelerated Simulated Quantum Annealer within a Non-Linear Optimization and Boltzmann Sampling Framework

Dan Padilha, Serge Weinstock, Mark J. Hodson

Published Sep 1, 2019• 2 citations
Publisher

Abstract

We introduce QxSQA, a GPGPU-Accelerated Simulated Quantum Annealer based on Path-Integral Monte Carlo (PIMC). QxSQA is tuned for finding low-energy solutions to integer, non-linear optimization problems of up to 214(16,384) binary variables with quadratic interactions on a single GPU instance. Experimental results demonstrate QxSQA can solve Maximum Clique test problems of 8,100 binary variables with planted solutions in under one minute, with linear scaling against key optimization parameters on other large-scale problems. Through the PIMC formulation, QxSQA also functions as an accurate sampler of Boltzmann distributions for machine learning applications. Experimental characterization of Boltzmann sampling results for a reinforcement learning problem showed good convergence performance at useful scales. Our implementation integrates as a solver within our QxBranch developer platform, positioning developers to efficiently develop applications using QxSQA, and then test the same application code on a quantum annealer or universal quantum computer hardware platform such as those from D-Wave Systems, IBM, or Rigetti Computing.

DOI
10.1109/hpec.2019.8916450

Related papers

Experimental Study of Quantum-Annealing-Aided Boltzmann Distribution Approximation

Kouki Yonaga

This paper reports a comprehensive experimental characterization of quantum-annealing-aided Boltzmann distribution approximation (QA-aided BDA), a method proposed in prior work for approximating Boltzmann distributions using a D-Wave quantum annealer as a sampler. Boltzmann distributions play a central role in a wide range of fields, including statistical physics, machine learning, and wireless communication. However, when a Boltzmann distribution is defined over an Ising model consisting of binary variables, exact computation becomes exponentially more difficult as the system size increases. Unlike conventional frequency-based methods, QA-aided BDA reconstructs Boltzmann weights from a set of low-energy configurations obtained from QA sampling. Although QA-aided BDA has shown promising performance in practical applications, its fundamental characteristics, including approximation accuracy, computational cost, and sensitivity to key parameters, have not been systematically investigated. This study evaluated its approximation accuracy using the Kullback–Leibler divergence for fully connected Ising models under various annealing parameters, problem sizes, inverse temperatures, unembedding strategies, and post-processing conditions. The results show that the approximation accuracy depends mainly on the number of samples and on the chain strength used for embedding, and much less on the annealing time in the investigated range. Additionally, at an appropriate chain strength, the choice of unembedding method does not change the accuracy but can change the local processing time by more than an order of magnitude. Finally, at the same number of retained samples, QA-aided BDA becomes substantially more accurate than existing QA-based sampling methods as the number of samples increases, although the computational costs were not matched.

IEEE Access•Jan 1, 2026•0 citations

Accelerating Quantum Chemistry Simulations Using GPU-Optimized Deep Reinforcement Learning Algorithms

Marek Zielinski

A distributed deep reinforcement learning framework based on GPU cluster was constructed to solve the computational problems of large-scale quantum chemistry simulation. The framework includes technologies such as parallel strategy optimization, asynchronous gradient update, and dynamic scheduling tasks. Efficient communication algorithms are adopted to maximize the utilization of hardware resources and achieve scaling. Experimental evaluation of representative quantum chemistry problems was performed on a multi-node GPU platform. The results show that the average GPU utilization rate exceeds 92% due to the near-linear scale expansion to 128 GPUs. This improves the simulation throughput and efficiency. The system has good performance and convergence behavior for a variety of workloads. The results show that these GPUs, matched with advanced improved distributed DRL models, can break thru the traditional bottleneck of using supercomputers to solve complex physical and chemical problems, so as to complete all these dazzling and complex molecules faster and better.

Data Engineering and Applications•Jan 5, 2025•0 citations

Benchmarking Quantum Hardware for Training of Fully Visible Boltzmann Machines

Dmytro Korenkevych, Yanbo Xue, Zhengbing Bian +4 more

Quantum annealing (QA) is a hardware-based heuristic optimization and sampling method applicable to discrete undirected graphical models. While similar to simulated annealing, QA relies on quantum, rather than thermal, effects to explore complex search spaces. For many classes of problems, QA is known to offer computational advantages over simulated annealing. Here we report on the ability of recent QA hardware to accelerate training of fully visible Boltzmann machines. We characterize the sampling distribution of QA hardware, and show that in many cases, the quantum distributions differ significantly from classical Boltzmann distributions. In spite of this difference, training (which seeks to match data and model statistics) using standard classical gradient updates is still effective. We investigate the use of QA for seeding Markov chains as an alternative to contrastive divergence (CD) and persistent contrastive divergence (PCD). Using $k=50$ Gibbs steps, we show that for problems with high-energy barriers between modes, QA-based seeds can improve upon chains with CD and PCD initializations. For these hard problems, QA gradient estimates are more accurate, and allow for faster learning. Furthermore, and interestingly, even the case of raw QA samples (that is, $k=0$) achieved similar improvements. We argue that this relates to the fact that we are training a quantum rather than classical Boltzmann distribution in this case. The learned parameters give rise to hardware QA distributions closely approximating classical Boltzmann distributions that are hard to train with CD/PCD.

arXiv:1611.04528•Nov 14, 2016•45 citations

Assessment of image generation by quantum annealer

Takehito Sato, Masayuki Ohzeki, Kazuyuki Tanaka

Quantum annealing was originally proposed as an approach for solving combinatorial optimization problems using quantum effects. D-Wave Systems has released a production model of quantum annealing hardware. However, the inherent noise and various environmental factors in the hardware hamper the determination of optimal solutions. In addition, the freezing effect in regions with weak quantum fluctuations generates outputs approximately following a Gibbs-Boltzmann distribution at an extremely low temperature. Thus, a quantum annealer may also serve as a fast sampler for the Ising spin-glass problem, and several studies have investigated Boltzmann machine learning using a quantum annealer. Previous developments have focused on comparing the performance in the standard distance of the resulting distributions between conventional methods in classical computers and sampling by a quantum annealer. In this study, we focused on the performance of a quantum annealer as a generative model from a different aspect. To evaluate its performance, we prepared a discriminator given by a neural network trained on an a priori dataset. The evaluation results show a higher performance of quantum annealer compared with the classical approach for Boltzmann machine learning in training of the generative model. However the generation of the data suffers from the remanent quantum fluctuation in the quantum annealer. The quality of the generated images from the quantum annealer gets worse than the ideal case of the quantum annealing and the classical Monte-Carlo sampling.

arXiv:2103.08373•Scientific Reports•Jun 29, 2021•31 citations

Optimization by Parallel Quasi-Quantum Annealing with Gradient-Based Sampling

Yuma Ichikawa, Yamato Arai

Learning-based methods have gained attention as general-purpose solvers due to their ability to automatically learn problem-specific heuristics, reducing the need for manually crafted heuristics. However, these methods often face scalability challenges. To address these issues, the improved Sampling algorithm for Combinatorial Optimization (iSCO), using discrete Langevin dynamics, has been proposed, demonstrating better performance than several learning-based solvers. This study proposes a different approach that integrates gradient-based update through continuous relaxation, combined with Quasi-Quantum Annealing (QQA). QQA smoothly transitions the objective function, starting from a simple convex function, minimized at half-integral values, to the original objective function, where the relaxed variables are minimized only in the discrete space. Furthermore, we incorporate parallel run communication leveraging GPUs to enhance exploration capabilities and accelerate convergence. Numerical experiments demonstrate that our method is a competitive general-purpose solver, achieving performance comparable to iSCO and learning-based solvers across various benchmark problems. Notably, our method exhibits superior speed-quality trade-offs for large-scale instances compared to iSCO, learning-based solvers, commercial solvers, and specialized algorithms.

arXiv:2409.02135•Sep 2, 2024•1 citation

Benchmark study of simulated quantum annealing and asynchronous parallel simulated annealing for quadratic unconstrained binary optimization-based semiprime factorization

Gianbiagio Curato, Manuel Ponzi, Edoardo Chiatello +1 more

Simulated quantum annealing (SQA) has been widely studied as a heuristic for solving hard optimization problems, including integer factorization formulated as a quadratic unconstrained binary optimization (QUBO) problem. In this work, we present a replication-oriented benchmark of annealing-based solvers applied to biprime factorization using the direct QUBO mapping. We perform a controlled comparison of SQA, implemented via path-integral Monte Carlo, simulated annealing (SA), and asynchronous parallel simulated annealing (A-PSA), evaluating their performance in terms of probability of success and time to solution. Here, A-PSA denotes a multistart strategy consisting of multiple independent SA trajectories with no inter-replica interactions. Solver and encoding parameters are systematically optimized using Bayesian optimization to ensure a fair and reproducible comparison. Our results reproduce previously reported performance trends: SQA outperforms conventional SA on the considered QUBO landscapes, while SQA and A-PSA can exhibit closely comparable performance in specific regimes, highlighting the importance of multistart baselines in annealing-based benchmarking. All simulations are performed on commodity multithreaded CPU hardware using open-source software, enabling straightforward reproducibility without reliance on specialized experimental platforms. As a reference benchmark, the largest semiprime successfully factorized in our study is 8 219 999 = 32 749 × 251 , matching results previously obtained using quantum annealing hardware.

APS Open Science•Jun 3, 2026•0 citations
We introduce QxSQA, a GPGPU-Accelerated Simulated Quantum Annealer based on Path-Integral Monte Carlo (PIMC). QxSQA is tuned for finding low-energy solutions to integer, non-linear optimization problems of up to 214(16,384) binary variables with quadratic interactions on a single GPU instance. Experimental results demonstrate QxSQA can solve Maximum Clique test problems of 8,100 binary variables with planted solutions in under one minute, with linear scaling against key optimization parameters on other large-scale problems. Through the PIMC formulation, QxSQA also functions as an accurate sampler of Boltzmann distributions for machine learning applications. Experimental characterization of Boltzmann sampling results for a reinforcement learning problem showed good convergence performance at useful scales. Our implementation integrates as a solver within our QxBranch developer platform, positioning developers to efficiently develop applications using QxSQA, and then test the same application code on a quantum annealer or universal quantum computer hardware platform such as those from D-Wave Systems, IBM, or Rigetti Computing.
This paper reports a comprehensive experimental characterization of quantum-annealing-aided Boltzmann distribution approximation (QA-aided BDA), a method proposed in prior work for approximating Boltzmann distributions using a D-Wave quantum annealer as a sampler. Boltzmann distributions play a central role in a wide range of fields, including statistical physics, machine learning, and wireless communication. However, when a Boltzmann distribution is defined over an Ising model consisting of binary variables, exact computation becomes exponentially more difficult as the system size increases. Unlike conventional frequency-based methods, QA-aided BDA reconstructs Boltzmann weights from a set of low-energy configurations obtained from QA sampling. Although QA-aided BDA has shown promising performance in practical applications, its fundamental characteristics, including approximation accuracy, computational cost, and sensitivity to key parameters, have not been systematically investigated. This study evaluated its approximation accuracy using the Kullback–Leibler divergence for fully connected Ising models under various annealing parameters, problem sizes, inverse temperatures, unembedding strategies, and post-processing conditions. The results show that the approximation accuracy depends mainly on the number of samples and on the chain strength used for embedding, and much less on the annealing time in the investigated range. Additionally, at an appropriate chain strength, the choice of unembedding method does not change the accuracy but can change the local processing time by more than an order of magnitude. Finally, at the same number of retained samples, QA-aided BDA becomes substantially more accurate than existing QA-based sampling methods as the number of samples increases, although the computational costs were not matched.
A distributed deep reinforcement learning framework based on GPU cluster was constructed to solve the computational problems of large-scale quantum chemistry simulation. The framework includes technologies such as parallel strategy optimization, asynchronous gradient update, and dynamic scheduling tasks. Efficient communication algorithms are adopted to maximize the utilization of hardware resources and achieve scaling. Experimental evaluation of representative quantum chemistry problems was performed on a multi-node GPU platform. The results show that the average GPU utilization rate exceeds 92% due to the near-linear scale expansion to 128 GPUs. This improves the simulation throughput and efficiency. The system has good performance and convergence behavior for a variety of workloads. The results show that these GPUs, matched with advanced improved distributed DRL models, can break thru the traditional bottleneck of using supercomputers to solve complex physical and chemical problems, so as to complete all these dazzling and complex molecules faster and better.
Quantum annealing (QA) is a hardware-based heuristic optimization and sampling method applicable to discrete undirected graphical models. While similar to simulated annealing, QA relies on quantum, rather than thermal, effects to explore complex search spaces. For many classes of problems, QA is known to offer computational advantages over simulated annealing. Here we report on the ability of recent QA hardware to accelerate training of fully visible Boltzmann machines. We characterize the sampling distribution of QA hardware, and show that in many cases, the quantum distributions differ significantly from classical Boltzmann distributions. In spite of this difference, training (which seeks to match data and model statistics) using standard classical gradient updates is still effective. We investigate the use of QA for seeding Markov chains as an alternative to contrastive divergence (CD) and persistent contrastive divergence (PCD). Using k=50k=50k=50 Gibbs steps, we show that for problems with high-energy barriers between modes, QA-based seeds can improve upon chains with CD and PCD initializations. For these hard problems, QA gradient estimates are more accurate, and allow for faster learning. Furthermore, and interestingly, even the case of raw QA samples (that is, k=0k=0k=0) achieved similar improvements. We argue that this relates to the fact that we are training a quantum rather than classical Boltzmann distribution in this case. The learned parameters give rise to hardware QA distributions closely approximating classical Boltzmann distributions that are hard to train with CD/PCD.
Quantum annealing was originally proposed as an approach for solving combinatorial optimization problems using quantum effects. D-Wave Systems has released a production model of quantum annealing hardware. However, the inherent noise and various environmental factors in the hardware hamper the determination of optimal solutions. In addition, the freezing effect in regions with weak quantum fluctuations generates outputs approximately following a Gibbs-Boltzmann distribution at an extremely low temperature. Thus, a quantum annealer may also serve as a fast sampler for the Ising spin-glass problem, and several studies have investigated Boltzmann machine learning using a quantum annealer. Previous developments have focused on comparing the performance in the standard distance of the resulting distributions between conventional methods in classical computers and sampling by a quantum annealer. In this study, we focused on the performance of a quantum annealer as a generative model from a different aspect. To evaluate its performance, we prepared a discriminator given by a neural network trained on an a priori dataset. The evaluation results show a higher performance of quantum annealer compared with the classical approach for Boltzmann machine learning in training of the generative model. However the generation of the data suffers from the remanent quantum fluctuation in the quantum annealer. The quality of the generated images from the quantum annealer gets worse than the ideal case of the quantum annealing and the classical Monte-Carlo sampling.
Learning-based methods have gained attention as general-purpose solvers due to their ability to automatically learn problem-specific heuristics, reducing the need for manually crafted heuristics. However, these methods often face scalability challenges. To address these issues, the improved Sampling algorithm for Combinatorial Optimization (iSCO), using discrete Langevin dynamics, has been proposed, demonstrating better performance than several learning-based solvers. This study proposes a different approach that integrates gradient-based update through continuous relaxation, combined with Quasi-Quantum Annealing (QQA). QQA smoothly transitions the objective function, starting from a simple convex function, minimized at half-integral values, to the original objective function, where the relaxed variables are minimized only in the discrete space. Furthermore, we incorporate parallel run communication leveraging GPUs to enhance exploration capabilities and accelerate convergence. Numerical experiments demonstrate that our method is a competitive general-purpose solver, achieving performance comparable to iSCO and learning-based solvers across various benchmark problems. Notably, our method exhibits superior speed-quality trade-offs for large-scale instances compared to iSCO, learning-based solvers, commercial solvers, and specialized algorithms.
Simulated quantum annealing (SQA) has been widely studied as a heuristic for solving hard optimization problems, including integer factorization formulated as a quadratic unconstrained binary optimization (QUBO) problem. In this work, we present a replication-oriented benchmark of annealing-based solvers applied to biprime factorization using the direct QUBO mapping. We perform a controlled comparison of SQA, implemented via path-integral Monte Carlo, simulated annealing (SA), and asynchronous parallel simulated annealing (A-PSA), evaluating their performance in terms of probability of success and time to solution. Here, A-PSA denotes a multistart strategy consisting of multiple independent SA trajectories with no inter-replica interactions. Solver and encoding parameters are systematically optimized using Bayesian optimization to ensure a fair and reproducible comparison. Our results reproduce previously reported performance trends: SQA outperforms conventional SA on the considered QUBO landscapes, while SQA and A-PSA can exhibit closely comparable performance in specific regimes, highlighting the importance of multistart baselines in annealing-based benchmarking. All simulations are performed on commodity multithreaded CPU hardware using open-source software, enabling straightforward reproducibility without reliance on specialized experimental platforms. As a reference benchmark, the largest semiprime successfully factorized in our study is 8 219 999 = 32 749 × 251 , matching results previously obtained using quantum annealing hardware.