Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Lower bounds for one-way probabilistic communication complexity

Farid Mansurovich Ablayev

Published Jan 1, 1993• 16 citations
Publisher
DOI
10.1007/3-540-56939-1_76

Related papers

A linear lower bound on the unbounded error probabilistic communication complexity

Jürgen Forster

Journal of Computer and System Sciences•Dec 1, 2002•189 citations

On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity

Shengyu Zhang

Lecture notes in computer science•Jan 1, 2011•3 citations

New bounds on classical and quantum one-way communication complexity

Rahul Jain, Shengyu Zhang

arXiv:0802.4101•Theoretical Computer Science•Oct 18, 2008•14 citations

One-Way Communication Complexity and the Nečiporuk Lower Bound on Formula Size

Hartmut Klauck

In this paper the Nečiporuk method for proving lower bounds on the size of Boolean formulas is reformulated in terms of one-way communication complexity. We investigate the settings of probabilistic formulas, nondeterministic formulas, and quantum formulas. In all cases we can use results about one-way communication complexity to prove lower bounds on formula size. The main results regarding formula size are as follows: We show a polynomial size gap between probabilistic/quantum and deterministic formulas, a near-quadratic gap between the sizes of nondeterministic formulas with limited access to nondeterministic bits and nondeterministic formulas with access to slightly more such bits, and a near-quadratic lower bound on quantum formula size. Furthermore we give a polynomial separation between the sizes of quantum formulas with and without multiple read random inputs. The lower bound methods for quantum and probabilistic formulas employ a variant of the Nečiporuk bound in terms of the Vapnik–Chervonenkis dimension. To establish our lower bounds we show optimal separations between one-way and two-way protocols for limited nondeterministic and quantum communication complexity, and we show that zero-error quantum one-way communication complexity asymptotically equals deterministic one-way communication complexity for total functions.

arXiv:cs/0111062•SIAM Journal on Computing•Jan 1, 2007•36 citations

Fourier analysis for probabilistic communication complexity

Ran Raz

Computational Complexity•Sep 1, 1995•46 citations

On quantum and probabilistic communication: Las Vegas and one-way protocols

Hartmut Klauck

We investigate the power of quantum communication protocols compared to classical probabilistic protocols.In our first result we describe a total Boolean function that has a quantum Las Vegas protocol communicating at most O(N 1°/11+~) qubits for all e > 0, while any classical probabilistic protocol (with bounded error) needs ~(N/log N) bits.Then we investigate quantum one-way communication complexity.First we show that the VC-dimension lower bound on one-way probabilistic communication of [26] holds for quantum protocols, too.Then we prove that for oneway protocols computing total functions quantum Las Vegas communication is asymptotically as efficient as exact quantum communication, which is exactly as efficient as deterministic communication.We describe applications of the lower bounds for one-way communication complexity to quantum finite automata and quantum formulae.

ACM Symposium on Theory of Computing (STOC)•May 1, 2000•76 citations
In this paper the Nečiporuk method for proving lower bounds on the size of Boolean formulas is reformulated in terms of one-way communication complexity. We investigate the settings of probabilistic formulas, nondeterministic formulas, and quantum formulas. In all cases we can use results about one-way communication complexity to prove lower bounds on formula size. The main results regarding formula size are as follows: We show a polynomial size gap between probabilistic/quantum and deterministic formulas, a near-quadratic gap between the sizes of nondeterministic formulas with limited access to nondeterministic bits and nondeterministic formulas with access to slightly more such bits, and a near-quadratic lower bound on quantum formula size. Furthermore we give a polynomial separation between the sizes of quantum formulas with and without multiple read random inputs. The lower bound methods for quantum and probabilistic formulas employ a variant of the Nečiporuk bound in terms of the Vapnik–Chervonenkis dimension. To establish our lower bounds we show optimal separations between one-way and two-way protocols for limited nondeterministic and quantum communication complexity, and we show that zero-error quantum one-way communication complexity asymptotically equals deterministic one-way communication complexity for total functions.
We investigate the power of quantum communication protocols compared to classical probabilistic protocols.In our first result we describe a total Boolean function that has a quantum Las Vegas protocol communicating at most O(N 1°/11+~) qubits for all e > 0, while any classical probabilistic protocol (with bounded error) needs ~(N/log N) bits.Then we investigate quantum one-way communication complexity.First we show that the VC-dimension lower bound on one-way probabilistic communication of [26] holds for quantum protocols, too.Then we prove that for oneway protocols computing total functions quantum Las Vegas communication is asymptotically as efficient as exact quantum communication, which is exactly as efficient as deterministic communication.We describe applications of the lower bounds for one-way communication complexity to quantum finite automata and quantum formulae.