{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T02:40:03Z","timestamp":1780368003955,"version":"3.54.1"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Department of Science and Technology, Government of India"},{"name":"Austrian Agency for International Cooperation in Education and Research"},{"name":"LIT Secure and Correct System Lab"},{"name":"State of Upper Austria"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1109\/tcad.2019.2962753","type":"journal-article","created":{"date-parts":[[2019,12,27]],"date-time":"2019-12-27T20:56:55Z","timestamp":1577480215000},"page":"2375-2383","source":"Crossref","is-referenced-by-count":36,"title":["Improved Mapping of Quantum Circuits to IBM QX Architectures"],"prefix":"10.1109","volume":"39","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-1089-3263","authenticated-orcid":false,"given":"Stefan","family":"Hillmich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1191-998X","authenticated-orcid":false,"given":"Kamalika","family":"Datta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4993-7860","authenticated-orcid":false,"given":"Robert","family":"Wille","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5438-6653","authenticated-orcid":false,"given":"Indranil","family":"Sengupta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref38","author":"roetteler","year":"2019","journal-title":"Reversible Logic Synthesis and Quantum computing Benchmarks"},{"key":"ref33","article-title":"Open quantum assembly language","author":"cross","year":"2017","journal-title":"arXiv preprint arXiv 1707 03374"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462177"},{"key":"ref31","article-title":"Scaffold: Quantum programming language","author":"abhari","year":"2012"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317859"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2597917.2597939"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2008.43"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/368996.369016"},{"key":"ref34","year":"2019","journal-title":"IBM QX backend information"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2011.54"},{"key":"ref11","article-title":"Representation of quantum circuits with Clifford and ?\/8 gates","author":"matsumoto","year":"2008","journal-title":"arXiv preprint arXiv 0806 3834"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"ref13","article-title":"NISQ circuit compilers: Search space structure and heuristics","author":"paler","year":"2018","journal-title":"arXiv preprint arXiv 1806 07241"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2693284"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2014.2356463"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2015.7059001"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2016.7428026"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488785"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-013-0601-1"},{"key":"ref28","first-page":"113","article-title":"Qubit allocation","author":"siraichi","year":"2018","journal-title":"Proc Int Symp Code Generation Optim"},{"key":"ref4","author":"nielsen","year":"2000","journal-title":"Quantum Computation and Quantum Information"},{"key":"ref27","year":"2019","journal-title":"QISKIT Python SDK"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1021\/acs.chemrev.8b00803"},{"key":"ref6","year":"2019","journal-title":"IBM Q"},{"key":"ref29","first-page":"138","article-title":"On the complexity of quantum circuit compilation","author":"botea","year":"2018","journal-title":"Proc 6th Int Symp Comb Search"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1618020114"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2244643"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/VLSID.2017.11"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2013.6509587"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29517-1_8"},{"key":"ref22","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":"Quant Inf Comput"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-010-0201-2"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3287624.3287704"},{"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.1109\/TCAD.2018.2846658"},{"key":"ref25","first-page":"680","article-title":"Optimization of circuits for IBM’s five-qubit quantum computers","author":"dueck","year":"2018","journal-title":"Proc Euromicro Conf Digit Syst Design"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/43\/9204502\/08944286.pdf?arnumber=8944286","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:05:09Z","timestamp":1651068309000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8944286\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10]]},"references-count":38,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2019.2962753","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10]]}}}