{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:14:59Z","timestamp":1781892899261,"version":"3.54.5"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T00:00:00Z","timestamp":1412121600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Intelligence Advanced Research Projects Activity through the Department of Interior National Business Center","award":["DllPC20l66"],"award-info":[{"award-number":["DllPC20l66"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Canada\u2019s NSERC, MPrime, CIFAR, and CFI"},{"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":[[2014,10]]},"DOI":"10.1109\/tcad.2014.2341953","type":"journal-article","created":{"date-parts":[[2014,9,16]],"date-time":"2014-09-16T21:12:19Z","timestamp":1410901939000},"page":"1476-1489","source":"Crossref","is-referenced-by-count":219,"title":["Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning"],"prefix":"10.1109","volume":"33","author":[{"given":"Matthew","family":"Amy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dmitri","family":"Maslov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michele","family":"Mosca","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.2307\/2371182"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.147"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.80.054302"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.86.100506"},{"key":"ref31","first-page":"282","article-title":"Optimal synthesis of linear reversible circuits","volume":"8","author":"patel","year":"2008","journal-title":"Quantum Inf Comput"},{"key":"ref30","author":"nielsen","year":"2000","journal-title":"Quantum Computation and Quantum Information"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.052320"},{"key":"ref36","first-page":"872","article-title":"Quantum addition circuits and unbounded fan-out","volume":"10","author":"takahashi","year":"2010","journal-title":"Quantum Inf Comput"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.042302"},{"key":"ref10","author":"cuccaro","year":"2004","journal-title":"A New Quantum Ripple-Carry Addition Circuit"},{"key":"ref11","first-page":"102","article-title":"Quantum computing and polynomial equations over the finite field $\\mathbb {Z}_{2}$","volume":"5","author":"dawson","year":"2005","journal-title":"Quantum Inf Comput"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100021162"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.51.1015"},{"key":"ref14","first-page":"351","article-title":"A logarithmic-depth quantum carry-lookahead adder","volume":"6","author":"draper","year":"2006","journal-title":"Quantum Inf Comput"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.6028\/jres.069B.004"},{"key":"ref16","author":"fowler","year":"2012","journal-title":"Time Optimal Quantum Computation"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.80.052312"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.108.180501"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.57.127"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.911334"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44678-8_4"},{"key":"ref27","author":"maslov","year":"2013","journal-title":"Reversible logic synthesis benchmarks page"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/nature10981"},{"key":"ref29","first-page":"610","article-title":"An $O(m^{2})$ -depth quantum algorithm for the elliptic curve discrete logarithm problem over GF $(2^{m})$","volume":"9","author":"maslov","year":"2009","journal-title":"Quantum Inf Comput"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.2.021004"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.022316"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.84.030303"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2244643"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.109.060501"},{"key":"ref1","first-page":"97","article-title":"Quantum accuracy threshold for concatenated distance-3 codes","volume":"6","author":"aliferis","year":"2006","journal-title":"Quantum Inf Comput"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1038\/46503","article-title":"Quantum teleportation is a universal computational primitive","volume":"402","author":"gottesman","year":"1999","journal-title":"Nature"},{"key":"ref22","year":"2013","journal-title":"IARPA Quantum Computer Science Program"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1126\/science.273.5278.1073"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.88.052307"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.76.052310"},{"key":"ref25","first-page":"361","article-title":"Constant-optimized quantum circuits for modular multiplication and exponentiation","volume":"12","author":"markov","year":"2012","journal-title":"Quantum Inf Comput"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/43\/6899718\/06899791.pdf?arnumber=6899791","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:52:07Z","timestamp":1641988327000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6899791"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":39,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2014.2341953","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10]]}}}