A Lower Bound on Entanglement-Assisted Quantum Communication Complexity

Ashley Montanaro, Andreas Winter. A Lower Bound on Entanglement-Assisted Quantum Communication Complexity. In Lars Arge, Christian Cachin, Tomasz Jurdzinski, Andrzej Tarlecki, editors, Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings. Volume 4596 of Lecture Notes in Computer Science, pages 122-133, Springer, 2007. [doi]

@inproceedings{MontanaroW07,
  title = {A Lower Bound on Entanglement-Assisted Quantum Communication Complexity},
  author = {Ashley Montanaro and Andreas Winter},
  year = {2007},
  doi = {10.1007/978-3-540-73420-8_13},
  url = {http://dx.doi.org/10.1007/978-3-540-73420-8_13},
  researchr = {https://researchr.org/publication/MontanaroW07},
  cites = {0},
  citedby = {0},
  pages = {122-133},
  booktitle = {Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings},
  editor = {Lars Arge and Christian Cachin and Tomasz Jurdzinski and Andrzej Tarlecki},
  volume = {4596},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-73419-2},
}