research
∙
12/28/2022
Classical and quantum Merlin-Arthur automata
We introduce Merlin-Arthur (MA) automata as Merlin provides a single cer...
share
research
∙
12/22/2022
Real-valued affine automata compute beyond Turing machines
We show that bounded-error affine finite automata recognize uncountably ...
research
∙
05/06/2021
Quantum Logarithmic Space and Post-selection
Post-selection, the power of discarding all runs of a computation in whi...
research
∙
04/22/2021
Affine automata verifiers
We initiate the study of the verification power of AfAs as part of Arthu...
research
∙
04/02/2019
The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints
It is known that 2-state binary and 3-state unary probabilistic finite a...
research
∙
07/13/2018
Postselecting probabilistic finite state recognizers and verifiers
In this paper, we investigate the computational and verification power o...
research
∙
07/12/2018