For every Boolean f, bounded-error quantum and classical deterministic communication complexity of f ∘ AND₂ are polynomially related up to polylog n, both characterized by log of De Morgan sparsity of f.
Query-to-Communication Lifting for
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Quantum-Classical Equivalence for AND-Functions
For every Boolean f, bounded-error quantum and classical deterministic communication complexity of f ∘ AND₂ are polynomially related up to polylog n, both characterized by log of De Morgan sparsity of f.