Quantum versus Classical Online Streaming Algorithms with Logarithmic Size of Memory
Computational Complexity
2019-06-21 v3 Data Structures and Algorithms
Formal Languages and Automata Theory
Quantum Physics
Abstract
We consider online algorithms with respect to the competitive ratio. Here, we investigate quantum and classical one-way automata with non-constant size of memory (streaming algorithms) as a model for online algorithms. We construct problems that can be solved by quantum online streaming algorithms better than by classical ones in a case of logarithmic or sublogarithmic size of memory.
Keywords
Cite
@article{arxiv.1710.09595,
title = {Quantum versus Classical Online Streaming Algorithms with Logarithmic Size of Memory},
author = {Kamil Khadiev and Aliya Khadieva and Dmitry Kravchenko and Alexander Rivosh and Ramis Yamilov and Ilnaz Mannapov},
journal= {arXiv preprint arXiv:1710.09595},
year = {2019}
}