Quantum Online Streaming Algorithms with Logarithmic Memory

Abstract

© 2019, Springer Science+Business Media, LLC, part of Springer Nature. We consider quantum and classical (deterministic or randomize) streaming online algorithms with respect to competitive ratio. We show that there is a problem that can be solved by a quantum online streaming algorithm better than by classical ones in the case of logarithmic memory. The problem is an online version of the Disjointness problem (Checking weather two sets are disjoint or not).