Exponential separation between quantum communication and logarithm of approximate rank

DOI10.1109/FOCS.2019.00062MaRDI QIDQ6944175zbMATH OpenFDO

Authors Ronald de Wolf, Makrand Sinha

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2019.00062

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(6)

• On parity decision trees for Fourier-sparse Boolean functions
• One-way communication complexity of partial XOR functions
• Quantum and classical communication complexity of permutation-invariant functions
• On the communication complexity of finding a king in a tournament
• Tight bounds for the randomized and quantum communication complexities of equality with small error
• On parity decision trees for Fourier-sparse Boolean functions

This page was built for publication: Exponential separation between quantum communication and logarithm of approximate rank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944175)