Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds

  title={Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds},
  author={Hartmut Klauck},
  • H. Klauck
  • Published in FSTTCS 11 December 2004
  • Computer Science, Mathematics
We derive lower bounds for tradeoffs between the communication C and space S for communicating circuits. The first such bound applies to quantum circuits. If for any problem f: X x Y → Z the multicolor discrepancy of the communication matrix of f is 1/2 d , then any bounded error quantum protocol with space S, in which Alice receives some I inputs, Bob r inputs, and they compute f(x i ,y j ) for the l . r pairs of inputs (x i ,y i ) needs communication C = ω(lrd log |Z|/S). In particular, n x n… 

Quantum and classical strong direct product theorems and optimal time-space tradeoffs

Theorems for the classical as well as quantum query complexity of the OR function are established, which imply a time-space tradeoff T/sup 2/S = /spl Omega/(N/sup 3/) for sorting N items on a quantum computer, which is optimal up to polylog factors.

Space-bounded communication complexity

This work introduces memory models for 2-party communication complexity, obtaining memory hierarchy theorems, and showing super-linear lower bounds for some explicit (non-boolean) functions.

The Power of One Clean Qubit in Communication Complexity

There is a quantum protocol using one clean qubit only and using $O(\log n)$ qubits of communication, such that any classical protocol simulating the acceptance behaviour of the quantum protocol within additive error needs communication $\Omega(n)$.

Strong direct product conjecture holds for all relations in public coin randomized one-way communication complexity

It is shown that if for computing f^k (k independent copies of f), o(k R 1/3(f) communication is provided, then the success is exponentially small in k, which settles the strong direct product conjecture for all relations in public coin one-way communication complexity.

Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract

The subdistribution bound is introduced, which is a relaxation of the well-studied rectangle or corruption bound in communication complexity, and it is shown that for the communication complexity of Boolean functions with constant error, the subdist distribution bound is the same as the latter measure, up to a constant factor.

Strong direct product theorems for quantum communication and query complexity

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.

On Arthur Merlin Games in Communication Complexity

  • H. Klauck
  • Computer Science
    2011 IEEE 26th Annual Conference on Computational Complexity
  • 2011
Lower bounds for the QMA-communication complexity of the functions Inner Product and Disjointness are shown, and how one can 'transfer' hardness under an analogous measure in the query complexity model to the communication model using Sherstov's pattern matrix method is described.

New Bounds for the Garden-Hose Model

Improved lower bounds based on non-deterministic communication complexity (leading to the previously unknown $\Theta(n)$ bounds for Inner Product mod 2 and Disjointness), as well as an upper bound for the Distributed Majority function (previously conjectured to have quadratic complexity).

Communication memento: Memoryless communication complexity

It is shown that the memoryless communication complexity of F characterizes the logarithm of the size of the smallest bipartite branching program computing $F$ (up to a factor 2); exponential separations between the classical variants of memoryless Communication models are given; and exponential quantum-classical separations in the four variants of the memorylessness communication model are exhibited.

New Strong Direct Product Results in Communication Complexity

  • Rahul Jain
  • Computer Science, Mathematics
    Electron. Colloquium Comput. Complex.
  • 2011
It is proved that the new complexity measure gives a tight lower bound of Ω(n) for the set-disjointness problem on n-bit inputs (this strengthens the linear lower bound on the rectangle/corruption bound for set- Disjoints shown by Razborov [1992]).



Lower bounds for quantum communication complexity

  • H. Klauck
  • Computer Science
    Proceedings 2001 IEEE International Conference on Cluster Computing
  • 2001
This work generalizes a method for proving classical communication complexity lower bounds to the quantum case, and develops several other Fourier based lower bound methods, notably showing that /spl radic/(s~(f)/log n) n, for the average sensitivity of a function f, yields a lower bound on the bounded error quantum communication complexity.

Quantum vs. classical communication and computation

A simple and general simulation technique is presented that transforms any black-box quantum algorithm to a quantum communication protocol for a related problem, in a way that fully exploits the quantum parallelism, to obtain new positive and negative results.

Quantum and classical strong direct product theorems and optimal time-space tradeoffs

Theorems for the classical as well as quantum query complexity of the OR function are established, which imply a time-space tradeoff T/sup 2/S = /spl Omega/(N/sup 3/) for sorting N items on a quantum computer, which is optimal up to polylog factors.

Improved Quantum Communication Complexity Bounds for Disjointness and Equality

It is shown that the complexities of the disjointness and equality problems of exact and non-deterministic protocols are all equal to n+1, the previous best lower bound being n/2.

Limitations of quantum advice and one-way communication

  • S. Aaronson
  • Computer Science
    Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.
  • 2004
It is shown in three settings that quantum messages have only limited advantages over classical ones, and the polynomial method is used to give the first correct proof of a direct product theorem for quantum search.

Trade-Offs between Communication and Space

Rectangle size bounds and threshold covers in communication complexity

  • H. Klauck
  • Mathematics, Computer Science
    18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.
  • 2003
This work investigates the power of the most important lower bound technique in randomized communication complexity, which is based on an evaluation of the maximal size of approximately monochromatic rectangles, with respect to arbitrary distributions on the inputs, and disproves the conjecture that the lower bound method is polynomially tight for randomized communications complexity.

The Cost of the Missing Bit: Communication Complexity with Help

The multiparty communication model of Chandra, Furst, and Lipton (1983) is generalized to functions with b-bit output, and families of explicit functions for which bits of communication are required to find the "missing bit" are constructed.

Direct product results and the GCD problem, in old and new communication models

The improved parallel repetition theorem of 2-prover games is applied to derive, for the first time, a direct product theorem for communication complexity, based on interaction between the two models.

Quantum time-space tradeoffs for sorting

The complexity of sorting in the model of sequential quantum circuits is investigated and the following lower bound on the time-space tradeoff for sorting numbers from a polynomial size range is shown: <i>TS</i>=Ω(<i>n</i><sup>3/2</sup>).