Classical vs. Quantum Read-Once Branching Programs


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), while each classical randomized read-once branching program and each quantum OBDD for this function with bounded twosided error requires size 2. 


Cite this paper

@inproceedings{Sauerhoff2006ClassicalVQ, title={Classical vs. Quantum Read-Once Branching Programs}, author={Martin Sauerhoff}, year={2006} }