1 Search Results for "Sauerhoff, Martin"

Quantum vs. Classical Read-Once Branching Programs

Authors: Martin Sauerhoff

Published in: Dagstuhl Seminar Proceedings, Volume 6111, Complexity of Boolean Functions (2006)

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)}.

Cite as

Martin Sauerhoff. Quantum vs. Classical Read-Once Branching Programs. In Complexity of Boolean Functions. Dagstuhl Seminar Proceedings, Volume 6111, pp. 1-13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

  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/entities/document/10.4230/DagSemProc.06111.15},
  URN =		{urn:nbn:de:0030-drops-6161},
  doi =		{10.4230/DagSemProc.06111.15},
  annote =	{Keywords: Quantum branching program, randomized branching program, read-once}
  • Refine by Author
  • 1 Sauerhoff, Martin

  • Refine by Classification

  • Refine by Keyword
  • 1 Quantum branching program
  • 1 randomized branching program
  • 1 read-once

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2006

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail