Reproduce “A Quantum Lower Bound for Triangle Finding” 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

Arjan Cornelissen, Amin Shiraz Gilani, Xingyu Zhou

The authors prove a superlinear quantum query lower bound for finding a triangle in the adjacency-matrix model. They compare a planted triangle with triangle-free random graphs and use local resampling around vertex stars to control overlapping candidates. The bound is Ω(N^13/12), improving the previous Ω(N) lower bound, but remains below the best known N^5/4 upper bound.

Summary by alphaXiv.

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