2 papers
cs.CC2025
Short and useful quantum proofs for sublogarithmic-space verifiers
A. C. Cem Say
Quantum Merlin-Arthur proof systems are believed to be stronger than both their classical counterparts and ``stand-alone'' quantum computers when Arthur is assumed to operate in $Ω…
cs.CC2025
Time hierarchies for sublogarithmic-space quantum computation
A. C. Cem Say
We present new results on the landscape of problems that can be solved by quantum Turing machines (QTM's) employing severely limited amounts of memory. In this context, we demonstr…