{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T02:04:29Z","timestamp":1780711469806,"version":"3.54.1"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Department of Science and Technology, Government of India, for the Project \u201cEfficient Multidimensional Qubit Placement in Quantum Circuits,\u201d","award":["YSS\/2015\/001461"],"award-info":[{"award-number":["YSS\/2015\/001461"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1109\/tcad.2017.2693284","type":"journal-article","created":{"date-parts":[[2017,4,18]],"date-time":"2017-04-18T21:44:30Z","timestamp":1492551870000},"page":"182-192","source":"Crossref","is-referenced-by-count":64,"title":["A New Heuristic for $N$ -Dimensional Nearest Neighbor Realization of a Quantum Circuit"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2300-267X","authenticated-orcid":false,"given":"Abhoy","family":"Kole","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2746-1125","authenticated-orcid":false,"given":"Kamalika","family":"Datta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Indranil","family":"Sengupta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2011.54"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2009.19"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1038\/nature05896"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-013-0601-1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JETCAS.2016.2528720"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-010-0201-2"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488785"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.79.1217"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2014.6742940"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2015.7059001"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.04.038"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/iNIS.2015.59"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2016.7428026"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF01857727"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms7979"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1126\/science.1231298"},{"key":"ref6","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1038\/nature16186"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2014.2315641"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2014.2356463"},{"key":"ref7","first-page":"142","article-title":"An efficient conversion of quantum circuits to a linear nearest neighbor architecture","volume":"11","author":"hirata","year":"2011","journal-title":"Quantum Inf Comput"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/nature04279"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2014.6742939"},{"key":"ref1","author":"nielsen","year":"2000","journal-title":"Quantum Computation and Quantum Information"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2014.2337302"},{"key":"ref22","first-page":"1","article-title":"Cost reduction in nearest neighbour based synthesis of quantum Boolean circuits","volume":"16","author":"khan","year":"2008","journal-title":"Eng Lett"},{"key":"ref21","first-page":"356","article-title":"Nearest neighbour based synthesis of quantum Boolean circuits","volume":"15","author":"chakrabarti","year":"2007","journal-title":"Eng Lett"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-013-0642-5"},{"key":"ref23","first-page":"71","article-title":"Synthesis of quantum circuits in linear nearest neighbor model using positive davio lattices","volume":"24","author":"perkowski","year":"2012","journal-title":"Electron Energy"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29517-1_8"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20860-2_18"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/43\/8231808\/07896587.pdf?arnumber=7896587","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:24:58Z","timestamp":1642004698000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7896587\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":32,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2017.2693284","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}