{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:38:35Z","timestamp":1762522715120,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031073113"},{"type":"electronic","value":"9783031073120"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-07312-0_9","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"174-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Accelerating Simulated Quantum Annealing with\u00a0GPU and\u00a0Tensor Cores"],"prefix":"10.1007","author":[{"given":"Yi-Hua","family":"Chung","sequence":"first","affiliation":[]},{"given":"Cheng-Jhih","family":"Shih","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2043-2663","authenticated-orcid":false,"given":"Shih-Hao","family":"Hung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Kadowaki, T., Nishimori, H.: Quantum annealing in the transverse Ising model. Phys. Rev. E 58(5), 5355 (1998)","DOI":"10.1103\/PhysRevE.58.5355"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Venturelli, D., Kondratyev, A.: Reverse quantum annealing approach to portfolio optimization problems. Quantum Mach. Intell. 1(1), 17\u201330 (2019)","DOI":"10.1007\/s42484-019-00001-w"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep00571","volume":"2","author":"A Perdomo-Ortiz","year":"2012","unstructured":"Perdomo-Ortiz, A., Dickson, N., Drew-Brook, M., Rose, G., Aspuru-Guzik, A.: Finding low-energy conformations of lattice protein models by quantum annealing. Sci. Rep. 2(1), 1\u20137 (2012)","journal-title":"Sci. Rep."},{"issue":"11","key":"9_CR4","doi-asserted-by":"publisher","first-page":"224","DOI":"10.3390\/a12110224","volume":"12","author":"C Papalitsas","year":"2019","unstructured":"Papalitsas, C., Andronikos, T., Giannakis, K., Theocharopoulou, G., Fanarioti, S.: A QUBO model for the traveling salesman problem with time windows. Algorithms 12(11), 224 (2019)","journal-title":"Algorithms"},{"issue":"6","key":"9_CR5","first-page":"1","volume":"33","author":"BA Cipra","year":"2000","unstructured":"Cipra, B.A.: The Ising model is NP-complete. SIAM News 33(6), 1\u20133 (2000)","journal-title":"SIAM News"},{"issue":"6","key":"9_CR6","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087\u20131092 (1953)","journal-title":"J. Chem. Phys."},{"issue":"6231","key":"9_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1126\/science.aaa4170","volume":"348","author":"B Heim","year":"2015","unstructured":"Heim, B., Ronnow, T.F., Isakov, S.V., Troyer, M.: Quantum versus classical annealing of Ising spin glasses. Science 348(6231), 215\u2013217 (2015)","journal-title":"Science"},{"issue":"5","key":"9_CR8","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1143\/PTP.56.1454","volume":"56","author":"M Suzuki","year":"1976","unstructured":"Suzuki, M.: 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. Phy. 56(5), 1454\u20131469 (1976)","journal-title":"Prog. Theor. Phy."},{"issue":"01","key":"9_CR9","doi-asserted-by":"publisher","first-page":"1850006","DOI":"10.1142\/S0219749918500065","volume":"16","author":"AH Abdel-Aty","year":"2018","unstructured":"Abdel-Aty, A.H., Khedr, A.N., Saddeek, Y.B., Youssef, A.A.: Thermal entanglement in quantum annealing processor. Int. J. Quantum Inf. 16(01), 1850006 (2018)","journal-title":"Int. J. Quantum Inf."},{"issue":"1","key":"9_CR10","first-page":"303","volume":"51","author":"M Yamaoka","year":"2015","unstructured":"Yamaoka, M., Yoshimura, C., Hayashi, M., Okuyama, T., Aoki, H., Mizuno, H.: A 20k-spin Ising chip to solve combinatorial optimization problems with CMOS annealing. IEEE J. Solid State Circ. 51(1), 303\u2013309 (2015)","journal-title":"IEEE J. Solid State Circ."},{"issue":"8","key":"9_CR11","doi-asserted-by":"publisher","first-page":"5019","DOI":"10.1007\/s11227-019-02778-w","volume":"75","author":"HM Waidyasooriya","year":"2019","unstructured":"Waidyasooriya, H.M., Hariyama, M., Miyama, M.J., Ohzeki, M.: OpenCL-based design of an FPGA accelerator for quantum annealing simulation. J. Supercomput. 75(8), 5019\u20135039 (2019). https:\/\/doi.org\/10.1007\/s11227-019-02778-w","journal-title":"J. Supercomput."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Waidyasooriya, H., Hariyama, M.: Highly-parallel FPGA accelerator for simulated quantum annealing. IEEE Trans. Emerg. Topics Comput.9, 2019\u20132029 (2019)","DOI":"10.1109\/TETC.2019.2957177"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Liu, C.Y., Waidyasooriya, H.M., Hariyama, M.: Data-transfer-bottleneck-less architecture for FPGA-based quantum annealing simulation. In: 2019 Seventh International Symposium on Computing and Networking (CANDAR), pp. 164\u2013170. IEEE, November 2019","DOI":"10.1109\/CANDAR.2019.00028"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Okuyama, T., Hayashi, M., Yamaoka, M.: 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\u20136. IEEE, November 2017","DOI":"10.1109\/ICRC.2017.8123652"},{"issue":"8","key":"9_CR15","doi-asserted-by":"publisher","first-page":"3064","DOI":"10.1016\/j.jcp.2011.12.008","volume":"231","author":"M Weigel","year":"2012","unstructured":"Weigel, M.: Performance potential for simulating spin models on GPU. J. Comput. Phys. 231(8), 3064\u20133082 (2012)","journal-title":"J. Comput. Phys."},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Cook, C., Zhao, H., Sato, T., Hiromoto, M., Tan, S.X.D.: GPU based parallel Ising computing for combinatorial optimization problems in VLSI physical design. arXiv preprint (2018). arXiv:1807.10750","DOI":"10.1016\/j.vlsi.2019.07.003"},{"key":"9_CR17","unstructured":"Dwave, https:\/\/www.dwavesys.com\/"},{"key":"9_CR18","unstructured":"Dattani, N., Szalay, S., Chancellor, N.: Pegasus: the second connectivity graph for large-scale quantum annealing hardware (2019). arXiv preprint arXiv:1901.07636"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Choi, V.: Minor-embedding in adiabatic quantum computation: I. The parameter setting problem. Quantum Inf. Process. 7(5), 193\u2013209 (2008)","DOI":"10.1007\/s11128-008-0082-9"},{"key":"9_CR20","unstructured":"JUQCS-G. https:\/\/www.fz-juelich.de\/portal\/DE\/Home\/home_node.html"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Markidis, S., Der Chien, S.W., Laure, E., Peng, I.B., Vetter, J.S.: Nvidia tensor core programmability, performance & precision. In: 2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 522\u2013531. IEEE, May 2018","DOI":"10.1109\/IPDPSW.2018.00091"},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"67929","DOI":"10.1109\/ACCESS.2020.2985699","volume":"8","author":"HM Waidyasooriya","year":"2020","unstructured":"Waidyasooriya, H.M., Hariyama, M.: A GPU-based quantum annealing simulator for fully-connected Ising models utilizing spatial and temporal parallelism. IEEE Access 8, 67929\u201367939 (2020)","journal-title":"IEEE Access"},{"issue":"6231","key":"9_CR23","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1126\/science.aaa4170","volume":"348","author":"B Heim","year":"2015","unstructured":"Heim, B., R\u00f8nnow, T.F., Isakov, S.V., Troyer, M.: Quantum versus classical annealing of Ising spin glasses. Science 348(6231), 215\u2013217 (2015)","journal-title":"Science"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.cpc.2015.02.015","volume":"192","author":"SV Isakov","year":"2015","unstructured":"Isakov, S.V., Zintchenko, I.N., R\u00f8nnow, T.F., Troyer, M.: Optimised simulated annealing for Ising spin glasses. Comput. Phys. Commun. 192, 265\u2013271 (2015)","journal-title":"Comput. Phys. Commun."},{"key":"9_CR25","unstructured":"Steinberg, A.P., Kosowsky, M., Fraden, S.: Simulations: the Ising Model (2013)"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Gould, H., Tobochnik, J.: Statistical and Thermal Physics. University Press, Princeton (2010)","DOI":"10.1515\/9781400837038"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, S., Gelatt, C.D., Jr., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","DOI":"10.1126\/science.220.4598.671"},{"issue":"5","key":"9_CR28","doi-asserted-by":"publisher","first-page":"1377","DOI":"10.1143\/PTP.58.1377","volume":"58","author":"M Suzuki","year":"1977","unstructured":"Suzuki, M., Miyashita, S., Kuroda, A.: Monte Carlo simulation of quantum spin systems. I. Prog. Theor. Phys. 58(5), 1377\u20131387 (1977)","journal-title":"I. Prog. Theor. Phys."},{"key":"9_CR29","unstructured":"Bravyi, S.: Monte Carlo simulation of stoquastic Hamiltonians (2014). arXiv preprint arXiv:1402.2295"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Crosson, E., Harrow, A.W.: 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\u2013723. IEEE, October 2016","DOI":"10.1109\/FOCS.2016.81"},{"key":"9_CR31","unstructured":"Bravyi, S., Divincenzo, D.P., Oliveira, R.I., Terhal, B.M.: The complexity of stoquastic local Hamiltonian problems (2006). arXiv preprint quant-ph\/0606140"},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-030-58942-4_8","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"DE Bernal","year":"2020","unstructured":"Bernal, D.E., Booth, K.E.C., Dridi, R., Alghassi, H., Tayur, S., Venturelli, D.: Integer programming techniques for minor-embedding in quantum annealers. In: Hebrard, E., Musliu, N. (eds.) CPAIOR 2020. LNCS, vol. 12296, pp. 112\u2013129. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58942-4_8"},{"key":"9_CR33","unstructured":"NVIDIA ampere. https:\/\/images.nvidia.com\/aem-dam\/en-zz\/Solutions\/data-center\/nvidia-ampere-architecture-whitepaper.pdf"},{"key":"9_CR34","unstructured":"cuBLAS. https:\/\/docs.nvidia.com\/cuda\/cublas\/index.html"},{"key":"9_CR35","unstructured":"cutlass. https:\/\/github.com\/NVIDIA\/cutlass"},{"key":"9_CR36","unstructured":"Gset. https:\/\/web.stanford.edu\/~yyye\/yyye\/Gset\/"},{"key":"9_CR37","doi-asserted-by":"crossref","unstructured":"Benlic, U., Hao, J.K.: Breakout local search for the max-cutproblem. Eng. Appl. Artif. Intell. 26(3), 1162\u20131173 (2013)","DOI":"10.1016\/j.engappai.2012.09.001"},{"key":"9_CR38","doi-asserted-by":"crossref","unstructured":"Goto, H., et al.:High-performance combinatorial optimization based on classical mechanics. Sci. Adv. 7(6), eabe7953 (2021)","DOI":"10.1126\/sciadv.abe7953"},{"key":"9_CR39","unstructured":"CUDA-9. https:\/\/developer.nvidia.com\/blog\/programming-tensor-cores-cuda-9\/"},{"key":"9_CR40","unstructured":"WMMA. https:\/\/docs.nvidia.com\/cuda\/cuda-c-programming-guide\/index.html#wmma"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-07312-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T12:14:12Z","timestamp":1673957652000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-07312-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031073113","9783031073120"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-07312-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISC High Performance","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on High Performance Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hamburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"supercomputing2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Linklings","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the workshops a 27 papers have been accepted for publication out of a total of 43 submissions.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}