License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.06111.15
URN: urn:nbn:de:0030-drops-6161
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2006/616/
Go to the corresponding Portal

Sauerhoff, Martin

Quantum vs. Classical Read-Once Branching Programs

pdf-format:
06111.SauerhoffMartin.Paper.616.pdf (0.3 MB)

Abstract

A simple, explicit boolean function on 2n input bits is presented that is
computable by errorfree quantum read-once branching programs of size
O(n^3), while each classical randomized read-once branching program
and each quantum OBDD for this function with bounded two-sided error
requires size 2^{omega(n)}.

BibTeX - Entry

@InProceedings{sauerhoff:DagSemProc.06111.15,
  author =	{Sauerhoff, Martin},
  title =	{{Quantum vs. Classical Read-Once Branching Programs}},
  booktitle =	{Complexity of Boolean Functions},
  pages =	{1--13},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6111},
  editor =	{Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2006/616},
  URN =		{urn:nbn:de:0030-drops-6161},
  doi =		{10.4230/DagSemProc.06111.15},
  annote =	{Keywords: Quantum branching program, randomized branching program, read-once}
}

Keywords: Quantum branching program, randomized branching program, read-once
Collection: 06111 - Complexity of Boolean Functions
Issue Date: 2006
Date of publication: 20.11.2006

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI