Design automation for adiabatic circuits

Abstract

Adiabatic circuits are heavily investigated since they allow for computations with an asymptotically close to zero energy dissipation per operation-serving as an alternative technology for many scenarios where energy efficiency is preferred over fast execution. eir concepts are motivated by the fact that the information lost from conventional circuits results in an entropy increase which causes energy dissipation. To overcome this issue, computations are performed in a (conditionally) reversible fashion which, additionally, have to satisfy switching rules that are different from conventional circuitry-crying out for dedicated design automation solutions. While previous approaches either focus on their electrical realization (resulting in small, hand-cra ed circuits only) or on designing fully reversible building blocks (an unnecessary overhead), this work aims for providing an automatic and dedicated design scheme that explicitly takes the recent findings in this domain into account. To this end, we review the theoretical and technical background of adiabatic circuits and present automated methods that dedicatedly realize the desired function as an adiabatic circuit. e resulting methods are further optimized-leading to an automatic and efficient design automation for this promising technology. Evaluations confirm the benefits and applicability of the proposed solution.

Principles of Low Dissipation Computing from a Stochastic Circuit Model

“…This then raises the question of how to further decrease the irreversible dissipation and that associated with charging the gates. This problem is the crux of optimal control theory, and adiabatic circuit design, 61,62 from which some design principles can be borrowed. For example, while we have kept the input voltage of the transistors V in fixed within each cycle, one can design optimal feedback protocol that controls it according to the state of the capacitor, in order to minimize the irreversible dissipation throughout the process.…”

Quantum Foundations of Classical Reversible Computing

“…This class of implementation technologies for reversible computing refers to a logic design discipline based on ordinary CMOS (complementary metal-oxide-semiconductor) field-effect transistors [48,[91][92][93][94][95][96]. To approach physical reversibility in these types of circuits requires several conditions to be met (see Appendix A for some key derivations):…”

Quantum Foundations of Classical Reversible Computing

“…Thus, P A and Q provide a decomposition of every A ∈ B(H S ). (67) also provides a definition of the four corners projection superoperators P ,P ,P ,P , which act on A as indicated. ( 66) and ( 67) serve as the foundation for examining the properties of GKSL systems with multiple asymptotic states, as well as the geometric properties of their quantum state spaces.…”

“…This class of implementation technologies for reversible computing refers to a logic design discipline based on ordinary CMOS (complementary metal-oxide-semiconductor) field-effect transistors [30,[63][64][65][66][67][68]. To approach physical reversibility in these types of circuits requires several conditions to be met (see Appendix A for some key derivations):…”