Algebraic approaches to program semantics
Algebraic approaches to program semantics
Time/space trade-offs for reversible computation
SIAM Journal on Computing
A note on Bennett's time space tradeoff for reversible computation
SIAM Journal on Computing
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
SIAM Journal on Computing
Quantum computation and quantum information
Quantum computation and quantum information
Retracting Some Paths in Process Algebra
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Reversible Simulation of Irreversible Computation
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Geometry of Interaction and linear combinatory algebras
Mathematical Structures in Computer Science
Towards a quantum programming language
Mathematical Structures in Computer Science
A Categorical Semantics of Quantum Protocols
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
On Halting Process of Quantum Turing Machine
Open Systems & Information Dynamics
A categorical model for the geometry of interaction
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Theoretical Computer Science
On traced monoidal closed categories
Mathematical Structures in Computer Science
Logical reversibility of computation
IBM Journal of Research and Development
Abstract scalars, loops, and free traced and strongly compact closed categories
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
| Hi-index | 5.23 |
This paper considers a very general model of computation via conditional iteration, the abstract machines of Hines (2008) [23], and studies the conditions under which these describe reversible computations. Using this, we demonstrate how to construct quantum circuits that act as oracles for these Abstract Machines. For a classical computation with worst-case performance T, the resulting quantum circuit requires an ancilla of 1+log(T) qubits, and takes O(T) steps. The ancilla starts and finishes in the constant state |0, so garbage collection is performed automatically.