9 citations · 9 across the 1 of their papers we have counts for
2 papers
quant-ph2007★ 9 cited
The Quantum Query Complexity of Algebraic Properties
Sebastian Doern, Thomas Thierauf
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether is a semigroup or…
quant-ph2005
Quantum Complexity Bounds for Independent Set Problems
Sebastian Doern
We present quantum complexity lower and upper bounds for independent set problems in graphs. In particular, we give quantum algorithms for computing a maximal and a maximum indepen…