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
6 Citations
Round Elimination in Exact Communication Complexity
  • 9
  • PDF
The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications
  • PDF
Approximating the Orthogonality Dimension of Graphs and Hypergraphs
  • I. Haviv
  • Mathematics, Computer Science
  • MFCS
  • 2019
  • 2
  • PDF
Topological Bounds on the Dimension of Orthogonal Representations of Graphs
  • I. Haviv
  • Mathematics, Computer Science
  • Eur. J. Comb.
  • 2019
  • 5
  • PDF

References

SHOWING 1-10 OF 18 REFERENCES
On the Quantum Chromatic Number of a Graph
  • 96
  • PDF
Quantum vs. classical communication and computation
  • 397
  • PDF
On the Shannon capacity of a graph
  • L. Lovász
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 1979
  • 1,459
  • PDF
A comparison of the Delsarte and Lovász bounds
  • A. Schrijver
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 1979
  • 217
Two Structural Results for Low Degree Polynomials and Applications
  • G. Cohen, A. Tal
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
  • 2013
  • 23
  • PDF
Extremal Combinatorics - With Applications in Computer Science
  • S. Jukna
  • Computer Science
  • Texts in Theoretical Computer Science. An EATCS Series
  • 2011
  • 273
  • PDF
The maximal probability that k-wise independent bits are all 1
  • 5
  • PDF
Quantum computation and quantum information
  • T. Paul
  • Mathematics, Computer Science
  • Mathematical Structures in Computer Science
  • 2007
  • 15,283
...
1
2
...