How to Design a Quantum Streaming Algorithm Without Knowing Anything About Quantum Computing
Quantum Physics
2024-10-25 v1 Data Structures and Algorithms
Abstract
A series of work [GKK+08, Kal22, KPV24] has shown that asymptotic advantages in space complexity are possible for quantum algorithms over their classical counterparts in the streaming model. We give a simple quantum sketch that encompasses all these results, allowing them to be derived from entirely classical algorithms using our quantum sketch as a black box. The quantum sketch and its proof of correctness are designed to be accessible to a reader with no background in quantum computation, relying on only a small number of self-contained quantum postulates.
Cite
@article{arxiv.2410.18922,
title = {How to Design a Quantum Streaming Algorithm Without Knowing Anything About Quantum Computing},
author = {John Kallaugher and Ojas Parekh and Nadezhda Voronova},
journal= {arXiv preprint arXiv:2410.18922},
year = {2024}
}
Comments
To appear in SOSA 2025