Tight Limits on Nonlocality from Nontrivial Communication Complexity; a.k.a. Reliable Computation with Asymmetric Gate Noise.
Noah ShuttyMary WoottersPatrick HaydenPublished in: FOCS (2020)
Keyphrases
- worst case
- signal to noise ratio
- computational complexity
- communication protocol
- noise level
- upper bound
- increase in computational complexity
- noise free
- lower bound
- image noise
- additive noise
- efficient computation
- information asymmetry
- real time
- random noise
- noise model
- image quality
- median filter
- communication systems
- communication networks
- decision problems
- steady state
- np complete