{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:58:37Z","timestamp":1743112717256,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030040697"},{"type":"electronic","value":"9783030040703"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04070-3_9","type":"book-chapter","created":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T13:56:27Z","timestamp":1542808587000},"page":"111-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Graph Minors from Simulated Annealing for Annealing Machines with Sparse Connectivity"],"prefix":"10.1007","author":[{"given":"Yuya","family":"Sugie","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1402-7840","authenticated-orcid":false,"given":"Yuki","family":"Yoshida","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3025-7141","authenticated-orcid":false,"given":"Normann","family":"Mertig","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5949-2252","authenticated-orcid":false,"given":"Takashi","family":"Takemoto","sequence":"additional","affiliation":[]},{"given":"Hiroshi","family":"Teramoto","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7078-8655","authenticated-orcid":false,"given":"Atsuyoshi","family":"Nakamura","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5633-995X","authenticated-orcid":false,"given":"Ichigaku","family":"Takigawa","sequence":"additional","affiliation":[]},{"given":"Shin-Ichi","family":"Minato","sequence":"additional","affiliation":[]},{"given":"Masanao","family":"Yamaoka","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7175-8474","authenticated-orcid":false,"given":"Tamiki","family":"Komatsuzaki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,22]]},"reference":[{"issue":"50","key":"9_CR1","doi-asserted-by":"publisher","first-page":"7018","DOI":"10.1016\/j.tcs.2011.09.015","volume":"412","author":"I Adler","year":"2011","unstructured":"Adler, I., et al.: Faster parameterized algorithms for minor containment. Theoret. Comput. Sci. 412(50), 7018\u20137028 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR2","unstructured":"Cai, J., Macready, B., Roy, A.: A practical heuristic for finding graph minors, arxiv:1406.2741"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Choi, V.: Minor-embedding in adiabatic quantum computation: I. the parameter setting problem. Quant. Inf. Process. 7(5), 193\u2013209 (2008)","DOI":"10.1007\/s11128-008-0082-9"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Choi, V.: Minor-embedding in adiabatic quantum computation: II. minor-universal graph design. Quant. Inf. Process. 10(3), 343\u2013353 (2011)","DOI":"10.1007\/s11128-010-0200-3"},{"issue":"5516","key":"9_CR5","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1126\/science.1057726","volume":"292","author":"E Farhi","year":"2001","unstructured":"Farhi, E., et al.: A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem. Science 292(5516), 472\u2013475 (2001)","journal-title":"Science"},{"issue":"6312","key":"9_CR6","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1126\/science.aah4243","volume":"354","author":"T Inagaki","year":"2016","unstructured":"Inagaki, T., et al.: A coherent Ising machine for 2000-node optimization problems. Science 354(6312), 603\u2013606 (2016). https:\/\/doi.org\/10.1126\/science.aah4243","journal-title":"Science"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.cpc.2015.02.015","volume":"192","author":"S Isakov","year":"2015","unstructured":"Isakov, S., et al.: Optimised simulated annealing for Ising spin glasses. Comput. Phys. Commun. 192, 265\u2013271 (2015)","journal-title":"Comput. Phys. Commun."},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1038\/nature10012","volume":"473","author":"MW Johnson","year":"2011","unstructured":"Johnson, M.W., et al.: Quantum annealing with manufactured spins. Nature 473, 194\u2013198 (2011)","journal-title":"Nature"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"5355","DOI":"10.1103\/PhysRevE.58.5355","volume":"58","author":"T Kadowaki","year":"1998","unstructured":"Kadowaki, T., Nishimori, H.: Quantum annealing in the transverse Ising model. Phys. Rev. E 58, 5355\u20135363 (1998)","journal-title":"Phys. Rev. E"},{"issue":"4598","key":"9_CR10","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s11128-013-0683-9","volume":"13","author":"C Klymko","year":"2014","unstructured":"Klymko, C., Sullivan, B.D., Humble, T.S.: Adiabatic quantum programming: minor embedding with hard faults. Quant. Inf. Process. 13(3), 709\u2013729 (2014)","journal-title":"Quant. Inf. Process."},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"G Kochenberger","year":"2014","unstructured":"Kochenberger, G., et al.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28(1), 58\u201381 (2014)","journal-title":"J. Comb. Optim."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3389\/fphy.2014.00005","volume":"2","author":"A Lucas","year":"2014","unstructured":"Lucas, A.: Ising formulations of many NP problems. Front. Phys. 2, 5 (2014)","journal-title":"Front. Phys."},{"issue":"6312","key":"9_CR14","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1126\/science.aah5178","volume":"354","author":"PL McMahon","year":"2016","unstructured":"McMahon, P.L., et al.: A fully programmable 100-spin coherent Ising machine with all-to-all connections. Science 354(6312), 614\u2013617 (2016)","journal-title":"Science"},{"key":"9_CR15","first-page":"97","volume":"116","author":"T Okuyama","year":"2016","unstructured":"Okuyama, T., et al.: Contractive graph-minor embedding for CMOS Ising computer. IEICE Tech. Rep. 116, 97\u2013103 (2016)","journal-title":"IEICE Tech. Rep."},{"key":"9_CR16","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 (2017)","DOI":"10.1109\/ICRC.2017.8123652"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1109\/JPROC.2015.2494218","volume":"104","author":"B Shahriari","year":"2016","unstructured":"Shahriari, B., et al.: Taking the human out of the loop: a review of bayesian optimization. Proc. IEEE 104(1), 148\u2013175 (2016)","journal-title":"Proc. IEEE"},{"issue":"1","key":"9_CR18","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/JSSC.2015.2498601","volume":"51","author":"M Yamaoka","year":"2016","unstructured":"Yamaoka, M., et al.: A 20k-spin Ising chip to solve combinatorial optimization problems with CMOS annealing. IEEE J. Solid-State Circ. 51(1), 303\u2013309 (2016)","journal-title":"IEEE J. Solid-State Circ."},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"077201","DOI":"10.1103\/PhysRevLett.115.077201","volume":"115","author":"Z Zhu","year":"2015","unstructured":"Zhu, Z., Ochoa, A.J., Katzgraber, H.G.: Efficient cluster algorithm for spin glasses in any space dimension. Phys. Rev. Lett. 115, 077201 (2015)","journal-title":"Phys. Rev. Lett."},{"key":"9_CR20","unstructured":"See publications in technology section on the homepage of D-Wave Systems Inc. Accessed 20 July 2018. https:\/\/www.dwavesys.com\/"}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04070-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T14:10:39Z","timestamp":1614867039000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-04070-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030040697","9783030040703"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04070-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"22 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TPNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Practice of Natural Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tpnc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tpnc2018.irdta.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}