Researcher flags that new APSP construction doesn't beat trivial quantum n^2.5 bound
aran_nayebi · x · 2026-10-06
- Researcher Aran Nayebi raises a technical caveat on a recent APSP (all-pairs shortest paths) improvement.
- As far as he can tell, the construction doesn't automatically improve the trivial quantum n^2.5 bound for general APSP: Grover's speedup doesn't simply apply to the algebraic preprocessing and batching that produces the classical improvement.
- A notable scope limitation for algorithm-complexity researchers following the result.
More from Research
- New algorithm makes superword tokens practical without slow context overhead, COLM 2026 poster claims — yuvalpi · 2026-10-06
- Stanford's Agent0 evolves agents from zero data, beats self-play baselines — yuyinzhou_cs · 2026-10-06
- UW PhD Shangbin Feng enters 2026-27 faculty market with participatory AI research agenda — shangbinfeng · 2026-10-06
- Babies' brains sync with strangers via dad's scent, Science Advances study finds — rickasaurus · 2026-10-06
- Decision grader replaces LLM judge: 32x cheaper, 8x faster, 94% agreement on evals — rhythmrg · 2026-10-06
- Raghunathan lab to present pretraining safety and adaptation papers at COLM 2026 — AdtRaghunathan · 2026-10-06