Multi-party Quantum Communication Complexity with Routed Messages


This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths, which may be shared with other parties, on a network of any topology. The technique can also be employed to obtain a lower-bound of the quantum communication complexity of some… (More)
DOI: 10.1007/978-3-540-69733-6_19
View Slides

2 Figures and Tables


  • Presentations referencing similar topics