Revisiting the simulation of quantum Turing machines by quantum circuits

08/06/2018
by   Abel Molina, et al.
0

Yao (1993) proved that quantum Turing machines and uniformly generated quantum circuits are polynomially equivalent computational models: t ≥ n steps of a quantum Turing machine running on an input of length n can be simulated by a uniformly generated family of quantum circuits with size quadratic in t, and a polynomial-time uniformly generated family of quantum circuits can be simulated by a quantum Turing machine running in polynomial time. We revisit the simulation of quantum Turing machines with uniformly generated quantum circuits, which is the more challenging of the two simulation tasks, and present a variation on the simulation method employed by Yao together with an analysis of it. This analysis reveals that the simulation of quantum Turing machines can be performed by quantum circuits having depth linear in t, rather than quadratic depth, and can be extended to variants of quantum Turing machines, such as ones having multi-dimensional tapes. Our analysis is based on an extension of a method of Arrighi, Nesme, and Werner (2011) that allows for the localization of causal unitary evolutions.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

11/21/2021

Simple circuit simulations of classical and quantum Turing machines

We construct reversible Boolean circuits efficiently simulating reversib...
02/07/2018

A Schematic Definition of Quantum Polynomial Time Computability

In the past four decades, the notion of quantum polynomial-time computab...
03/07/2020

Quantum Random Access Stored-Program Machines

Random access machines (RAMs) and random access stored-program machines ...
03/23/2021

PAC-learning gains of Turing machines over circuits and neural networks

A caveat to many applications of the current Deep Learning approach is t...
06/26/2018

Quantum Random Self-Modifiable Computation

Among the fundamental questions in computer science, at least two have a...
12/26/2021

Resource dependent undecidability: computability landscape of distinct Turing theories

Can a problem undecidable with classical resources be decidable with qua...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.