{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T19:20:25Z","timestamp":1768072825671,"version":"3.49.0"},"reference-count":134,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. IEEE"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1109\/jproc.2018.2869760","type":"journal-article","created":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T14:29:34Z","timestamp":1538404174000},"page":"165-184","source":"Crossref","is-referenced-by-count":36,"title":["Logic Synthesis for Established and Emerging Computing"],"prefix":"10.1109","volume":"107","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1114-8476","authenticated-orcid":false,"given":"Eleonora","family":"Testa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0229-8766","authenticated-orcid":false,"given":"Mathias","family":"Soeken","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca Gaetano","family":"Amar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7827-3215","authenticated-orcid":false,"given":"Giovanni","family":"De Micheli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/43.833206"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/12.537122"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/PACRIM.2007.4313212"},{"key":"ref32","first-page":"446","article-title":"A very compact ‘perfectly masked’ S-box for AES","author":"canright","year":"2008","journal-title":"Proc 3rd Int Conf Appl Cryptogr Netw Secur"},{"key":"ref31","first-page":"287","article-title":"A small depth-16 circuit for the AES S-box","author":"boyar","year":"2012","journal-title":"Proc Inf Secur Privacy"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13193-6_16"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/978-1-4899-5327-8_25","article-title":"On the complexity of derivation in propositional calculus","author":"tseitin","year":"1970","journal-title":"Studies in Constructive Mathematics and Mathematical Logic Part 2"},{"key":"ref35","first-page":"244","article-title":"Extending SAT solvers to cryptographic problems","author":"soos","year":"2009","journal-title":"Proc Int Conf Theory Appl Satisfiability Test"},{"key":"ref34","article-title":"Logic synthesis of reversible wave cascades","author":"mishchenko","year":"2002","journal-title":"Proc Int Workshop Logic Synth"},{"key":"ref28","volume":"4","author":"knuth","year":"2015","journal-title":"The Art of Computer Programming Fascicle 6 Satisfiability"},{"key":"ref27","author":"biere","year":"2009","journal-title":"Handbook of Satisfiability"},{"key":"ref29","author":"brown","year":"2012","journal-title":"Boolean Reasoning The Logic of Boolean Equations"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/43.494702"},{"key":"ref22","first-page":"32","article-title":"Finding efficient circuits using SAT-solvers","author":"kojevnikov","year":"2009","journal-title":"Proc Int Conf Theory Appl Satisfiability Testing"},{"key":"ref21","volume":"4a","author":"knuth","year":"2011","journal-title":"The art of computer programming"},{"key":"ref24","article-title":"Exact circuit synthesis","author":"drechsler","year":"1998","journal-title":"Proc Int Workshop Logic Synth"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2664059"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.150502"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"830","DOI":"10.23919\/DATE.2017.7927103","article-title":"Busy man’s synthesis: Combinational delay optimization with SAT","author":"soeken","year":"2017","journal-title":"Proc Design Automat Test Eur"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2017.8203799"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1987.1270347"},{"key":"ref51","article-title":"The decomposition of switching functions","author":"ashenhurst","year":"1957","journal-title":"Proc Int Symp Theory Switching"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/12.35836"},{"key":"ref58","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-1-4615-3154-8_3","article-title":"Logic synthesizers, the transduction method and its extension, Sylon","author":"muroga","year":"1993","journal-title":"Logic Synthesis and Optimization"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.860955"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/43.3211"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2018.2881245"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2506566"},{"key":"ref53","first-page":"15","article-title":"Scalable logic synthesis using a simple circuit structure","author":"mishchenko","year":"2006","journal-title":"Proc Int Workshop Logic Synth"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147048"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/EDAC.1991.206358"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2684746.2689060"},{"key":"ref3","year":"2018","journal-title":"Mentor Graphics Oasys-RTL"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1088\/0957-4484\/4\/1\/004"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1038\/nature23459","article-title":"Programming languages and compiler design for realistic quantum hardware","volume":"549","author":"chong","year":"2017","journal-title":"Nature"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.21236\/ADA082021"},{"key":"ref49","first-page":"49","article-title":"The decomposition and factorization of Boolean expressions","author":"brayton","year":"1982","journal-title":"Proc Int Symp Circuits Syst"},{"key":"ref7","author":"nielsen","year":"2000","journal-title":"Quantum Computation and Quantum Information"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.93.022311"},{"key":"ref46","first-page":"473","article-title":"The Socrates logic synthesis and optimization system","volume":"136","author":"de geus","year":"1987","journal-title":"Design Systems for VLSI Circuits Logic Synthesis and Silicon Compilation"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1147\/rd.254.0272"},{"key":"ref48","article-title":"Developing synthesis flows without human knowledge","author":"yu","year":"2018","journal-title":"Proc Design Automat Conf"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2018.8351885"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1963.263531"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2002.804386"},{"key":"ref44","first-page":"151","article-title":"A novel basis for logic optimization","author":"haaswijk","year":"2017","journal-title":"Proc Asia South Pacific Design Automat Conf"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2593069.2593158"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40578-0_22"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2015.03.002"},{"key":"ref125","doi-asserted-by":"publisher","DOI":"10.1145\/1877745.1877747"},{"key":"ref124","doi-asserted-by":"crossref","first-page":"183","DOI":"10.3934\/amc.2008.2.183","article-title":"Young subgroups for reversible computers","volume":"2","author":"de vos","year":"2008","journal-title":"Adv Math Commun"},{"key":"ref73","doi-asserted-by":"crossref","first-page":"1303","DOI":"10.23919\/DATE.2017.7927194","article-title":"Logic optimization and synthesis: Trends and directions in industry","author":"amar\u00f9","year":"2017","journal-title":"Proc Design Automat Test Eur"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.1996.563527"},{"key":"ref129","doi-asserted-by":"publisher","DOI":"10.1109\/IDT.2010.5724427"},{"key":"ref71","article-title":"Practical SAT—A tutorial on applied satisfiability solving","author":"\u00e9en","year":"2007"},{"key":"ref128","author":"schmitt","year":"2018","journal-title":"Scaling up collapsing into ESOP expressions enables ancilla-free quantum compilation"},{"key":"ref70","article-title":"Optimal combinational multi-level logic synthesis","author":"ernst","year":"2009"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.887925"},{"key":"ref130","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20860-2_20"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/DSD.2014.99"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1145\/296399.296425"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2012.6176724"},{"key":"ref133","doi-asserted-by":"publisher","DOI":"10.1137\/0218053"},{"key":"ref134","first-page":"90","article-title":"REVS: A tool for space-optimized reversible circuit synthesis","author":"parent","year":"2017","journal-title":"Proc Int Conf Reversible Comput"},{"key":"ref131","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2898107"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.888267"},{"key":"ref132","doi-asserted-by":"crossref","first-page":"470","DOI":"10.23919\/DATE.2017.7927035","article-title":"Design automation and design space exploration for quantum computers","author":"soeken","year":"2017","journal-title":"Proc Design Automat Test Eur"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/ISVLSI.2017.37"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2002.1013899"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1997.643255"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/43.277607"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2005.264"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/41.19078"},{"key":"ref65","article-title":"Redundancy identification and removal","author":"bryan","year":"1991","journal-title":"Proc IWLS"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/12.795224"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/43.469659"},{"key":"ref68","article-title":"The EPFL combinational benchmark suite","author":"amar\u00f9","year":"2015","journal-title":"Proc Int Workshop Logic Synth"},{"key":"ref2","year":"2018","journal-title":"Cadence Genus Synthesis Solution"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/43.273754"},{"key":"ref1","year":"2018","journal-title":"Synopsys Design Compiler Graphical"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-018-0072-4"},{"key":"ref95","first-page":"15","article-title":"Inversion optimization in majority-inverter graphs","author":"testa","year":"2016","journal-title":"Proc Int Symp Nanoscale Archit"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.88.012313"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1109\/TNANO.2003.820815"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1063\/1.4927100"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijleo.2016.06.034"},{"key":"ref106","author":"kliuchnikov","year":"2015","journal-title":"A framework for exact synthesis"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1016\/j.mejo.2015.03.016"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1145\/3061639.3062261"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1016\/j.mejo.2010.07.003"},{"key":"ref104","author":"markov","year":"2018","journal-title":"Quantum supremacy is both closer and farther than it appears"},{"key":"ref90","first-page":"1818","article-title":"Logical devices implemented using quantum cellular automata","volume":"75","author":"tougaw","year":"1993","journal-title":"Appl Phys Lett"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1618020114"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1140\/epjqt10"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aad604"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2014.2341953"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/aa5e47"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"ref99","first-page":"1473","article-title":"A tale of two sieves","volume":"43","author":"pomerance","year":"1996","journal-title":"Notices AMS"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1964.263829"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2016.21"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2488484"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2460377"},{"key":"ref12","author":"de micheli","year":"1994","journal-title":"Synthesis and Optimization of Digital Circuits"},{"key":"ref13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-2821-6","volume":"2","author":"brayton","year":"1984","journal-title":"Logic Minimization Algorithms for VLSI Synthesis"},{"key":"ref14","author":"hachtel","year":"2006","journal-title":"Logic Synthesis and Verification Algorithms"},{"key":"ref15","volume":"654","author":"hassoun","year":"2012","journal-title":"Logic Synthesis and Verification"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1956.tb03835.x"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2018.8297386"},{"key":"ref117","doi-asserted-by":"publisher","DOI":"10.1145\/2431211.2431220"},{"key":"ref17","article-title":"Logic synthesis for VLSI design","author":"rudell","year":"1989"},{"key":"ref81","first-page":"1","article-title":"Versatile SAT-based remapping for standard cells","author":"mishchenko","year":"2016","journal-title":"Proc Int Workshop Logic Synth"},{"key":"ref18","author":"weste","year":"1993","journal-title":"Principles of CMOS VLSI Design"},{"key":"ref84","first-page":"686","article-title":"Design and benchmarking of hybrid CMOS-spin wave device circuits compared to 10 nm CMOS","author":"zografos","year":"2015","journal-title":"Proc Int Conf Nanotechnol"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2016.33"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5139-3"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/TNANO.2002.807380"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aadd1a"},{"key":"ref113","article-title":"An efficient methodology for mapping quantum circuits to the IBM QX architectures","author":"zulehner","year":"2018"},{"key":"ref116","author":"chao","year":"2017","journal-title":"Fault-tolerant quantum computation with few qubits"},{"key":"ref80","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":"ref115","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/14\/12\/123011"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.1145\/775832.775915"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1109\/5.573740"},{"key":"ref121","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.811448"},{"key":"ref122","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1629984"},{"key":"ref123","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2012.6165069"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/LED.2011.2156379"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-17954-2"},{"key":"ref87","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1038\/nature01937","article-title":"Surface plasmon subwavelength optics","volume":"424","author":"barnes","year":"2003","journal-title":"Nature"},{"key":"ref88","article-title":"Exact synthesis for logic synthesis applications with complex constraints","author":"testa","year":"2017","journal-title":"Proc Int Workshop Logic Synth"}],"container-title":["Proceedings of the IEEE"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5\/8589029\/08478240.pdf?arnumber=8478240","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T21:31:24Z","timestamp":1761082284000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8478240\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":134,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/jproc.2018.2869760","relation":{},"ISSN":["0018-9219","1558-2256"],"issn-type":[{"value":"0018-9219","type":"print"},{"value":"1558-2256","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}