You have requested a machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Neither SPIE nor the owners and publishers of the content make, and they explicitly disclaim, any express or implied representations or warranties of any kind, including, without limitation, representations and warranties as to the functionality of the translation feature or the accuracy or completeness of the translations.
Translations are not retained in our system. Your use of this feature and the translations is subject to all use restrictions contained in the Terms and Conditions of Use of the SPIE website.
15 March 2019Two-way quantum and classical machines with small memory for online minimization problems
We consider online algorithms. Typically the model is investigated with respect to competitive ratio. In this paper, we explore algorithms with small memory. We investigate two-way automata as a model for online algorithms with restricted memory. We focus on quantum and classical online algorithms. We show that there are problems that can be better solved by two-way automata with quantum and classical states than classical two-way automata in the case of sublogarithmic memory (sublinear size).
Kamil Khadiev andAliya Khadieva
"Two-way quantum and classical machines with small memory for online minimization problems", Proc. SPIE 11022, International Conference on Micro- and Nano-Electronics 2018, 110222T (15 March 2019); https://doi.org/10.1117/12.2522462
The alert did not successfully save. Please try again later.
Kamil Khadiev, Aliya Khadieva, "Two-way quantum and classical machines with small memory for online minimization problems," Proc. SPIE 11022, International Conference on Micro- and Nano-Electronics 2018, 110222T (15 March 2019); https://doi.org/10.1117/12.2522462