2026-09-18T22:53:39Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1400682022-02-08T03:49:24Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Oliver, William D.
McNally, Christopher Michael
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2022-02-07T15:22:12Z
2022-02-07T15:22:12Z
2021-09
2021-09-21T19:54:12.892Z
https://hdl.handle.net/1721.1/140068
In this thesis we present a compiler for Cavy, an imperative quantum programming language. The main contribution of the Cavy system is the application of region inference to the problem of safe and efficient ancilla qubit allocation, use, and deallocation in a programming language with a reversible subset. This approach enables the compilation of optimized quantum circuits from programs with arbitrary ancilla operations. In contrast with other recent work on ancilla deallocation, the safety analysis is a variant of the borrow checker introduced in the Rust programming language. It features “move references,” a unique reference type that can safely transfer ownership of its referent.
To frame the problem and motivate these features, we describe a quantum algorithm whose recent experimental implementation strains the expressiveness of traditional linearly-typed quantum programming languages, and give a Cavy implementation of this algorithm.
S.M.
Massachusetts Institute of Technology
In Copyright - Educational Use Permitted
Copyright MIT
http://rightsstatements.org/page/InC-EDU/1.0/
Practical Modern Quantum Programming
Thesis
application/pdf
Master
Master of Science in Electrical Engineering and Computer Science
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="48e2427a-9a4f-494a-bdf0-5dc27db8fe7b">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Title>Practical Modern Quantum Programming</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2021-09</PublicationDate>
<Authors>
<Author>
<DisplayName>McNally, Christopher Michael</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://rightsstatements.org/page/InC-EDU/1.0/</License>
<Abstract>In this thesis we present a compiler for Cavy, an imperative quantum programming language. The main contribution of the Cavy system is the application of region inference to the problem of safe and efficient ancilla qubit allocation, use, and deallocation in a programming language with a reversible subset. This approach enables the compilation of optimized quantum circuits from programs with arbitrary ancilla operations. In contrast with other recent work on ancilla deallocation, the safety analysis is a variant of the borrow checker introduced in the Rust programming language. It features “move references,” a unique reference type that can safely transfer ownership of its referent.
To frame the problem and motivate these features, we describe a quantum algorithm whose recent experimental implementation strains the expressiveness of traditional linearly-typed quantum programming languages, and give a Cavy implementation of this algorithm.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>