Home On relative complexity of quantum and classical branching programs
Article
Licensed
Unlicensed Requires Authentication

On relative complexity of quantum and classical branching programs

  • A.F. Gainutdinova
Published/Copyright: February 2, 2016
Become an author with De Gruyter Brill
Author Information Explore this Subject
Discrete Mathematics and Applications
From the journal Discrete Mathematics and Applications Volume 12 Issue 5

Abstract

We give a definition of a quantum branching program. A well-known Boolean function MODp is considered. We prove that any deterministic branching program and any probabilistic ordered stable branching program which (1/2 + ε)-compute the function MODp are of width no less than p. We construct a stable quantum branching program of width O(log p) which computes the function MODp with one-sided error ε > 0.

Published Online: 2016-2-2
Published in Print: 2002-10-1

© 2016 by Walter de Gruyter Berlin/Boston

Articles in the same Issue

  1. Editorial
  2. On permanents of random doubly stochastic matrices and asymptotic estimates of the nom hers of Latin rectangles and Latin squares
  3. On reversal of graph orientation
  4. The structure of an infinite Sylow subgroup in some periodic Shunkov groups
  5. Boolean lattices of multiply Ω-foliated formations
  6. Boolean lattices of n-multiply Ω-bicanonical Fitting classes
  7. On infinite groups with points
  8. Linear recurring sequence decimations with exponentially increasing step
  9. On ω-languages of special billiards
  10. On relative complexity of quantum and classical branching programs
  11. Forthcoming Papers
  12. Contents
https://doi.org/10.1515/dma-2002-0510

Articles in the same Issue

  1. Editorial
  2. On permanents of random doubly stochastic matrices and asymptotic estimates of the nom hers of Latin rectangles and Latin squares
  3. On reversal of graph orientation
  4. The structure of an infinite Sylow subgroup in some periodic Shunkov groups
  5. Boolean lattices of multiply Ω-foliated formations
  6. Boolean lattices of n-multiply Ω-bicanonical Fitting classes
  7. On infinite groups with points
  8. Linear recurring sequence decimations with exponentially increasing step
  9. On ω-languages of special billiards
  10. On relative complexity of quantum and classical branching programs
  11. Forthcoming Papers
  12. Contents
Sign up now to receive a 20% welcome discount
Institutional Access
How does access work?
Have an idea on how to improve our website?
Please write us.
© 2025 De Gruyter Brill
Downloaded on 30.11.2025 from https://www.degruyterbrill.com/document/doi/10.1515/dma-2002-0510/html
Scroll to top button