Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
Subexponential-Time Quantum Advantage beyond Double-Logarithmic Space
A. C. Cem Say
We prove that subexponential-time quantum Turing machines are superior to their classical counterparts within common space bounds in . For that purpose, we define i…
cs.CC2023
has polynomial-time finite-state verifiers
M. Utkan Gezer, A. C. Cem Say
Interactive proof systems whose verifiers are constant-space machines have interesting features that do not have counterparts in the better studied case where the verifiers operate…