Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds
by
Hartmut Klauck
| Citations: | 6 - 2 self |
BibTeX
@MISC{Klauck_quantumand,
author = {Hartmut Klauck},
title = {Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds},
year = {}
}
OpenURL
Abstract
We derive bounds on the product of the communication C and space S for communicating circuits. The first bound applies to quantum circuits and follows from a "bipartite product" result for the discrepancy of communication problems. If for any problem f : XY the multicolor discrepancy of the communication matrix of f is 1/2 then the problem in which Alice receives some l inputs, Bob r inputs, and their task is to compute f(x i , y j ) for the l r pairs of inputs (x i , y j ), has a quantum communication-space tradeo# CS (lrd log |Z|).







