Random order enables new quantum memory uses in streaming tasks

Random Order in Quantum Streaming: Replenishment and Robust Lower Bounds

Data Structures and Algorithms

Summary

This paper looks at how the order of data affects the power of quantum memory when processing data streams. The authors show that in random order, quantum memory can be reused or "replenished" by later data, making quantum algorithms more space efficient. They prove limits on how little space is possible for some problems, showing that even quantum methods need substantial memory in other situations. They also improve algorithms for counting triangles in graphs when edges come in random repeated order. Overall, the work shows that random input order can both help and limit quantum streaming.

What this means in practice

  • For quantum algorithm designers: Design quantum streaming algorithms that reuse quantum memory efficiently when input arrives in random order, reducing space requirements for some problems.
  • For graph processing engineers: Use improved quantum and classical algorithms for triangle counting in graph streams where edges appear multiple times in random order to save space.

A theory result. No direct application yet.

Authors

Nadezhda Voronova

Abstract

How can random order change the role of quantum memory in streaming? Later classical input can restore the usefulness of a quantum state consumed by earlier queries. We call this replenishment. We construct an artificial problem based on Hidden Matching, with repeated coordinate data and online matching requests. It admits a one-pass quantum algorithm using polylogarithmic space in uniformly random order, but unconditionally requires polynomial space both classically in random order and quantumly when all updates precede the requests. To prove the quantum lower bound, we strengthen the consumability bounds of Gilboa, Jain, and McClean for Multiple Hidden Matching. Without prior entanglement, any quantum encoding supporting $r$ independent matching requests requires $Ω(r)$ qubits for $r\le N^{1/2-δ}$ and every fixed $δ\in(0,1/2)$, even with simultaneous revelation and arbitrary joint decoding. For sequential requests, the linear bound extends through $r=Θ(\sqrt N)$. We also adapt Kallaugher's triangle-counting algorithm to uniformly random streams in which every edge is repeated equally often. Rebuilding the quantum sketch and resampling the classical estimator improve its expected-space bound in suitable parameter regimes. Finally, we extend the robust Noisy Gap Cycle framework of Assadi and Sundaresan to quantum streaming. A quantum communication lower bound for Block Hidden XOR yields an $Ω(n)$ space lower bound in random edge order for large enough cycles, with consequences for several graph problems. Thus random order can enable replenishment of small quantum representations, while substantial space requirements persist for other tasks.