{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T10:14:00Z","timestamp":1775384040927,"version":"3.50.1"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Center for Domain-Specific Computing Industrial Partnership Program"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2021,9,1]]},"DOI":"10.1109\/tc.2020.3009140","type":"journal-article","created":{"date-parts":[[2020,7,14]],"date-time":"2020-07-14T20:57:27Z","timestamp":1594760247000},"page":"1363-1373","source":"Crossref","is-referenced-by-count":74,"title":["Optimality Study of Existing Quantum Computing Layout Synthesis Tools"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9711-2441","authenticated-orcid":false,"given":"Bochen","family":"Tan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2887-6963","authenticated-orcid":false,"given":"Jason","family":"Cong","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"138","article-title":"On the complexity of quantum circuit compilation","author":"botea","year":"2018","journal-title":"Proc 11th Annu Symp Combinatorial Search"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2008.43"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304023"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304007"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2019.2962753"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3287624.3287704"},{"key":"ref37","article-title":"A quantum approximate optimization algorithm","author":"farhi","year":"0"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317888"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3307650.3322273"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304075"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-018-0072-4"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1242531.1242546"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.917562"},{"key":"ref13","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":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488785"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2014.6742940"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JETCAS.2016.2528720"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2693284"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2014.6742939"},{"key":"ref19","first-page":"113","article-title":"Qubit allocation","author":"siraichi","year":"2018","journal-title":"Proc Int Symp Code Generation Optim"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aaa331"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2018.8342181"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/620"},{"key":"ref3","article-title":"Cramming more power into a quantum device","author":"gambetta","year":"2019"},{"key":"ref6","article-title":"Huge opportunity’ in IC design optimization gained by Semiconductor Research Corporation","year":"2007"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1609\/icaps.v28i1.13920","article-title":"Comparing and integrating constraint programming and temporal planning for quantum circuit compilation","author":"booth","year":"2018","journal-title":"Proc 28th Int Conf Automated Planning Scheduling"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.825870"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813870"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.811448"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667"},{"key":"ref9","article-title":"Open quantum assembly language","author":"cross","year":"0"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-019-1666-5"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.TQC.2019.3"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317859"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3287624.3287701"},{"key":"ref24","first-page":"5:1","article-title":"On the qubit routing problem","author":"cowtan","year":"2019","journal-title":"Proc 14th Conf Theory Quantum Comput Commun Cryptogr"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3360546"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2015.7059001"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD45719.2019.8942132"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/9508207\/09140293.pdf?arnumber=9140293","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T19:56:54Z","timestamp":1667419014000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9140293\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,1]]},"references-count":39,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tc.2020.3009140","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"value":"0018-9340","type":"print"},{"value":"1557-9956","type":"electronic"},{"value":"2326-3814","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,1]]}}}