HackerPapers

arXiv:1110.2574cs.ET

Synthesis and Optimization of Reversible Circuits - A Survey

Mehdi Saeedi, Igor L. Markov

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

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.

arXiv comments
34 pages, 15 figures, 2 tables
Journal reference
M. Saeedi and I. L. Markov, "Synthesis and Optimization of Reversible Circuits - A Survey", ACM Computing Surveys, 45, 2, Article 21 (34 pages), 2013
DOI
doi:10.1145/2431211.2431220
Subjects
cs.ETEmerging Technologies quant-phQuantum Physics

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Oct 2017 to Oct 2017.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Quantum computations are a case of reversible computations. If you're aiming to relate qantum computers to other kinds of computers, I suggest starting with the paper called "Synthesis and Optimization of Reversible Circuits - A Survey" [0] It describes the kinds of computations…

      rhn_mk1View on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.