{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T13:05:18Z","timestamp":1762607118078,"version":"3.37.3"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2018,5,1]]},"DOI":"10.1109\/tc.2017.2775618","type":"journal-article","created":{"date-parts":[[2017,11,22]],"date-time":"2017-11-22T19:23:31Z","timestamp":1511378611000},"page":"604-616","source":"Crossref","is-referenced-by-count":20,"title":["Advancing CMOS-Type Ising Arithmetic Unit into the Domain of Real-World Applications"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8353-6243","authenticated-orcid":false,"given":"Jian","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4441-2202","authenticated-orcid":false,"given":"Shuming","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yaohua","family":"Wang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1126\/science.aah5178"},{"key":"ref10","first-page":"1","article-title":"Experimental evaluation of an adiabatic quantum system for combinatorial optimization","author":"mcgeoch","year":"0","journal-title":"Proc ACM Int Conf Comput Frontiers"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.2172\/1459086","article-title":"Benchmarking adiabatic quantum optimization for complex network analysis","author":"parekh","year":"2015"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1126\/science.aah4243"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/NEWCAS.2016.7604797"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CANDAR.2016.0081"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ECCTD.2013.6662276"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1109\/JSSC.2015.2498601","article-title":"A 20k-spin Ising chip to solve combinatorial optimization problems with CMOS annealing\n solid-state circuits","volume":"51","author":"yamaoka","year":"2016","journal-title":"IEEE J Solid-State Circuits"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.15803\/ijnc.6.2_195"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1049\/el.2016.2218"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383047"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2009.2013851"},{"article-title":"Image\n recognition with an adiabatic quantum computer I. Mapping to quadratic unconstrained binary optimization","year":"2008","author":"neven","key":"ref4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.bspc.2012.04.005"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1038\/srep16213","article-title":"Uncertain behaviours of integrated circuits\n improve computational performance","volume":"5","author":"yoshimura","year":"2015","journal-title":"Sci Rep"},{"article-title":"A near-term quantum computing approach for hard computational problems in space\n exploration","year":"2012","author":"smelyanskiy","key":"ref6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1186\/1475-925X-10-30"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1140\/epjst\/e2015-02347-y"},{"key":"ref8","article-title":"Quantum optimization of fully-connected spin glasses","volume":"5","author":"venturelli","year":"2014","journal-title":"Phys Rev X"},{"key":"ref7","first-page":"2337","article-title":"Parametrized families of hard planning problems from phase transitions","author":"rieffel","year":"0","journal-title":"Proc 28th AAAI Conf Artif Intell"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISSCC.2015.7063111"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TASC.2014.2318294"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2014.00005"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cpc.2015.02.015"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1262177"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/34.969114"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.222"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/1015706.1015720","article-title":"GrabCut: Interactive foreground extraction using iterated graph cuts","volume":"23","author":"rother","year":"2004","journal-title":"ACM Trans Graphics"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995344"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206596"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/8332063\/08118124.pdf?arnumber=8118124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T08:29:36Z","timestamp":1643185776000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8118124\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,1]]},"references-count":30,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tc.2017.2775618","relation":{},"ISSN":["0018-9340"],"issn-type":[{"type":"print","value":"0018-9340"}],"subject":[],"published":{"date-parts":[[2018,5,1]]}}}