# Quantum Communication Complexity of Distribution Testing

@article{Belovs2020QuantumCC,
title={Quantum Communication Complexity of Distribution Testing},
author={Aleksandrs Belovs and Arturo Castellanos and Franccois Le Gall and Guillaume Malod and Alexander A. Sherstov},
journal={ArXiv},
year={2020},
volume={abs/2006.14870}
}
• Published 26 June 2020
• Computer Science, Mathematics
• ArXiv
The classical communication complexity of testing closeness of discrete distributions has recently been studied by Andoni, Malkin and Nosatzki (ICALP'19). In this problem, two players each receive $t$ samples from one distribution over $[n]$, and the goal is to decide whether their two distributions are equal, or are $\epsilon$-far apart in the $l_1$-distance. In the present paper we show that the quantum communication complexity of this problem is $\tilde{O}(n/(t\epsilon^2))$ qubits when the…

## References

SHOWING 1-10 OF 22 REFERENCES

It is well known that entanglement on its own is useless for the transmission of information, but there are distributed tasks that cannot be accomplished at all in a classical world when communication is not allowed, but that become possible if the non-communicating parties share prior entanglements.
• Computer Science, Mathematics
IACR Cryptol. ePrint Arch.
• 2018
Lower bounds are proved of independent interest as these are the first 2-party communication lower bounds for testing problems, and the gain is polynomially better than what one obtains by adapting standard algorithms.
The pattern matrix method gives a new and simple proof of Razborov's breakthrough quantum lower bounds for disjointness and other symmetric predicates, and characterize the discrepancy, approximate rank, and approximate trace norm of A_f in terms of well-studied analytic properties of f.
• Economics
Theory Comput.
• 2016
This survey describes recent results obtained for quantum property testing and surveys known bounds on testing various natural properties, such as whether two states are equal, whether a state is separable, whether two operations commute, etc.
The quantum complexity of approximately computing the frequency moments in two settings is studied, and quantum algorithms which outperform the best possible classical algorithms up to quadratically are given.
This work proves that quantum communication complexity obeys an SDPT whenever the communication lower bound for a single instance is proved by the generalized discrepancy method, the strongest technique in that model.
• Computer Science, Mathematics
SODA
• 2014
This work presents simple testers for both the e1 and e2 settings, with sample complexity that is information-theoretically optimal, to constant factors, and establishes that the sample complexity is Θ(max{n2/3/e4/3, n1/2/&epsilon2}.
This work will review the basic communication model and some of the classical results known for it, sometimes even with proofs, and consider a variant in which the players are allowed to flip fair unbiased coins.