License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2017.15
URN: urn:nbn:de:0030-drops-81010
URL: http://drops.dagstuhl.de/opus/volltexte/2017/8101/
Go to the corresponding LIPIcs Volume Portal


Klauck, Hartmut

The Complexity of Quantum Disjointness

pdf-format:
LIPIcs-MFCS-2017-15.pdf (0.4 MB)


Abstract

We introduce the communication problem QNDISJ, short for Quantum (Unique) Non-Disjointness, and study its complexity under different modes of communication complexity. The main motivation for the problem is that it is a candidate for the separation of the quantum communication complexity classes QMA and QCMA. The problem generalizes the Vector-in-Subspace and Non-Disjointness problems. We give tight bounds for the QMA, quantum, randomized communication complexities of the problem. We show polynomially related upper and lower bounds for the MA complexity. We also show an upper bound for QCMA protocols, and show that the bound is tight for a natural class of QCMA protocols for the problem. The latter lower bound is based on a geometric lemma, that states that every subset of the n-dimensional sphere of measure 2^-p must contain an ortho-normal set of points of size Omega(n/p). We also study a "small-spaces" version of the problem, and give upper and lower bounds for its randomized complexity that show that the QNDISJ problem is harder than Non-disjointness for randomized protocols. Interestingly, for quantum modes the complexity depends only on the dimension of the smaller space, whereas for classical modes the dimension of the larger space matters.

BibTeX - Entry

@InProceedings{klauck:LIPIcs:2017:8101,
  author =	{Hartmut Klauck},
  title =	{{The Complexity of Quantum Disjointness}},
  booktitle =	{42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
  pages =	{15:1--15:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-046-0},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{83},
  editor =	{Kim G. Larsen and Hans L. Bodlaender and Jean-Francois Raskin},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/8101},
  URN =		{urn:nbn:de:0030-drops-81010},
  doi =		{10.4230/LIPIcs.MFCS.2017.15},
  annote =	{Keywords: Communication Complexity, Quantum Proof Systems}
}

Keywords: Communication Complexity, Quantum Proof Systems
Seminar: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
Issue Date: 2017
Date of publication: 22.11.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI