Simple circuit simulations of classical and quantum Turing machines
Quantum Physics
2022-10-12 v1 Computational Complexity
Logic in Computer Science
Mathematical Physics
math.MP
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.
Cite
@article{arxiv.2111.10830,
title = {Simple circuit simulations of classical and quantum Turing machines},
author = {Yuri Gurevich and Andreas Blass},
journal= {arXiv preprint arXiv:2111.10830},
year = {2022}
}