Synthesis and optimization of reversible circuits -- a survey

From MaRDI portal
Publication:2875110

DOI10.1145/2431211.2431220zbMATH Open1293.94141arXiv1110.2574OpenAlexW2114638353MaRDI QIDQ2875110FDOQ2875110


Authors: Mehdi Saeedi, Igor L. Markov Edit this on Wikidata


Publication date: 13 August 2014

Published in: ACM Computing Surveys (Search for Journal in Brave)

Abstract: Reversible logic circuits have been historically motivated by theoretical research in low-power electronics as well as practical improvement of bit-manipulation transforms in cryptography and computer graphics. Recently, reversible circuits have attracted interest as components of quantum algorithms, as well as in photonic and nano-computing technologies where some switching devices offer no signal gain. Research in generating reversible logic distinguishes between circuit synthesis, post-synthesis optimization, and technology mapping. In this survey, we review algorithmic paradigms --- search-based, cycle-based, transformation-based, and BDD-based --- as well as specific algorithms for reversible synthesis, both exact and heuristic. We conclude the survey by outlining key open challenges in synthesis of reversible and quantum logic, as well as most common misconceptions.


Full work available at URL: https://arxiv.org/abs/1110.2574




Recommendations





Cited In (62)





This page was built for publication: Synthesis and optimization of reversible circuits -- a survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875110)