DeepAI AI Chat
Log In Sign Up

Simple circuit simulations of classical and quantum Turing machines

11/21/2021
by   Yuri Gurevich, et al.
University of Michigan
0

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.

READ FULL TEXT
08/06/2018

Revisiting the simulation of quantum Turing machines by quantum circuits

Yao (1993) proved that quantum Turing machines and uniformly generated q...
10/14/2019

Circuit pedantry

Boolean and quantum circuits have commonalities and differences. To form...
12/03/2020

Characteristics of Reversible Circuits for Error Detection

In this work, we consider error detection via simulation for reversible ...
07/10/2020

Efficient ancilla-free reversible and quantum circuits for the Hidden Weighted Bit function

The Hidden Weighted Bit function plays an important role in the study of...
11/11/2020

StoqMA meets distribution testing

𝖲𝗍𝗈𝗊𝖬𝖠 captures the computational hardness of approximating the ground e...
02/07/2018

A Schematic Definition of Quantum Polynomial Time Computability

In the past four decades, the notion of quantum polynomial-time computab...