%0 Journal Article %J EPTCS %D 2019 %T ReQWIRE: Reasoning about Reversible Quantum Circuits %A Robert Rand %A Jennifer Paykin %A Dong-Ho Lee %A Steve Zdancewic %X

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> 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.

%B EPTCS %V 287 %G eng %U https://arxiv.org/abs/1901.10118 %9 In Proceedings QPL 2018, arXiv:1901.09476 %& 299-312 %R https://doi.org/10.4204/EPTCS.287.17