2026-08-08T20:02:23Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13578 2024-03-06T10:52:21Z ddc:004 open_access

Lower Bounds on the Running Time of Two-Way Quantum Finite Automata and Sublogarithmic-Space Quantum Turing Machines Remscrim, Zachary Quantum computation Lower bounds Finite automata 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)}. We prove that their result cannot be improved upon: a 2QCFA (of any size) cannot recognize L_{pal} with bounded error in expected time 2^{o(n)}. 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Zachary Remscrim 2021 Is Part Of LIPIcs, Volume 185, 12th Innovations in Theoretical Computer Science Conference (ITCS 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ITCS.2021.39 urn:nbn:de:0030-drops-135781 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.39 eng https://creativecommons.org/licenses/by/3.0/legalcode