TY - JOUR T1 - ReQWIRE: Reasoning about Reversible Quantum Circuits JF - EPTCS Y1 - 2019 A1 - Robert Rand A1 - Jennifer Paykin A1 - Dong-Ho Lee A1 - Steve Zdancewic AB -

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.

VL - 287 UR - https://arxiv.org/abs/1901.10118 U5 - https://doi.org/10.4204/EPTCS.287.17 ER -