Lower bounds on the communication complexity of two-party (quantum) processes.
Alberto MontinaStefan WolfPublished in: ISIT (2014)
Keyphrases
- lower bound
- upper bound
- worst case
- communication channels
- objective function
- complexity measures
- computational complexity
- communication patterns
- information exchange
- communication systems
- branch and bound
- information sharing
- np hard
- communication networks
- computational models
- process model
- wireless networks
- lower and upper bounds
- computational cost
- average case complexity