1.2k citations · 3.7k across the 62 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
quant-ph2018★ 10 cited
Round elimination in exact communication complexity
Jop Briët, Harry Buhrman, Debbie Leung +2
We study two basic graph parameters, the chromatic number and the orthogonal rank, in the context of classical and quantum exact communication complexity. In particular, we conside…
quant-ph2018
Bounding quantum-classical separations for classes of nonlocal games
Tom Bannink, Jop Briët, Harry Buhrman +2
We bound separations between the entangled and classical values for several classes of nonlocal -player games. Our motivating question is whether there is a family of -player…