Title	Garbage collection for reversible circuit compilation
Creator	Parent, Alex
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2016-04-18T15:31
Description	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.
Extent	19 minutes
Subject	Mathematics; Quantum theory; Information and communication, circuits; Theoretical computer science
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of Waterloo
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2016-10-18
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0319172
URI	http://hdl.handle.net/2429/59482
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Graduate
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos

Garbage collection for reversible circuit compilation Parent, Alex

Description

Item Metadata

Item Media

Item Citations and Data

Rights