Simple circuit simulations of classical and quantum Turing machines
Abstract
We construct reversible Boolean circuits efficiently simulating reversible Turing machines. Both the circuits and the simulation proof are rather simple. Then we give a fairly straightforward generalization of the circuits and the simulation proof to the quantum case.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Sep 01, 2022
- Source ID
- 10.1098/rspa.2021.0891
Entities
People
- Andreas Blass
- Yuri Gurevich
Organizations
- Army Research Office
- University of Michigan