{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T04:44:55Z","timestamp":1772599495190,"version":"3.50.1"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Canada\u2019s NSERC"},{"DOI":"10.13039\/501100000023","name":"Government of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000023","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Province of Ontario"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1109\/tcad.2022.3213210","type":"journal-article","created":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T20:12:45Z","timestamp":1665432765000},"page":"1873-1884","source":"Crossref","is-referenced-by-count":24,"title":["Reducing the CNOT Count for Clifford+T Circuits on NISQ Architectures"],"prefix":"10.1109","volume":"42","author":[{"given":"Vlad","family":"Gheorghiu","sequence":"first","affiliation":[{"name":"Institute for Quantum Computing, University of Waterloo, Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4036-3741","authenticated-orcid":false,"given":"Jiaxin","family":"Huang","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics, University of Waterloo, Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarah Meng","family":"Li","sequence":"additional","affiliation":[{"name":"Institute for Quantum Computing and the Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Mosca","sequence":"additional","affiliation":[{"name":"Institute for Quantum Computing, University of Waterloo, Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6463-9100","authenticated-orcid":false,"given":"Priyanka","family":"Mukhopadhyay","sequence":"additional","affiliation":[{"name":"Institute for Quantum Computing and the Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aad8ca"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/2432622.2432628"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.26421\/QIC20.7-8-4"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480101393155"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2014.2341953"},{"key":"ref59","article-title":"Reducing the CNOT count for Clifford+T circuits on NISQ architectures","author":"gheorghiu","year":"2020","journal-title":"arXiv 2011 12191"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.26421\/QIC8.3-4-4"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-144"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.26421\/QIC17.13-14-1"},{"key":"ref52","first-page":"102","article-title":"Quantum computing and polynomial equations over the finite field ??","volume":"5","author":"dawson","year":"2005","journal-title":"Quantum Inf Comput"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1088\/2058-9565\/ab79b1","article-title":"Quantum circuit optimizations for NISQ architectures","volume":"5","author":"nash","year":"2020","journal-title":"Quantum Sci Technol"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230220105"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1063\/1.2164910"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref17","author":"anis","year":"2021","journal-title":"Qiskit An open-source framework for quantum computing"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-52482-1_11"},{"key":"ref19","first-page":"419","article-title":"Transformation rules for designing CNOT-based quantum circuits","author":"iwama","year":"2002","journal-title":"Proc 39th Annu Des Autom Conf"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab8e92"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8121\/aa565f"},{"key":"ref50","article-title":"Efficient CNOT synthesis for NISQ devices","author":"tang","year":"2020","journal-title":"arXiv 2011 06760"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/abe665"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2019.02.005"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-14082-3_18"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1142\/S0219749918400063"},{"key":"ref42","article-title":"On the qubit routing problem","author":"cowtan","year":"2019","journal-title":"arXiv 1902 08091"},{"key":"ref41","first-page":"113","article-title":"Qubit allocation","author":"siraichi","year":"2018","journal-title":"Proc Int Symp Code Generation Optim"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aaa331"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317859"},{"key":"ref49","article-title":"Optimization of CNOT circuits under topological constraints","author":"wu","year":"2019","journal-title":"arXiv 1910 14478"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.117.060504"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1038\/nature10981"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.117.060505"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-08-06-79"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.79.325"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevApplied.8.034021"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.aao3603"},{"key":"ref40","article-title":"Depth-optimal quantum circuit placement for arbitrary topologies","author":"bhattacharjee","year":"2017","journal-title":"arXiv 1703 08540"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.26421\/QIC17.13-14-2"},{"key":"ref34","article-title":"Synthesis of linear nearest neighbor quantum circuits","author":"rahman","year":"2015","journal-title":"arXiv 1508 05430"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2015.7059001"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2014.6742940"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-010-0201-2"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.26421\/QIC11.1-2-10"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488785"},{"key":"ref32","article-title":"Linear nearest neighbor synthesis of reversible circuits by graph partitioning","author":"chakrabarti","year":"2011","journal-title":"arXiv 1112 0564"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02650179"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598347011"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2846658"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-017-1662-3"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304023"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/16\/3\/033040"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2016.7428026"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/MCAS.2016.2549950"},{"key":"ref20","first-page":"353","article-title":"Reversible logic circuit synthesis","author":"shende","year":"2002","journal-title":"Proc IEEE\/ACM Int Conf Comput -Aided Des"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139814782"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.26421\/QIC8.5-6-8"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2019.10.004"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3287624.3287701"},{"key":"ref29","first-page":"89","article-title":"Changing the gate order for optimal LNN conversion","author":"matsuo","year":"2011","journal-title":"Proc Int Workshop Reversible Comput"},{"key":"ref60","author":"frank","year":"1953","journal-title":"Pulse code communication"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/43\/10129269\/09914638.pdf?arnumber=9914638","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T18:12:54Z","timestamp":1686593574000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9914638\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6]]},"references-count":60,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2022.3213210","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6]]}}}