ReQWIRE: Reasoning about Reversible Quantum Circuits

Autor:	Rand, Robert, Paykin, Jennifer, Lee, Dong-Ho, Zdancewic, Steve
Rok vydání:	2019
Předmět:	Computer Science - Logic in Computer Science Computer Science - Emerging Technologies Computer Science - Programming Languages D.2.4 F.3.1
Zdroj:	EPTCS 287, 2019, pp. 299-312
Druh dokumentu:	Working Paper
DOI:	10.4204/EPTCS.287.17
Popis:	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. Comment: In Proceedings QPL 2018, arXiv:1901.09476
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1901.10118 Zobrazit plný text záznamu View this record from Arxiv