Show simple item record

dc.contributor.authorAmy, Matthew
dc.date.accessioned2013-08-30 20:15:50 (GMT)
dc.date.available2013-08-30 20:15:50 (GMT)
dc.date.issued2013-08-30T20:15:50Z
dc.date.submitted2013
dc.identifier.urihttp://hdl.handle.net/10012/7818
dc.description.abstractThis thesis investigates techniques for the automated optimization of quantum circuits. In the first part we develop an exponential time algorithm for synthesizing minimal depth quantum circuits. We combine this with effective heuristics for reducing the search space, and show how it can be extended to different optimization problems. We then use the algorithm to compute circuits over the Clifford group and T gate for many of the commonly used quantum gates, improving upon the former best known circuits in many cases. In the second part, we present a polynomial time algorithm for the re-synthesis of CNOT and T gate circuits while reducing the number of phase gates and parallelizing them. We then describe different methods for expanding this algorithm to optimize circuits over Clifford and T gates.en
dc.language.isoenen
dc.publisherUniversity of Waterlooen
dc.subjectQuantum circuitsen
dc.subjectQuantum circuit optimizationen
dc.titleAlgorithms for the Optimization of Quantum Circuitsen
dc.typeMaster Thesisen
dc.pendingfalseen
dc.subject.programComputer Science (Quantum Information)en
uws-etd.degree.departmentSchool of Computer Scienceen
uws-etd.degreeMaster of Mathematicsen
uws.typeOfResourceTexten
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages