存储容量为对数的量子与经典在线流媒体算法
Quantum versus Classical Online Streaming Algorithms with Logarithmic Size of Memory
摘要:
我们认为在线算法的竞争比。在这里,我们研究量子和经典的单向自动机与非恒定大小的内存(流算法)作为在线算法的模型。我们构建的问题,可以解决的量子在线流算法比经典的对数或亚对数大小的内存的情况下,更好地解决。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。