Abstract
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.
Similar content being viewed by others
References
Lawler Eugene L (1985) The travelling salesman problem: a guided tour of combinatorial optimization. Wiley, New York
Neukart Florian, Compostella Gabriele, Seidel Christian, von Dollen David, Yarkoni Sheir, Parney Bob (2017) Traffic flow optimization using a quantum annealer. Frontiers in ICT 4:29–29
Orus Roman, Mugel Samuel, Lizaso Enrique (2019) Quantum computing for finance: Overview and prospects. Rev Phys 4:100028
Elsokkary N, Khan FS, La Torre D, Humble TS, Gottlieb J (2017) Financial portfolio management using d-wave quantum optimizer: The case of abu dhabi securities exchange. Technical report, Oak Ridge National Lab.(ORNL), Oak Ridge, TN (United States),
Titiloye Olawale, Crispin Alan (2011) Quantum annealing of the graph coloring problem. Discret Optim 8(2):376–384
Ushijima H, Negre CFA, Mniszewski SM (2017) Graph partitioning using quantum annealing on the d-wave system. In: Proceedings of the Second International Workshop on Post Moores Era Supercomputing, pp 22–29
Kadowaki T, Nishimori H (1998) Quantum annealing in the transverse Ising model. Phys Rev E 58:5355–5363
Tadashi K (June 1998) Study of optimization problems by quantum annealing. PhD thesis, Department of Physics, Tokyo Institute of Technology
D-wave (2019) D-wave systems. https://www.dwavesys.com
D-wave (2019) The D-Wave 2000Q Quantum Computer Technology. https://www.dwavesys.com/d-wave-two-system
Zaribafiyan Arman, Marchand Dominic J, Rezaei Seyed Saeed Changiz (2017) Systematic and deterministic graph minor embedding for cartesian products of graphs. Q Inf Process 16(5):1–26
Suzuki M, Miyashita S, Kuroda A (1977) Monte carlo simulation of quantum spin systems i. Prog Theor Phys 58(5):1377–1387
Crosson E, Harrow AW (Oct 2016) Simulated quantum annealing can be exponentially faster than classical simulated annealing. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp 714–723
Waidyasooriya H, Hariyama M Highly-parallel FPGA accelerator for simulated quantum annealing. In: IEEE transactions on emerging topics in computing. https://doi.org/10.1109/TETC.2019.2957177
Liu C, Waidyasooriya HM, Hariyama M (2019) Data-transfer-bottleneck-less architecture for fpga-based quantum annealing simulation. In: 2019 Seventh International Symposium on Computing and Networking (CANDAR), pp 164–170
Suzuki M (1976) Relationship between d-dimensional quantal spin systems and (d+1)-dimensional ising systems: Equivalence, critical exponents and systematic approximants of the partition function and spin correlations. Prog Theor Phys 56(5):1454–1469
Stinchcombe R B (1973) Ising model in a transverse field. i. basic theory. J Phys C: Solid State Phys 6(15):2459–2483
Fujitsu (2019) Fujitsu Digital Annealer. https://www.fujitsu.com/global/services/business-services/digital-annealer/what-is-digital-annealer/index.html,
Yamaoka M, Yoshimura C, Hayashi M, Okuyama T, Aoki H, Mizuno H (2016) A 20k-spin ising chip to solve combinatorial optimization problems with cmos annealing. IEEE J Solid-State Circuits 51(1):303–309
Weigel M (2012) Performance potential for simulating spin models on gpu. J Comput Phys 231(8):3064–3082
Cook C, Zhao H, Sato T, Hiromoto M, Tan SX-D (2018) Gpu based parallel ising computing for combinatorial optimization problems in vlsi physical design. arXiv preprint arXiv:1807.10750,
Waidyasooriya HM, Hariyama M (2020) A gpu-based quantum annealing simulator for fully-connected ising models utilizing spatial and temporal parallelism. IEEE Access 8:67929–67939
Okuyama T, Hayashi M, Yamaoka M (2017) An ising computer based on simulated quantum annealing by path integral monte carlo method. In: 2017 IEEE International Conference on Rebooting Computing (ICRC), pp 1–6
Okuyama T, Hayashi M, Yamaoka M (Nov 2017) An ising computer based on simulated quantum annealing by path integral monte carlo method. In: 2017 IEEE International Conference on Rebooting Computing (ICRC), pp 1–6
Waidyasooriya HM, Araki Y, Hariyama M (2018) Accelerator architecture for simulated quantum annealing based on resource-utilization-aware scheduling and its implementation using opencl. In: 2018 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS), pp 335–340
Waidyasooriya HM, Hariyama M, Miyama MJ, Ohzeki M (2019) OpenCL-based design of an FPGA accelerator for quantum annealing simulation. J Supercomput 75(8):5019–5039
Lucas Andrew (2014) Ising formulations of many np problems. Front Phys 2:5
Terasic (2018) Terasic DE10-Pro. https://www.terasic.com.tw/cgi-bin/page/archive.pl?Language=English&CategoryNo=248&No=1144,
Intel (2018) Intel Stratix 10 FPGAs. https://www.intel.com/content/www/us/en/products/programmable/fpga/stratix-10.html,
Acknowledgements
This research is partly supported by MEXT KAKENHI, grant numbers 19K11998 and 20H04197.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Liu, CY., Waidyasooriya, H.M. & Hariyama, M. Design space exploration for an FPGA-based quantum annealing simulator with interaction-coefficient-generators. J Supercomput 78, 1–17 (2022). https://doi.org/10.1007/s11227-021-03859-5
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-021-03859-5