• Home
  • Search
  • Quantum communication complexity of distribution testing
  • Open Access IconOpen Access
  • Cite Icon1
  • https://doi.org/10.26421/qic21.15-16-1Copy DOI Icon

Quantum communication complexity of distribution testing

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

The classical communication complexity of testing closeness of discrete distributions has recently been studied by Andoni, Malkin and Nosatzki (ICALP'19). In this problem, two players each receive $t$ samples from one distribution over $[n]$, and the goal is to decide whether their two distributions are equal, or are $\epsilon$-far apart in the $l_1$-distance. In the present paper we show that the quantum communication complexity of this problem is $\tilde{O}(n/(t\epsilon^2))$ qubits when the distributions have low $l_2$-norm, which gives a quadratic improvement over the classical communication complexity obtained by Andoni, Malkin and Nosatzki. We also obtain a matching lower bound by using the pattern matrix method. Let us stress that the samples received by each of the parties are classical, and it is only communication between them that is quantum. Our results thus give one setting where quantum protocols overcome classical protocols for a testing problem with purely classical samples.

Similar Papers
  • Research Article
  • Citations29

Classical versus quantum communication complexity

  • Sep 01, 1999
  • ACM SIGACT News
  • Amnon Ta-Shma
  • Conference Article
  • Citations10

Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity

  • Jun 01, 2008
  • Dmitry Gavinsky +1
  • Research Article
  • Citations8

Classical versus quantum communication in XOR games

  • Apr 05, 2018
  • Quantum Information Processing
  • Marius Junge +2
  • Conference Article
  • Citations388

Quantum vs. classical communication and computation

  • Jan 01, 1998
  • Harry Buhrman +2
  • Research Article

Quantum weakly nondeterministic communication complexity

  • Dec 22, 2012
  • Theoretical Computer Science
  • François Le Gall
  • Research Article
  • Citations18

Results on communication complexity classes

  • Apr 01, 1992
  • Journal of Computer and System Sciences
  • Tak Wah Lam
  • Conference Article
  • Citations127

Exponential separation of quantum and classical one-way communication complexity

  • Jun 13, 2004
  • Ziv Bar-Yossef +2
  • Conference Article
  • Citations6

Tensor norms and the classical communication complexity of nonlocal quantum measurement

  • May 22, 2005
  • Yaoyun Shi
  • Conference Article
  • Citations109

The pattern matrix method for lower bounds on quantum communication

  • May 17, 2008
  • Alexander A Sherstov
  • Conference Article

Algorithmic Game Theory (Tutorial)

  • Jan 01, 2015
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Paul W Goldberg
  • Research Article
  • Citations35

Quantum Proofs

  • Jan 01, 2016
  • Foundations and Trends® in Theoretical Computer Science
  • Thomas Vidick +1
  • Conference Article
  • Citations1

Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity

  • Jan 01, 2020
  • Toniann Pitassi +2
  • Research Article
  • Citations3

A ZPP NP[1] Lifting Theorem

  • Nov 08, 2020
  • ACM Transactions on Computation Theory
  • Thomas Watson
  • Conference Article
  • Citations73

The quantum communication complexity of sampling

  • Nov 08, 1998
  • A Ambainis +4
  • Book Chapter
  • Citations114

Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity

  • Jan 01, 2001
  • Jürgen Forster +5
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.