A quantum query algorithm for the graph collision problem

Details A quantum query algorithm for the graph collision problem A quantum query algorithm for the graph collision problem

2012-04-06

arxiv.org/abs/1204.1527v1

Physics

Quantum Physics

9 pages

Scientific paper

We construct a new quantum algorithm for the graph collision problem; that is, the problem of deciding whether the set of marked vertices contains a pair of adjacent vertices in a known graph G. The query complexity of our algorithm is O(sqrt(n)+sqrt(alpha*(G))), where n is the number of vertices and alpha*(G) is the maximum total degree of the vertices in an independent set of G. Notably, if G is a random graph where every edge is present with a fixed probability independently of other edges, then our algorithm requires O(sqrt(n log n)) queries on most graphs, which is optimal up to the sqrt(log n) factor on most graphs.

Affiliated with

Also associated with

No associations

Rating

A quantum query algorithm for the graph collision problem 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 A quantum query algorithm for the graph collision problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A quantum query algorithm for the graph collision problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-185630