Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
On relative complexity of quantum and classical branching programs
-
A.F. Gainutdinova
Veröffentlicht/Copyright:
2. Februar 2016
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
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Editorial
- On permanents of random doubly stochastic matrices and asymptotic estimates of the nom hers of Latin rectangles and Latin squares
- On reversal of graph orientation
- The structure of an infinite Sylow subgroup in some periodic Shunkov groups
- Boolean lattices of multiply Ω-foliated formations
- Boolean lattices of n-multiply Ω-bicanonical Fitting classes
- On infinite groups with points
- Linear recurring sequence decimations with exponentially increasing step
- On ω-languages of special billiards
- On relative complexity of quantum and classical branching programs
- Forthcoming Papers
- Contents
Artikel in diesem Heft
- Editorial
- On permanents of random doubly stochastic matrices and asymptotic estimates of the nom hers of Latin rectangles and Latin squares
- On reversal of graph orientation
- The structure of an infinite Sylow subgroup in some periodic Shunkov groups
- Boolean lattices of multiply Ω-foliated formations
- Boolean lattices of n-multiply Ω-bicanonical Fitting classes
- On infinite groups with points
- Linear recurring sequence decimations with exponentially increasing step
- On ω-languages of special billiards
- On relative complexity of quantum and classical branching programs
- Forthcoming Papers
- Contents
