Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > HAOYU WANG:
All reports by Author Haoyu Wang:

TR26-239 | 6th October 2026
Haoyu Wang, Pei Wu, Guangxu Yang

Exponential Quantum Advantage in Number-on-Forehead Communication

We give the first exponential quantum advantage in the general interactive three-party Number-on-Forehead (NOF) model for a decision problem. Previous separations hold only for restricted protocols like one-way communication for a relation. We construct an explicit partial Boolean function, the Interleaved Unitary Product problem, that requires only $O(\log n)$ quantum ... more >>>


TR26-190 | 17th September 2026
Haoyu Wang, Pei Wu

Efficient Randomized Communication Without Large Monochromatic Rectangles

In this paper, we construct a total Boolean function with $\widetilde{O}(\log n)$ randomized communication protocol, while any monochromatic rectangle has density at most $O(2^{-\mathrm{poly}(n)})$. As a corollary, it gives the first total function separation for $\mathrm{BPP}\not\subseteq\mathrm{P}^{\mathrm{NP}}$ in the communication world. Inspired by Gavinsky’s recent work (arXiv:2608.18784), our construction combines the ... more >>>




ISSN 1433-8092 | Imprint