The Quantum Query Complexity of Algebraic Properties
Quantum Physics
2007-05-23 v1
Abstract
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 has an identity element. If S is a monoid, we want to decide whether S is a group. We present quantum algorithms for these problems that improve the best known classical complexity bounds. In particular, we give the first application of the new quantum random walk technique by Magniez, Nayak, Roland, and Santha that improves the previous bounds by Ambainis and Szegedy. We also present several lower bounds for testing algebraic properties.
Cite
@article{arxiv.0705.1446,
title = {The Quantum Query Complexity of Algebraic Properties},
author = {Sebastian Doern and Thomas Thierauf},
journal= {arXiv preprint arXiv:0705.1446},
year = {2007}
}