44 citations · 47 across the 2 of their papers we have counts for
2 papers
quant-ph2005★ 3 cited
Quantum vs. Classical Read-once Branching Programs
Martin Sauerhoff
The paper presents the first nontrivial upper and lower bounds for (non-oblivious) quantum read-once branching programs. It is shown that the computational power of quantum and cla…
quant-ph2004★ 44 cited
Quantum Branching Programs and Space-Bounded Nonuniform Quantum Complexity
M. Sauerhoff, D. Sieling
In this paper, the space complexity of nonuniform quantum computations is investigated. The model chosen for this are quantum branching programs, which provide a graphic descriptio…