Exponential Quantum Space Advantage for Approximating Max-$k$SAT in the Streaming Setting

Abstract

In this paper, we give a one-pass quantum streaming algorithm for Max-$k$SAT that uses $\mathrm{polylog}(n)$ space and achieves a $0.7172$-approximation on instances with $n$ variables. In contrast, prior work by Chou, Golovnev, and Velusamy (FOCS 2020) implies that achieving an approximation ratio better than $\sqrt{2}/2\approx 0.7071$ for Max-$k$SAT requires $\hat{I}\text{c◯}(\sqrt{n})$ space for any classical streaming algorithm. Therefore, it yields an exponential quantum space advantage for Max-$k$SAT in the streaming setting. We further give a one-pass quantum streaming algorithm for Max-2OR that uses $\mathrm{polylog}(n)$ space and achieves a $0.7425$-approximation on instances with $n$ variables. Combining with the known results, it gives a complete classification of quantum space advantages for all Boolean Max-2CSPs.

57 pages