Fetching the paper…
Reading the bibliography…
In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication.
On the density of families of sets
N. Sauer · 1972
Earlier work this paper cites.
Some estimates of the information transmitted by quantum communication channels
A.S. Holevo · 1973
Earlier work this paper cites.
Quantum Detection and Estimation Theory
C.W. Helstrom · 1976
Earlier work this paper cites.
Probabilistic computations: Toward a unified measure of complexity
A. C-C. Yao · 1977
Earlier work this paper cites.
Some complexity questions related to distributive computing
A. C-C. Yao · 1979
Earlier work this paper cites.
Learnability and the vapnik-chervonenkis dimension
A. Blumer, A. Ehrenfeucht, D. Haussler, and M.K. Warmuth · 1989
Earlier work this paper cites.
Elements of Information Theory
T. M. Cover and J. A. Thomas · 1991
Earlier work this paper cites.
Private vs. common random bits in communication complexity
I. Newman · 1991
Earlier work this paper cites.
On the distributional complexity of disjointness
A. Razborov · 1992
Cited alongside, same era.
A. C-C. Yao · 1993
Cited alongside, same era.
On randomized one-round communication complexity
I. Kremer, N. Nisan, and D. Ron · 1995
Cited alongside, same era.
Fat-shattering and the learnability of real-valued functions
P.L. Bartlett, P.M. Long, and R.C. Williamson · 1996
Cited alongside, same era.
Communication Complexity
E. Kushilevitz and N. Nisan · 1997
Cited alongside, same era.
Optimal lower bounds for quantum automata and random access codes
A. Nayak · 1999
Cited alongside, same era.
Universally composable privacy amplification against quantum adversaries
R. König and R. Renner · 2005
Later among the works it cites.
Data streams: Algorithms and applications
S. M. Muthukrishnan · 2005
Later among the works it cites.
The learnability of quantum states
S. Aaronson · 2007
Later among the works it cites.
Exponential separations for one-way quantum communication complexity, with applications to cryptography
D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz, and R. de Wolf · 2007
Later among the works it cites.
The communication complexity of correlation
P. Harsha, R. Jain, D. McAllester, and J. Radhakrishnan · 2007
Later among the works it cites.
Direct product theorems for classical communication complexity via subdistribution bounds
R. Jain, H. Klauck, and A. Nayak · 2008
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Quantum Computation and Quantum Information
M. A. Nielsen and I. L. Chuang · 2000
Cited alongside, same era.
On the power of quantum memory
R. König, U. Maurer, and R. Renner · 2005
Cited alongside, same era.
The bounded-storage model in the presence of a quantum adversary
R. T. König and B. M. Terhal · 2008
Closest in time.