2000 character limit reached
Simple circuit simulations of classical and quantum Turing machines (2111.10830v1)
Published 21 Nov 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.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.