Matching upper bounds on symmetric predicates in quantum communication complexity

Daiki Suruga. Matching upper bounds on symmetric predicates in quantum communication complexity. Quantum Information & Computation, 24(11&12):917-931, October 2024. [doi]

Abstract

Abstract is missing.