Reproduce “Exponential quantum-classical query separations for cyclic Forrelation” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Yuxin Zhang, Changpeng Shao

The authors analyze classical oracle-query complexity for cyclic Forrelation, which estimates a normalized trace built from k Boolean functions and Hadamard transforms. For even k≥4, nonadaptive randomized algorithms require and achieve Θ_k(N^{1−2/k}) queries at constant error; at k=4 this is Θ(√N), versus four quantum queries per run. For k=3, O(log N log log N) queries suffice. Odd k≥5 retains a gap between bounds.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.