Online Locality Meets Distributed Quantum Computing
New 69-page study shatters expectations for quantum supremacy in distributed systems.
Deep Dive
A new 69-page research paper from 11 authors connects distributed quantum computing, finitely-dependent processes, and online graph algorithms. It proves that for locally checkable labeling problems (LCLs) in rooted trees, quantum-LOCAL models with O(log* n) locality offer no advantage over classical LOCAL models. The work answers an open question from Holroyd [2024] and establishes a new barrier for proving tighter quantum computing bounds using causality arguments.
Why It Matters
This fundamentally challenges assumptions about quantum supremacy and sets new theoretical limits for distributed computing performance.