



@article {2385,
	title = {ReQWIRE: Reasoning about Reversible Quantum Circuits},
	journal = {EPTCS },
	volume = {287},
	year = {2019},
	type = {In Proceedings QPL 2018, arXiv:1901.09476},
	chapter = {299-312},
	abstract = {<p><span style="color: rgb(51, 51, 51); font-family: \&quot;Open Sans\&quot;, \&quot;Lucida Grande\&quot;, \&quot;Helvetica Neue\&quot;, Helvetica, Arial, sans-serif; font-size: 14px;">Common quantum algorithms make heavy use of ancillae: scratch qubits that are initialized at some state and later returned to that state and discarded. Existing quantum circuit languages let programmers assert that a qubit has been returned to the |0\&gt; state before it is discarded, allowing for a range of optimizations. However, existing languages do not provide the tools to verify these assertions, introducing a potential source of errors. In this paper we present methods for verifying that ancillae are discarded in the desired state, and use these methods to implement a verified compiler from classical functions to quantum oracles.</span></p>},
	doi = {https://doi.org/10.4204/EPTCS.287.17},
	url = {https://arxiv.org/abs/1901.10118},
	author = {Robert Rand and Jennifer Paykin and Dong-Ho Lee and Steve Zdancewic}
}
