You are currently offline. Some features of the site may not work correctly.

Corpus ID: 29324187

On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination

@article{Brit2016OnTO,
title={On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination},
author={J. Bri{\"e}t and Jeroen Zuiddam},
journal={ArXiv},
year={2016},
volume={abs/1608.06113}
}

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 replies without listening and have Bob select which applies to him. Motivated by a conjecture stating that this form of "round elimination" is impossible in exact quantum communication complexity, we study the orthogonal rank and a symmetric variant thereof for a certain family of Cayley graphs. The orthogonal rank of a… Expand