63 citations · 185 across the 32 of their papers we have counts for
5 papers · 1 filter
Asymptotic tensor rank of graph tensors: beyond matrix multiplication
Matthias Christandl, Péter Vrana, Jeroen Zuiddam
We present an upper bound on the exponent of the asymptotic behaviour of the tensor rank of a family of tensors defined by the complete graph on vertices. For , we show…
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…
Tensor surgery and tensor rank
Matthias Christandl, Jeroen Zuiddam
We introduce a method for transforming low-order tensors into higher-order tensors and apply it to tensors defined by graphs and hypergraphs. The transformation proceeds according…
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…