Simple circuit simulations of classical and quantum Turing machines
From MaRDI portal
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.
This page was built for publication: Simple circuit simulations of classical and quantum Turing machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6383568)
