{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:41:18Z","timestamp":1768340478725,"version":"3.49.0"},"reference-count":25,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2019,9,1]]},"DOI":"10.1587\/transinf.2018edp7411","type":"journal-article","created":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T22:11:10Z","timestamp":1567289470000},"page":"1696-1706","source":"Crossref","is-referenced-by-count":33,"title":["A Fully-Connected Ising Model Embedding Method and Its Evaluation for CMOS Annealing Machines"],"prefix":"10.1587","volume":"E102.D","author":[{"given":"Daisuke","family":"OKU","sequence":"first","affiliation":[{"name":"Department of Computer Science and Communications Engineering, Waseda University"}]},{"given":"Kotaro","family":"TERADA","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Communications Engineering, Waseda University"}]},{"given":"Masato","family":"HAYASHI","sequence":"additional","affiliation":[{"name":"Hitachi, Ltd."}]},{"given":"Masanao","family":"YAMAOKA","sequence":"additional","affiliation":[{"name":"Hitachi, Ltd."}]},{"given":"Shu","family":"TANAKA","sequence":"additional","affiliation":[{"name":"Green Computing Systems Research Organization, Waseda University"},{"name":"Precursory Research for Embryonic Science and Technology, Japan Science and Technology Agency"}]},{"given":"Nozomu","family":"TOGAWA","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Communications Engineering, Waseda University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] M. Yamaoka, C. Yoshimura, M. Hayashi, T. Okuyama, H. Aoki, and H. Mizuno, \u201cA 20k-spin Ising chip to solve combinatorial optimization problems with CMOS annealing,\u201d IEEE Journal of Solid-State Circuits, vol.51, no.1, pp.303-309, Jan. 2016. 10.1109\/jssc.2015.2498601","DOI":"10.1109\/JSSC.2015.2498601"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] C. Yoshimura, M. Hayashi, T. Okuyama, and M. Yamaoka, \u201cFPGA-based Annealing Processor for Ising Model,\u201d Proc. Fourth International Symposium on Computing and Networking (CANDAR 2016), pp.436-442, Nov. 2016. 10.1109\/candar.2016.0081","DOI":"10.1109\/CANDAR.2016.0081"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] S. Matsubara, H. Tamura, M. Takatsu, D. Yoo, B. Vatankhahghadim, H. Yamasaki, T. Miyazawa, S. Tsukamoto, Y. Watanabe, K. Takemoto, and A. Sheikholeslami, \u201cIsing-Model Optimizer with Parallel-Trial Bit-Sieve Engine,\u201d Advances in Intelligent Systems and Computing, vol.611, pp.432-438, Springer International Publishing, Cham, 2018. 10.1007\/978-3-319-61566-0_39","DOI":"10.1007\/978-3-319-61566-0_39"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] M. Aramon, G. Rosenberg, E. Valiante, T. Miyazawa, H. Tamura, and H.G. Katzgraber, \u201cPhysics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer,\u201d Frontiers in Physics, vol.7, p.48, 2019.","DOI":"10.3389\/fphy.2019.00048"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] M.W. Johnson, M.H.S. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A.J. Berkley, J. Johansson, P. Bunyk, E.M. Chapple, C. Enderud, J.P. Hilton, K. Karimi, E. Ladizinsky, N. Ladizinsky, T. Oh, I. Perminov, C. Rich, M.C. Thom, E. Tolkacheva, C.J.S. Truncik, S. Uchaikin, J. Wang, B. Wilson, and G. Rose, \u201cQuantum annealing with manufactured spins,\u201d Nature, vol.473, no.7346, pp.194-198, May 2011. 10.1038\/nature10012","DOI":"10.1038\/nature10012"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] P.I. Bunyk, E.M. Hoskinson, M.W. Johnson, E. Tolkacheva, F. Altomare, A.J. Berkley, R. Harris, J.P. Hilton, T. Lanting, A.J. Przybysz, and J. Whittaker, \u201cArchitectural Considerations in the Design of a Superconducting Quantum Annealing Processor,\u201d IEEE Transactions on Applied Superconductivity, vol.24, no.4, pp.1-10, Aug. 2014. 10.1109\/tasc.2014.2318294","DOI":"10.1109\/TASC.2014.2318294"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] M. Maezawa, K. Imafuku, M. Hidaka, H. Koike, and S. Kawabata, \u201cDesign of quantum annealing machine for prime factoring,\u201d Proc. 2017 16th International Superconductive Electronics Conference (ISEC), pp.1-3, June 2017. 10.1109\/isec.2017.8314195","DOI":"10.1109\/ISEC.2017.8314195"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] M. Maezawa, G. Fujii, M. Hidaka, K. Imafuku, K. Kikuchi, H. Koike, K. Makise, S. Nagasawa, H. Nakagawa, M. Ukibe, and S. Kawabata, \u201cToward Practical-Scale Quantum Annealing Machine for Prime Factoring,\u201d J. Phys. Soc. Jpn., vol.88, no.6, Sept. 2018. 10.7566\/jpsj.88.061012","DOI":"10.7566\/JPSJ.88.061012"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] T. Inagaki, Y. Haribara, K. Igarashi, T. Sonobe, S. Tamate, T. Honjo, A. Marandi, P.L. McMahon, T. Umeki, K. Enbutsu, O. Tadanaga, H. Takenouchi, K. Aihara, K.I. Kawarabayashi, K. Inoue, S. Utsunomiya, and H. Takesue, \u201cA coherent Ising machine for 2000-node optimization problems,\u201d Science, vol.354, no.6312, pp.603-606, Oct. 2016. 10.1126\/science.aah4243","DOI":"10.1126\/science.aah4243"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] P.L. McMahon, A. Marandi, Y. Haribara, R. Hamerly, C. Langrock, S. Tamate, T. Inagaki, H. Takesue, S. Utsunomiya, K. Aihara, R.L. Byer, M.M. Fejer, H. Mabuchi, and Y. Yamamoto, \u201cA fully programmable 100-spin coherent Ising machine with all-to-all connections,\u201d Science, vol.354, no.6312, pp.614-617, Oct. 2016. 10.1126\/science.aah5178","DOI":"10.1126\/science.aah5178"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] E. Ising, \u201cBeitrag zur Theorie des Ferromagnetismus,\u201d Zeitschrift f\u00fcr Physik, vol.31, no.1, pp.253-258, Feb. 1925. 10.1007\/bf02980577","DOI":"10.1007\/BF02980577"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] A. Lucas, \u201cIsing formulations of many NP problems,\u201d Frontiers in Physics, vol.2, pp.1-15, 2014. 10.3389\/fphy.2014.00005","DOI":"10.3389\/fphy.2014.00005"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] K. Terada, D. Oku, S. Kanamaru, S. Tanaka, M. Hayashi, M. Yamaoka, M. Yanagisawa, and N. Togawa, \u201cAn Ising model mapping to solve rectangle packing problem,\u201d Proc. 2018 International Symposium on VLSI Design, Automation and Test (VLSI-DAT), pp.1-4, April 2018. 10.1109\/vlsi-dat.2018.8373233","DOI":"10.1109\/VLSI-DAT.2018.8373233"},{"key":"14","unstructured":"[14] S. Tanaka, R. Tamura, and B.K. Chakrabarti, Quantum Spin Glasses, Annealing and Computation, 1st ed., Cambridge University Press, New York, NY, USA, 2017."},{"key":"15","unstructured":"[15] J. Cai, W.G. Macready, and A. Roy, \u201cA practical heuristic for finding graph minors,\u201d arXiv preprint arXiv:1406.2741, pp.1-16, 2014."},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] D. Venturelli, S. Mandr\u00e0, S. Knysh, B. O'Gorman, R. Biswas, and V. Smelyanskiy, \u201cQuantum Optimization of Fully Connected Spin Glasses,\u201d Physical Review X, vol.5, no.3, pp.031040:1-031040:8, Sept. 2015. 10.1103\/physrevx.5.031040","DOI":"10.1103\/PhysRevX.5.031040"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] W. Lechner, P. Hauke, and P. Zoller, \u201cA quantum annealing architecture with all-to-all connectivity from local interactions,\u201d Science Advances, vol.1, no.9, pp.e1500838:1-e1500838:5, Oct. 2015. 10.1126\/sciadv.1500838","DOI":"10.1126\/sciadv.1500838"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] A. Zaribafiyan, D.J.J. Marchand, and S.S. Changiz Rezaei, \u201cSystematic and deterministic graph minor embedding for Cartesian products of graphs,\u201d Quantum Information Processing, vol.16, no.5, p.136, May 2017. 10.1007\/s11128-017-1569-z","DOI":"10.1007\/s11128-017-1569-z"},{"key":"19","unstructured":"[19] TheoryInPractice, \u201caqc-virtual-embedding.\u201d https:\/\/github.com\/TheoryInPractice\/aqc-virtual-embedding"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] A.D. King, J. Carrasquilla, J. Raymond, I. Ozfidan, E. Andriyash, A. Berkley, M. Reis, T. Lanting, R. Harris, F. Altomare, K. Boothby, P.I. Bunyk, C. Enderud, A. Fr\u00e9chette, E. Hoskinson, N. Ladizinsky, T. Oh, G. Poulin-Lamarre, C. Rich, Y. Sato, A.Y. Smirnov, L.J. Swenson, M.H. Volkmann, J. Whittaker, J. Yao, E. Ladizinsky, M.W. Johnson, J. Hilton, and M.H. Amin, \u201cObservation of topological phenomena in a programmable lattice of 1,800 qubits,\u201d Nature, vol.560, no.7719, pp.456-460, Aug. 2018. 10.1038\/s41586-018-0410-x","DOI":"10.1038\/s41586-018-0410-x"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] D. Eppstein, \u201cFinding Large Clique Minors is Hard,\u201d Journal of Graph Algorithms and Applications, vol.13, no.2, pp.197-204, 2009. 10.7155\/jgaa.00183","DOI":"10.7155\/jgaa.00183"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] T. Boothby, A.D. King, and A. Roy, \u201cFast clique minor generation in Chimera qubit connectivity graphs,\u201d Quantum Information Processing, vol.15, no.1, pp.495-508, Jan. 2016. 10.1007\/s11128-015-1150-6","DOI":"10.1007\/s11128-015-1150-6"},{"key":"23","unstructured":"[24] T.S.M. Collection, \u201cAg-monien graph collection.\u201d https:\/\/sparse.tamu.edu\/AG-Monien"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[25] R. Marto\u0148\u00e1k, G.E. Santoro, and E. Tosatti, \u201cQuantum annealing of the traveling-salesman problem,\u201d Physical Review E, vol.70, no.5, pp.1-4, 2004. 10.1103\/physreve.70.057701","DOI":"10.1103\/PhysRevE.70.057701"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[26] K.E. Hamilton and T.S. Humble, \u201cIdentifying the minor set cover of dense connected bipartite graphs via random matching edge sets,\u201d Quantum Information Processing, vol.16, no.4, pp.1-17, 2017. 10.1007\/s11128-016-1513-7","DOI":"10.1007\/s11128-016-1513-7"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E102.D\/9\/E102.D_2018EDP7411\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T03:27:40Z","timestamp":1567826860000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E102.D\/9\/E102.D_2018EDP7411\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,1]]},"references-count":25,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2018edp7411","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,1]]}}}