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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have