Showing results for Quantum function computation using sub logarithmic space (abstract and poster)
Search instead for Quantum function computation using sublogarithmic space (abstract & poster)
Sep 16, 2010 · Abstract:We prove that quantum Turing machines are strictly superior to probabilistic Turing machines in function computation for any space ...
Abstract. We prove that quantum Turing machines are strictly superior to probabilistic Turing machines in function computation for any space bound ...
It is proved that quantum Turing machines are strictly superior to probabilistic Turing machines in function computation for any space bound ...
In this paper, we propose a definition of QTM, which extends and unifies the notions of Deutsch and Bernstein & Vazirani. In particular, we allow both arbitrary ...
Quantum function computation using sublogarithmic space (abstract & poster). by Cem Say. See Full PDF Download PDF ...
We demonstrate a setup where a quantum computer using a WOM can solve problems that neither a classical computer with a WOM nor a quantum computer without a WOM ...
Say ACC, Yakaryilmaz A (2010) Quantum function computation using sublogarithmic space. Poster presentation at QIP2010 (arXiv:1009.3124). Google Scholar. [25].
Presentation Preparation Instructions. All posters should be based on the submitted abstract that have been accepted by the Scientific Program Committee.
In this thesis, we introduce a new quantum Turing machine model that supports general quantum operators, together with its pushdown, counter, and finite ...