Quantum Complexity Bounds for Independent Set Problems
Quantum Physics
2007-05-23 v3
Abstract
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 independent set in a graph. We present applications of these algorithms for some graph problems. Our results improve the best classical complexity bounds for the corresponding problems.
Cite
@article{arxiv.quant-ph/0510084,
title = {Quantum Complexity Bounds for Independent Set Problems},
author = {Sebastian Doern},
journal= {arXiv preprint arXiv:quant-ph/0510084},
year = {2007}
}
Comments
12 pages, 0 figures