Time hierarchies for sublogarithmic-space quantum computation
Author:
- 20 November 2025
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1061
Abstract
No abstract availableAll Related Versions
This publication has 6 references indexed in Scilit:
- $\rm P$ has polynomial-time finite-state verifiersDiscrete Mathematics & Theoretical Computer Science, 2025
- On the complexity of simulating space-bounded quantum computationscomputational complexity, 2003
- Two-way finite automata with quantum and classical statesTheoretical Computer Science, 2002
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- Finite state verifiers IJournal of the ACM, 1992
- A Time Complexity Gap for Two-Way Probabilistic Finite-State AutomataSIAM Journal on Computing, 1990