Dice Question Streamline Icon: https://streamlinehq.com

Quantum lower bounds for 3-coloring cycles in the quantum-LOCAL model

Establish nontrivial quantum lower bounds on the round complexity of 3-coloring cycles in the quantum-LOCAL model, using techniques other than round elimination, which the paper identifies as inapplicable for this purpose.

Information Square Streamline Icon: https://streamlinehq.com

Background

The authors prove that round elimination can separate classical LOCAL from quantum-LOCAL for their iterated GHZ problem, but also show that round elimination does not apply to quantum-LOCAL generally, creating a formal barrier.

They highlight that resolving major open questions, such as proving quantum lower bounds for 3-coloring cycles, cannot proceed via round elimination, motivating the development of new techniques.

References

This also represents a new formal barrier for resolving major open questions related to distributed quantum advantage: it is not possible to prove quantum lower bounds for e.g. 3-coloring cycles or for finding sinkless orientations by constructing a round elimination sequence.

— Distributed Quantum Advantage for Local Problems (2411.03240 - Balliu et al., 5 Nov 2024) in Implications and discussion, Lower-bound proof techniques paragraph