6533b7dafe1ef96bd126f64d

RESEARCH PRODUCT

Quantum versus Classical Online Streaming Algorithms with Logarithmic Size of Memory

Kamil KhadievAliya KhadievaDmitry KravchenkoAlexander RivoshRamis YamilovIlnaz Mannapov

subject

FOS: Computer and information sciencesComputer Science - Computational ComplexityQuantum PhysicsFormal Languages and Automata Theory (cs.FL)General MathematicsComputer Science - Data Structures and AlgorithmsFOS: Physical sciencesData Structures and Algorithms (cs.DS)Computer Science - Formal Languages and Automata TheoryComputational Complexity (cs.CC)Quantum Physics (quant-ph)

description

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.

yearjournalcountryeditionlanguage
2023-02-01
http://arxiv.org/abs/1710.09595