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

The Journal of Supercomputing

Temporal and spatial parallel processing of simulated quantum annealing on a multicore CPU

Hasitha Muthumala Waidyasooriya, Masanori Hariyama

Published Jan 12, 2022• 16 citations
Publisher
DOI
10.1007/s11227-021-04242-0

Related papers

A GPU-Based Quantum Annealing Simulator for Fully-Connected Ising Models Utilizing Spatial and Temporal Parallelism

Hasitha Muthumala Waidyasooriya, Masanori Hariyama

Simulated quantum annealing (SQA) is a probabilistic approximation method to find a solution for a combinatorial optimization problem using digital computers. The processing time of SQA increases exponentially with the number of variables. Therefore, acceleration of SQA is regarded as a very important topic. However, parallel implementation is difficult due to the serial nature of the quantum Monte Carlo algorithm used in SQA. In this paper, we propose a method to implement SQA in parallel on a GPU while preserving the data dependency. According to the experimental results, we have achieved over 97 times speed-up while maintaining the same accuracy-level compared to a single-core CPU implementation.

IEEE Access•Jan 1, 2020•22 citations

Design of a parallel hardware architecture for Quantum Annealing Algorithm acceleration

Evelina Forno

•Jul 26, 2018•0 citations

Highly-Parallel FPGA Accelerator for Simulated Quantum Annealing

Hasitha Muthumala Waidyasooriya, Masanori Hariyama

Quantum annealing (QA) is a method to find the global optimum of a combinatorial optimization problem by using quantum fluctuations. Quantum annealers such as D-wave are efficient to solve small problems with less than 2048 variables. Simulated quantum annealing on digital computers allows us to solve large real-world problems. However, the processing time increases exponentially with the number of variables. This article proposes a highly-parallel accelerator for simulated quantum annealing exploiting spatial and temporal parallelism. The accelerator is implemented using “open computing language (OpenCL)” on FPGA. For 8,192 spin models, we achieve 145 times speed using 32 Trotters in one FPGA and 290 times speed-up using 64 Trotters in two FPGAs, compared to single-core CPU implementation.

IEEE Transactions on Emerging Topics in Computing•Dec 2, 2019•40 citations

Accelerating Simulated Quantum Annealing with GPU and Tensor Cores

Yi-Hua Chung, Cheng-Jhih Shih, Shih‐Hao Hung

Lecture notes in computer science•Jan 1, 2022•7 citations

qGMC-Analyzer -- Quantum Simulation on Multicore Architectures

Murilo Schmalfuss, Renata Reiser, Mauricio Lima Pilla +1 more

This paper presents an extension of the VPE-qGM execution environment in order to support parallel execution using OpenMP. As a relevant part of a broader project represented by the simulation framework D-GM which aims to achieve quantum simulation on hybrid architectures (clusters, multicore CPUs and GPUs), this work enables the control and execution of the simulation from multicore architectures. This proposal is shown by providing relevant management simulation on multicore CPUs, which will be later combined with GPU targeted implementations. From the synergy between these implementations, this work aims to establish a general platform for hybrid simulation, exploring different architectures usually found in clusters and expanding the capabilities of the simulation environment VPE-qGM.

Workshop-School on Theoretical Computer Science•Oct 1, 2013•0 citations

Overview of a Quantum Annealing Processor

Mark W. Johnson

Bulletin of the American Physical Society•Mar 21, 2013•0 citations
Simulated quantum annealing (SQA) is a probabilistic approximation method to find a solution for a combinatorial optimization problem using digital computers. The processing time of SQA increases exponentially with the number of variables. Therefore, acceleration of SQA is regarded as a very important topic. However, parallel implementation is difficult due to the serial nature of the quantum Monte Carlo algorithm used in SQA. In this paper, we propose a method to implement SQA in parallel on a GPU while preserving the data dependency. According to the experimental results, we have achieved over 97 times speed-up while maintaining the same accuracy-level compared to a single-core CPU implementation.
Quantum annealing (QA) is a method to find the global optimum of a combinatorial optimization problem by using quantum fluctuations. Quantum annealers such as D-wave are efficient to solve small problems with less than 2048 variables. Simulated quantum annealing on digital computers allows us to solve large real-world problems. However, the processing time increases exponentially with the number of variables. This article proposes a highly-parallel accelerator for simulated quantum annealing exploiting spatial and temporal parallelism. The accelerator is implemented using “open computing language (OpenCL)” on FPGA. For 8,192 spin models, we achieve 145 times speed using 32 Trotters in one FPGA and 290 times speed-up using 64 Trotters in two FPGAs, compared to single-core CPU implementation.
This paper presents an extension of the VPE-qGM execution environment in order to support parallel execution using OpenMP. As a relevant part of a broader project represented by the simulation framework D-GM which aims to achieve quantum simulation on hybrid architectures (clusters, multicore CPUs and GPUs), this work enables the control and execution of the simulation from multicore architectures. This proposal is shown by providing relevant management simulation on multicore CPUs, which will be later combined with GPU targeted implementations. From the synergy between these implementations, this work aims to establish a general platform for hybrid simulation, exploring different architectures usually found in clusters and expanding the capabilities of the simulation environment VPE-qGM.