When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-6161
Go to the corresponding Portal

Sauerhoff, Martin

Quantum vs. Classical Read-Once Branching Programs

06111.SauerhoffMartin.Paper.616.pdf (0.3 MB)


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

  author =	{Martin Sauerhoff},
  title =	{Quantum vs. Classical Read-Once Branching Programs},
  booktitle =	{Complexity of Boolean Functions},
  year =	{2006},
  editor =	{Matthias Krause and Pavel Pudl{\'a}k and R{\"u}diger Reischuk and Dieter van Melkebeek},
  number =	{06111},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{},
  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