The Compilation of Reversible Circuits and a New Optimization Game
| dc.contributor.author | Parent, Alex | |
| dc.date.accessioned | 2016-09-28T16:55:39Z | |
| dc.date.available | 2017-01-27T05:50:09Z | |
| dc.date.issued | 2016-09-28 | |
| dc.date.submitted | 2016-09-27 | |
| dc.description.abstract | The focus of this thesis is reversible circuit compilation. We will explore the use of pebble games for circuit analysis. The usefulness of this technique is demonstrated by finding a new space bound for the Karatsuba algorithm and more generally for any similar algorithm based on recurrence relations. A new pebble game based on the reversible pebble game which better captures the use of in-place operations is also presented. We also construct circuit to compute trigonometric functions based on the CORDIC algorithm and analyze it using this game. | en |
| dc.identifier.uri | http://hdl.handle.net/10012/10949 | |
| dc.language.iso | en | en |
| dc.pending | false | |
| dc.publisher | University of Waterloo | en |
| dc.subject | Pebble Games | en |
| dc.subject | Reversible Circuits | en |
| dc.title | The Compilation of Reversible Circuits and a New Optimization Game | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Science | en |
| uws-etd.degree.department | Physics and Astronomy | en |
| uws-etd.degree.discipline | Physics (Quantum Information) | en |
| uws-etd.degree.grantor | University of Waterloo | en |
| uws-etd.embargo.terms | 4 months | en |
| uws.contributor.advisor | Mosca, Michele | |
| uws.contributor.affiliation1 | Faculty of Science | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.published.city | Waterloo | en |
| uws.published.country | Canada | en |
| uws.published.province | Ontario | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |