The quantum communication complexity of sampling

Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f: X/spl times/Y/spl rarr/{0,1} and a probability distribution D over X/spl times/Y, we define the sampling complexity of (f,D) as the minimum number of bits Alice and Bob must communicate for Alice to pick x/spl isin/X and Bob to pick y/spl isin/Y as well as a valve z s.t. the resulting distribution of (x,y,z) is close to the distribution (D,f(D)). In this paper we initiate the study of sampling complexity, in both the classical and quantum model. We give several variants of the definition. We completely characterize some of these tasks, and give upper and lower bounds on others. In particular this allows us to establish an exponential gap between quantum and classical sampling complexity, for the set disjointness function. This is the first exponential gap for any task where the classical probabilistic algorithm is allowed to err.

[1]  Andrew Chi-Chih Yao,et al.  Quantum Circuit Complexity , 1993, FOCS.

[2]  A. Holevo Bounds for the quantity of information transmitted by a quantum communication channel , 1973 .

[3]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[4]  Ilan Newman,et al.  Private vs. Common Random Bits in Communication Complexity , 1991, Inf. Process. Lett..

[5]  Peter Frankl,et al.  Complexity classes in communication complexity theory , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[6]  Avi Wigderson,et al.  Quantum vs. classical communication and computation , 1998, STOC '98.

[7]  Gene H. Golub,et al.  Matrix computations , 1983 .

[8]  Ran Raz,et al.  Exponential separation of quantum and classical communication complexity , 1999, STOC '99.

[9]  Charles H. Bennett,et al.  Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. , 1992, Physical review letters.

[10]  Noam Nisan,et al.  Quantum circuits with mixed states , 1998, STOC '98.

[11]  Ran Raz,et al.  On the “log rank”-conjecture in communication complexity , 1995, Comb..

[12]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[13]  Ashwin Nayak,et al.  Optimal lower bounds for quantum automata and random access codes , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[14]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[15]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[16]  Alain Tapp,et al.  Quantum Entanglement and the Communication Complexity of the Inner Product Function , 1998, QCQC.

[17]  Lov K. Grover A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[18]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.