Simple circuit simulations of classical and quantum Turing machines
Yuri G. Gurevich, Andreas R. Blass · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · 2022
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.