Skip to main content
SpringerLink
Log in

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

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Simulated quantum annealing (SQA) is a probabilistic approximation method to find a solution for a combinatorial optimization problem using a digital computer. It is possible to simulate large-scale optimization problems on a CPU due to its high external memory capacity. However, the processing time increases exponentially with the number of variables, and 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 accelerate SQA on a multicore CPU, based on temporal and spatial parallel processing with high data localization. According to the experimental results using 16-core CPU, we achieved from 8 to 16 times speedup compared to single-core CPU implementations. The proposed method can be used to solve combinatorial optimization problems that have more than 64,000 variables, which was not possible using previous GPU- and FPGA-based accelerators.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Kadowaki T, Nishimori H (1998) Quantum annealing in the transverse Ising model. Phys Rev E 58(5):5355

    Article  Google Scholar 

  2. Kadowaki T (1998) Study of optimization problems by quantum annealing, Ph. D. Dissertation, Department of Physics, Tokyo Institute of Technology

  3. Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency. Springer, Berlin

    MATH  Google Scholar 

  4. Neukart F, Compostella G, Seidel C, von Dollen D, Yarkoni S, Parney B (2017) Traffic flow optimization using a quantum annealer. Front ICT 4:29

    Article  Google Scholar 

  5. Orús R, Mugel S, Lizaso E (2019) Quantum computing for finance: overview and prospects, Reviews in Physics, p. 100028

  6. 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, Oak Ridge National Lab.(ORNL), Oak Ridge, TN (United States), Tech. Rep

  7. Titiloye O, Crispin A (2011) Quantum annealing of the graph coloring problem. Discrete Optim 8(2):376–384

    Article  MathSciNet  Google Scholar 

  8. Ushijima-Mwesigwa H, Negre CF, 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. ACM, pp. 22–29

  9. D-wave (2019) https://www.dwavesys.com

  10. Lanting T, Przybysz AJ, Smirnov AY, Spedalieri FM, Amin MH, Berkley AJ, Harris R, Altomare F, Boixo S, Bunyk P et al (2014) Entanglement in a quantum annealing processor. Phys Rev X 4(2):021041

    Google Scholar 

  11. 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

    Article  Google Scholar 

  12. Okuyama T, Hayashi M, Yamaoka M (2017) An Ising Computer Based on Simulated Quantum Annealing by Path Integral Monte Carlo Method, in IEEE International Conference on Rebooting Computing (ICRC). IEEE, pp. 1–6

  13. 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 International Symposium on Intelligent Signal Processing and Communication Systems (ISPAC), pp. 336–340

  14. Aidyasooriya H, Hariyama M (2019) Highly-parallel fpga accelerator for simulated quantum annealing, IEEE Transactions on Emerging Topics in Computing

  15. Liu C-Y, 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). IEEE 2019: 164–170

  16. Liu Y, Waidyasooriya HM, Hariyama M (2021) Design space exploration for an FPGA-based quantum annealing simulator with interaction-coefficient-generators, The Journal of Supercomputing, pp. 1–17

  17. Weigel M (2012) Performance potential for simulating spin models on GPU. J Comput Phys 231(8):3064–3082

    Article  Google Scholar 

  18. Cook C, Zhao H, Sato T, Hiromoto M, Tan SXD (2018) GPU based parallel Ising computing for combinatorial optimization problems in VLSI physical design, arXiv preprint arXiv:1807.10750

  19. Waidyasooriya HM, Hariyama M (2020) A GPU-Based Quantum Annealing Simulator for Fully-Connected Ising Models Utilizing Spatial and Temporal Parallelism, IEEE Access, vol. 8, pp. 67 929–67 939

  20. Zaribafiyan A, Marchand DJ, Rezaei SSC (2017) Systematic and deterministic graph minor embedding for cartesian products of graphs. Quantum Inf Process 16(5):136

    Article  MathSciNet  Google Scholar 

  21. Booth M, Reinhardt SP (2017) A. Roy, Partitioning optimization problems for hybrid classical/quantum execution, D-wave technical report series, pp. 01–09

  22. Stinchcombe R (1973) Ising model in a transverse field I. Basic theory. J Phys C Solid State Phys 6(15):2459

    Article  Google Scholar 

  23. Pfeuty P, Elliott R (1971) The Ising model with a transverse field, II. Ground state properties. J Phys C Solid State Phys 4(15):2370

    Article  Google Scholar 

  24. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680

    Article  MathSciNet  Google Scholar 

  25. 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. Progress Theor Phys 56(5):1454–1469

    Article  Google Scholar 

  26. Suzuki M, Miyashita S, Kuroda A (1977) Monte Carlo simulation of quantum spin systems. I. Progress Theor Phys 58(5):1377–1387

    Article  MathSciNet  Google Scholar 

  27. Heath MT (2015) A tale of two laws. Int J High Perform Comput Appl 29(3):320–330

    Article  MathSciNet  Google Scholar 

  28. Gset (2019) https://web.stanford.edu/ yyye/yyye/Gset/

  29. Wu Q, Hao J.-K (2012) A Memetic Approach for the Max-cut Problem, In International Conference on Parallel Problem Solving from Nature. Springer, pp. 297–306

  30. Wang Y, Lü Z, Glover F, Hao J-K (2013) Probabilistic grasp-tabu search algorithms for the ubqp problem. Comput Oper Res 40(12):3100–3107

    Article  MathSciNet  Google Scholar 

  31. Kochenberger GA, Hao J-K, Lü Z, Wang H, Glover F (2013) Solving large scale max cut problems via tabu search. J Heuristics 19(4):565–571

    Article  Google Scholar 

  32. Benlic U, Hao J-K (2013) Breakout local search for the max-cutproblem. Eng Appl Artif Intell 26(3):1162–1173

    Article  Google Scholar 

  33. Intel Xeon Gold 6242 Processor, https://ark.intel.com/content/www/us/en/ark/products/192440/intel-xeon-gold-6242-processor-22m-cache-2-80-ghz.html

  34. Nvlink, Nvswitch (2021) The Building Blocks of Advanced Multi-GPU Communication, https://www.nvidia.com/en-us/data-center/nvlink/

Download references

Acknowledgements

This research is partly supported by MEXT KAKENHI, grant numbers 19K11998 and 20H04197.

Author information

Authors and Affiliations

  1. Graduate School of Information Sciences, Tohoku University, 6-3-09, Aramaki-Aza-Aoba, Aoba, Sendai, Miyagi, 980-8579, Japan

    Hasitha Muthumala Waidyasooriya & Masanori Hariyama

Authors
  1. Hasitha Muthumala Waidyasooriya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Masanori Hariyama
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hasitha Muthumala Waidyasooriya.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Waidyasooriya, H.M., Hariyama, M. Temporal and spatial parallel processing of simulated quantum annealing on a multicore CPU. J Supercomput 78, 8733–8750 (2022). https://doi.org/10.1007/s11227-021-04242-0

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-021-04242-0

Keywords

Search

Navigation