63 citations · 185 across the 32 of their papers we have counts for
3 papers · 2 filters
On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination
Jop Briët, Jeroen Zuiddam
After Bob sends Alice a bit, she responds with a lengthy reply. At the cost of a factor of two in the total communication, Alice could just as well have given the two possible repl…
Clean quantum and classical communication protocols
Harry Buhrman, Matthias Christandl, Christopher Perry +1
By how much must the communication complexity of a function increase if we demand that the parties not only correctly compute the function but also return all registers (other than…
Nondeterministic quantum communication complexity: the cyclic equality game and iterated matrix multiplication
Harry Buhrman, Matthias Christandl, Jeroen Zuiddam
We study nondeterministic multiparty quantum communication with a quantum generalization of broadcasts. We show that, with number-in-hand classical inputs, the communication comple…