BIRS Workshop Lecture Videos

Banff International Research Station Logo

BIRS Workshop Lecture Videos

Garbage collection for reversible circuit compilation Parent, Alex


When compiling high level programs into reversible circuits in a space efficient way it is desirable to allow for intermediate cleanup and ancilla reuse. We present a cleanup method based on tracking data dependencies and mutation within a program. Tracking is done using a representation that we call a "Mutable Dependency Diagram" (MDD). Using this representation we present an algorithm for intermediate (eager) cleanup. An incremental cleanup strategy related to Bennett's pebble game will also be presented. The MDD representation using the eager cleanup strategy has been implemented as a reversible circuit compiler (REVS). Numerical results based on this implementation will be discussed.

Item Media

Item Citations and Data


Attribution-NonCommercial-NoDerivatives 4.0 International