ReQWIRE: Reasoning about Reversible Quantum Circuits
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...
Main Authors: | Robert Rand, Jennifer Paykin, Dong-Ho Lee, Steve Zdancewic |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2019-01-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1901.10118v1 |
Similar Items
-
A Linear/Producer/Consumer Model of Classical Linear Logic
by: Jennifer Paykin, et al.
Published: (2015-02-01) -
Quantum Gates to Implement the Reversible Logic Circuits
by: Ali H. Khidhir
Published: (2017-04-01) -
Reducing the Depth of Linear Reversible Quantum Circuits
by: Timothee Goubault de Brugiere, et al.
Published: (2021-01-01) -
Reasoning about Quantum Information: An Overview of Quantum Dynamic Logic
by: Alexandru Baltag, et al.
Published: (2022-04-01) -
Towards a Participatory Approach: Reversing the Gaze when (re)presenting Refugees in nonfiction film
by: Rand Beiruty
Published: (2020-11-01)