Corpus ID: 236428900

On relating one-way classical and quantum communication complexities

  title={On relating one-way classical and quantum communication complexities},
  author={Naresh Goud Boddu and Rahul Jain and Han-Hsuan Lin},
Let f : X × Y → {0, 1,⊥} be a partial function and μ be a distribution with support contained in f(0)∪f(1). Let D ǫ (f) be the classical one-way communication complexity of f with average error under μ at most ǫ, Q ǫ (f) be the quantum one-way communication complexity of f with average error under μ at most ǫ and Q ǫ (f) be the entanglement assisted one-way communication complexity of f with average error under μ at most ǫ. We show: 1. If μ is a product distribution, then ∀ǫ, η > 0, D 1,μ 2… Expand


New bounds on classical and quantum one-way communication complexity
In the quantum one-way model, a lower bound on the distributional communication complexity, under product distributions, of a function f is provided, in terms of the well studied complexity measure of f referred to as the rectangle bound or the corruption bound of f. Expand
Multiparty quantum communication complexity.
This work constructs a function G such that for the one-round communication model and three parties, G can be computed with n+1 bits of communication when the parties share prior entanglement and if no entangled particles are provided, then F is roughly k*log(k). Expand
Some complexity questions related to distributive computing(Preliminary Report)
  • A. Yao
  • Computer Science, Mathematics
  • STOC
  • 1979
The quantity of interest, which measures the information exchange necessary for computing f, is the minimum number of bits exchanged in any algorithm. Expand
Exponential separations for one-way quantum communication complexity, with applications to cryptography
We give an exponential separation between one-way quantum and classical communication protocols for twopartial Boolean functions, both of which are variants of the Boolean Hidden Matching Problem ofExpand
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. Expand
Dense quantum coding and a lower bound for 1-way quantum automata
An exponential lower bound on the size of 1-way quantum finite automata for a family of languages accepted by linear sized deterministic finite automaton is proved. Expand
Quantum Circuit Complexity
  • A. Yao
  • Mathematics, Computer Science
  • FOCS
  • 1993
It is shown that any function computable in polynomial time by a quantum Turing machine has aPolynomial-size quantum circuit, and this result enables us to construct a universal quantum computer which can simulate a broader class of quantum machines than that considered by E. Bernstein and U. Vazirani (1993), thus answering an open question raised by them. Expand
The Bounded-Storage Model in the Presence of a Quantum Adversary
It is proved that certain extractors are suitable for key expansion in the bounded-storage model where the adversary has a limited amount of quantum memory. Expand
Reversing quantum dynamics with near-optimal quantum and classical fidelity
We consider the problem of reversing quantum dynamics, with the goal of preserving an initial state’s quantum entanglement or classical correlation with a reference system. We exhibit an approximateExpand
Probabilistic computations: Toward a unified measure of complexity
  • A. Yao
  • Computer Science
  • 18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
  • 1977
Two approaches to the study of expected running time of algoritruns lead naturally to two different definitions of intrinsic complexity of a problem, which are the distributional complexity and the randomized complexity, respectively. Expand