94 citations · 376 across the 55 of their papers we have counts for
Showing 2010Show all
3 papers · 1 filter
cs.CC2010★ 28 cited
Quantum computation with devices whose contents are never read
Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say +1
In classical computation, a "write-only memory" (WOM) is little more than an oxymoron, and the addition of WOM to a (deterministic or probabilistic) classical computer brings no ad…
cs.CC2010
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 .
cs.CC2010★ 94 cited
Unbounded-error quantum computation with small space bounds
Abuzer Yakaryilmaz, A. C. Cem Say
We prove the following facts about the language recognition power of quantum Turing machines (QTMs) in the unbounded error setting: QTMs are strictly more powerful than probabilist…