Lower Bounds on the Running Time of Two-Way Quantum Finite Automata and Sublogarithmic-Space Quantum Turing Machines

03/22/2020
by   Zachary Remscrim, et al.
0

The two-way finite automaton with quantum and classical states (2QCFA), defined by Ambainis and Watrous, is a model of quantum computation whose quantum part is extremely limited; however, as they showed, 2QCFA are surprisingly powerful: a 2QCFA with only a single-qubit can recognize the language L_pal={w ∈{a,b}^*:w is a palindrome} with bounded error in expected time 2^O(n), on inputs of length n. We prove that their result essentially cannot be improved upon: a 2QCFA (of any size) cannot recognize L_pal with bounded error in expected time 2^o(n). To our knowledge, this is the first example of a language that can be recognized with bounded error by a 2QCFA in exponential time but not in subexponential time. Moreover, we prove that a quantum Turing machine (QTM) running in space o(log n) and expected time 2^n^1-Ω(1) cannot recognize L_pal with bounded error; again, this is the first lower bound of its kind. Far more generally, we establish a lower bound on the running time of any 2QCFA or o(log n)-space QTM that recognizes any language L in terms of a natural “hardness measure" of L. This allows us to exhibit a large family of languages for which we have asymptotically matching lower and upper bounds on the running time of any such 2QCFA or QTM recognizer.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/22/2020

The Power of a Single Qubit: Two-way Quantum Finite Automata and the Word Problem

The two-way finite automaton with quantum and classical states (2QCFA), ...
research
08/18/2023

Quantum and Probabilistic Computers Rigorously Powerful than Traditional Computers, and Derandomization

In this paper, we extend the techniques used in our previous work to sho...
research
06/08/2020

Quantum Legendre-Fenchel Transform

We present a quantum algorithm to compute the discrete Legendre-Fenchel ...
research
01/11/2021

Running Time Analysis of Broadcast Consensus Protocols

Broadcast consensus protocols (BCPs) are a model of computation, in whic...
research
09/05/2022

Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings

The purpose of this article is to study the algorithmic complexity of th...
research
05/02/2019

Space-bounded Church-Turing thesis and computational tractability of closed systems

We report a new limitation on the ability of physical systems to perform...
research
04/12/2022

Energy Complexity of Regular Language Recognition

The erasure of each bit of information by a computing device has an intr...

Please sign up or login with your details

Forgot password? Click here to reset