Emergent Mind
Simple circuit simulations of classical and quantum Turing machines
(2111.10830)
Published Nov 21, 2021
in
quant-ph
,
cs.CC
,
cs.LO
,
math-ph
,
and
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.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.