DeepAI
Log In Sign Up

Quantum Random Access Stored-Program Machines

03/07/2020
by   Qisheng Wang, et al.
0

Random access machines (RAMs) and random access stored-program machines (RASPs) are models of computing that are closer to the architecture of real-world computers than Turing machines (TMs). They are also convenient in complexity analysis of algorithms. The relationships between RAMs, RASPs and TMs are well-studied. However, a clear relationships between their quantum counterparts are still missing in the literature. We fill in this gap by formally defining the models of quantum random access machines (QRAMs) and quantum random access stored-program machines (QRASPs) and clarifying the relationships between QRAMs, QRASPs and quantum Turing machines (QTMs). In particular, we prove: 1. A T(n)-time QRAM (resp. QRASP) can be simulated by an O(T(n))-time QRASP (resp. QRAM). 2. A T(n)-time QRAM under the logarithmic (resp. constant) cost criterion can be simulated by an Õ(T(n)^4)-time (resp. Õ(T(n)^8)-time) QTM. 3. A T(n)-time QTM can be simulated within error ε > 0 by an O(T(n)^2 polylog(T(n), 1/ε))-time QRAM (under both the logarithmic and constant cost criterions). As a corollary, we have: P⊆EQRAMP⊆EQP⊆BQP = BQRAMP, where EQRAMP and BQRAMP stand for the sets of problems that can be solved by polynomial-time QRAMs with certainty and bounded-error, respectively.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/06/2018

Revisiting the simulation of quantum Turing machines by quantum circuits

Yao (1993) proved that quantum Turing machines and uniformly generated q...
05/06/2021

Quantum Logarithmic Space and Post-selection

Post-selection, the power of discarding all runs of a computation in whi...
02/07/2018

A Schematic Definition of Quantum Polynomial Time Computability

In the past four decades, the notion of quantum polynomial-time computab...
12/23/2017

On the Universality of Memcomputing Machines

Universal memcomputing machines (UMMs) [IEEE Trans. Neural Netw. Learn. ...
06/26/2018

Quantum Random Self-Modifiable Computation

Among the fundamental questions in computer science, at least two have a...
11/02/2017

On the Complexity of Random Quantum Computations and the Jones Polynomial

There is a natural relationship between Jones polynomials and quantum co...
09/12/2018

A Simple Elementary Proof of P=NP based on the Relational Model of E. F. Codd

The P versus NP problem is studied under the relational model of E. F. C...