Communication complexity
Quantum vs. classical communication and computation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Exponential separation of quantum and classical communication complexity
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Succinct quantum proofs for properties of finite groups
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Linear Codes and Character Sums
Combinatorica
Exponential separation of quantum and classical one-way communication complexity
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
An information statistics approach to data stream and communication complexity
Journal of Computer and System Sciences - Special issue on FOCS 2002
The influence of variables on Boolean functions
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
SIAM Journal on Computing
Quantum and classical message protect identification via quantum channels
Quantum Information & Computation
The streaming complexity of cycle counting, sorting by reversals, and other problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Estimates for the range of binomiality in codes' spectra
IEEE Transactions on Information Theory
Bounds on distance distributions in codes of known size
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. The problem is a natural generalisation of the previously studied Subgroup Membership problem: Alice receives a bit string x, Bob receives a permutation matrix M, and their task is to determine whether Mx = x or Mx is far from x. The proof uses Fourier analysis and an inequality of Kahn, Kalai and Linial.