Quantum Fine-Grained Lower Bounds for SetDisjointness via Sub-Linear Reductions from 3SUM

Name: Quantum Fine-Grained Lower Bounds for SetDisjointness via Sub-Linear Reductions from 3SUM
Uploaded: 2026-10-04T16:29:10.156568+00:00
Duration: 617 s
Description: The paper establishes conditional lower bounds for quantum SetDisjointness by providing sub-linear time reductions from 3SUM and 3XOR to online SetDisjointness. This is significant because classical methods fail in the quantum setting, leading to a new query-preprocessing tradeoff bound: p + 2q >= 1 for certain algorithms.

The paper establishes conditional lower bounds for quantum SetDisjointness by providing sub-linear time reductions from 3SUM and 3XOR to online SetDisjointness. This is significant because classical methods fail in the quantum setting, leading to a new query-preprocessing tradeoff bound: p + 2q >= 1 for certain algorithms.

Open the full episode