{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T00:56:26Z","timestamp":1768524986539,"version":"3.49.0"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2018YFA0306704"],"award-info":[{"award-number":["2018YFA0306704"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP180100691"],"award-info":[{"award-number":["DP180100691"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2021,11,1]]},"DOI":"10.1109\/tc.2020.3023247","type":"journal-article","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T20:53:36Z","timestamp":1599771216000},"page":"1777-1788","source":"Crossref","is-referenced-by-count":43,"title":["Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3332-2546","authenticated-orcid":false,"given":"Sanjiang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3244-6675","authenticated-orcid":false,"given":"Xiangzhen","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3097-3896","authenticated-orcid":false,"given":"Yuan","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-010-0201-2"},{"key":"ref11","first-page":"113","article-title":"Qubit allocation","author":"siraichi","year":"2018","journal-title":"Proc Int Symp Code Generation Optim"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aaa331"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304075"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2018.8342181"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304023"},{"key":"ref16","first-page":"3:1","article-title":"Circuit transformations for quantum architectures","author":"childs","year":"2019","journal-title":"Proc 14th Conf Theory Quantum Comput Commun Cryptography"},{"key":"ref17","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":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.2969647"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3338852.3339829"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-019-1666-5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/nature23474"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2244643"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.22331\/q-2019-05-13-140"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2013.6509587"},{"key":"ref7","article-title":"Representation of quantum circuits with clifford and $\\pi \/8$?\/8 gates","author":"matsumoto","year":"2008"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.150502"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.917562"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58691-1_68"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","article-title":"Elementary gates for quantum computation","volume":"52","author":"barenco","year":"1995","journal-title":"Physical Rev A"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1002\/9781118648919"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.318.13"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.2562110"},{"key":"ref26","article-title":"Using spectral graph theory to map qubits onto connectivity-limited devices","author":"lin","year":"2019"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3360546"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/9562753\/09194320.pdf?arnumber=9194320","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T21:10:08Z","timestamp":1642453808000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9194320\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,1]]},"references-count":26,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tc.2020.3023247","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,11,1]]}}}