Design space exploration for an FPGA-based quantum annealing simulator with interaction-coefficient-generators

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


Quantum annealing simulation attracts much attention recently for solving combinatorial optimization problems. FPGA acceleration is a promising way to reduce the huge processing time in quantum annealing simulations. However, the performance of FPGA accelerators is often restricted by the small external memory bandwidth. To solve this problem, we propose a data-transfer-bottleneck-less FPGA-based accelerator for quantum annealing simulation. The proposed architecture is implemented on an FPGA and achieved up to 179 times speed-up compared to single-core CPU implementation. The proposed accelerator is two times faster compared to previous FPGA accelerators, and process up to 262,144 spins, which is not possible in any existing FPGA accelerators due to limited external memory capacity.

Original languageEnglish
JournalJournal of Supercomputing
Issue number1
Publication statusPublished - 2022 Jan


  • FPGA accelerator
  • OpenCL for FPGA
  • Quantum Monte Carlo simulation
  • Simulated quantum annealing


Dive into the research topics of 'Design space exploration for an FPGA-based quantum annealing simulator with interaction-coefficient-generators'. Together they form a unique fingerprint.

Cite this