A hybrid lifting theorem unifies classical query-to-communication and quantum approximate-degree lifting to prove c + q² = Ω(max{deg(f), bs(f)} log n) for protocols computing f ∘ G^n.
Hybrid decision trees: Longer quantum time is strictly more powerful
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity
A hybrid lifting theorem unifies classical query-to-communication and quantum approximate-degree lifting to prove c + q² = Ω(max{deg(f), bs(f)} log n) for protocols computing f ∘ G^n.