7 citations · 15 across the 4 of their papers we have counts for
4 papers
Probabilistic and quantum finite automata with postselection
Abuzer Yakaryilmaz, A. C. Cem Say
We prove that endowing a real-time probabilistic or quantum computer with the ability of postselection increases its computational power. For this purpose, we provide a new model o…
Classical and quantum computation with small space bounds (PhD thesis)
Abuzer Yakaryilmaz
In this thesis, we introduce a new quantum Turing machine (QTM) model that supports general quantum operators, together with its pushdown, counter, and finite automaton variants, a…
Superiority of one-way and realtime quantum machines and new directions
Abuzer Yakaryilmaz
In automata theory, the quantum computation has been widely examined for finite state machines, known as quantum finite automata (QFAs), and less attention has been given to the QF…
Quantum function computation using sublogarithmic space (abstract & poster)
A. C. Cem Say, Abuzer Yakaryilmaz
We prove that quantum Turing machines are strictly superior to probabilistic Turing machines in function computation for any space bound .