01259nas a2200145 4500008004100000245005700041210005600098490000800154520083800162100001701000700002101017700001701038700002101055856003701076 2019 eng d00aReQWIRE: Reasoning about Reversible Quantum Circuits0 aReQWIRE Reasoning about Reversible Quantum Circuits0 v2873 a
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.
1 aRand, Robert1 aPaykin, Jennifer1 aLee, Dong-Ho1 aZdancewic, Steve uhttps://arxiv.org/abs/1901.10118