{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T18:13:10Z","timestamp":1775326390338,"version":"3.50.1"},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.23919\/date.2017.7927035","type":"proceedings-article","created":{"date-parts":[[2017,5,15]],"date-time":"2017-05-15T20:34:41Z","timestamp":1494880481000},"page":"470-475","source":"Crossref","is-referenced-by-count":30,"title":["Design automation and design space exploration for quantum computers"],"prefix":"10.23919","author":[{"given":"Mathias","family":"Soeken","sequence":"first","affiliation":[]},{"given":"Martin","family":"Roetteler","sequence":"additional","affiliation":[]},{"given":"Nathan","family":"Wiebe","sequence":"additional","affiliation":[]},{"given":"Giovanni","family":"De Micheli","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.150502"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.109.050505"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"134","DOI":"10.26421\/QIC16.1-2-9","article-title":"Quantum arithmetic and numerical analysis using Repeat-Until-Success circuits","volume":"16","author":"wiebe","year":"2016","journal-title":"Quantum Information and Communication"},{"key":"ref13","author":"bhaskar","year":"2015","journal-title":"Quantum algorithms and circuits for scientific computing"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1963.263531"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2017.7858312"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1147\/rd.176.0525"},{"key":"ref17","first-page":"41","article-title":"Embedding of large Boolean functions for reversible logic","volume":"12","author":"soeken","year":"2016","journal-title":"Journal of Emerging Technology in Computer Systems"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1109\/TCAD.2009.2017215","article-title":"Exact multiple-control Toffoli network synthesis with SAT techniques","volume":"28","author":"gro\u00dfe","year":"2009","journal-title":"IEEE Trans on CAD of Int Circ and Syst"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837440"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2244643"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.6.031007"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1278349.1278355"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/775832.775915"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2898107"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-40578-0_22","article-title":"A fast symbolic transformation based algorithm for reversible logic synthesis","author":"soeken","year":"2016","journal-title":"Int'l Conf on Reversible Computation"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/nature18318"},{"key":"ref9","first-page":"377","volume":"1510","author":"parent","year":"2015","journal-title":"Reversible circuit compilation with space constraints"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/nature18648"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/978-3-642-14295-6_5","article-title":"ABC: an academic industrial-strength verification tool","author":"brayton","year":"2010","journal-title":"Computer Aided Verification"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2593069.2593158"},{"key":"ref21","article-title":"Fast heuristic minimization of exclusive sum-of-products","author":"mishchenko","year":"2001","journal-title":"Int'l Reed-Muller Workshop"},{"key":"ref24","first-page":"1241","volume":"1609","author":"thapliyal","year":"2016","journal-title":"Quantum circuit design of integer division optimizing ancillary qubits and T-count"},{"key":"ref23","first-page":"55","article-title":"RevKit: A toolkit for reversible circuit design","volume":"18","author":"soeken","year":"2012","journal-title":"Multiple-Valued Logic and Soft Computing"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.93.022311"},{"key":"ref25","author":"cuccaro","year":"2004","journal-title":"A New Quantum Ripple-Carry Addition Circuit"}],"event":{"name":"2017 Design, Automation & Test in Europe Conference & Exhibition (DATE)","location":"Lausanne, Switzerland","start":{"date-parts":[[2017,3,27]]},"end":{"date-parts":[[2017,3,31]]}},"container-title":["Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7919927\/7926947\/07927035.pdf?arnumber=7927035","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:27:42Z","timestamp":1750264062000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7927035\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3]]},"references-count":27,"URL":"https:\/\/doi.org\/10.23919\/date.2017.7927035","relation":{},"subject":[],"published":{"date-parts":[[2017,3]]}}}