Quantum Complexity Bounds for Independent Set Problems

Details Quantum Complexity Bounds for Independent Set Problems Quantum Complexity Bounds for Independent Set Problems

2005-10-12

arxiv.org/abs/quant-ph/0510084v3

Physics

Quantum Physics

12 pages, 0 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Quantum Complexity Bounds for Independent Set Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Complexity Bounds for Independent Set Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Complexity Bounds for Independent Set Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-686080