Interaction in Quantum Communication and the Complexity of Set Disjointness

10/2001; DOI: 10.1145/380752.380786
Source: DBLP

ABSTRACT One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet in some scenarios there are ways of conveying information with much fewer, even exponentially fewer, qubits than possible classically [1], [2], [3]. Moreover, some of these methods have a very simple structure|they involve only few message exchanges between the communicating parties. We consider the question as to whether every classical protocol may be transformed to a simpler" quantum protocol|one that has similar eciency, but uses fewer message exchanges.

Download full-text


Available from: Hartmut Klauck, Feb 28, 2013
  • Source
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We develop a novel and powerful technique for communication lower bounds, the pattern matrix method. Specifically, fix an arbitrary function f : {0,1}n ! {0,1} and let Af be the matrix whose columns are each an application of f to some subset of the variables x1,x2,...,x4n. We prove that Af has bounded-error communication complexity ( d), where d is the approximate degree of f. This result remains valid in the quantum model, regardless of prior entanglement. In particular, it gives a new and simple proof of Razborov's breakthrough quantum lower bounds for disjointness and other symmetric predicates. We further characterize the discrepancy, approximate rank, and approximate trace norm of Af in terms of well-studied analytic properties of f, broadly generalizing several recent results on small-bias communication and agnostic learning. The method of this paper has recently enabled important progress in multiparty communication complexity.
    SIAM Journal on Computing 01/2011; 40:1969-2000. DOI:10.1137/080733644 · 0.76 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe , store S so that queries of the form “What is the predecessor of x in S?” can be answered efficiently. We study this problem in the cell probe model introduced by Yao [A.C.-C. Yao, Should tables be sorted, J. Assoc. Comput. Mach. 28 (3) (1981) 615-628]. Recently, Beame and Fich [P. Beame, F. Fich, Optimal bounds for the predecessor problem and related problems, J. Comput. System Sci. 65 (1) (2002) 38-72] obtained optimal bounds as functions of either m or n only on the number of probes needed by any deterministic query scheme if the associated storage scheme uses only cells of word size bits.
    Journal of Computer and System Sciences 05/2008; 74(3):364-385. DOI:10.1016/j.jcss.2007.06.016 · 1.09 Impact Factor