On the Quantum Query Complexity of Detecting Triangles in Graphs

Details On the Quantum Query Complexity of Detecting Triangles in Graphs On the Quantum Query Complexity of Detecting Triangles in Graphs

2003-10-16

arxiv.org/abs/quant-ph/0310107v2

Physics

Quantum Physics

13 pages

Scientific paper

We show that in the quantum query model the complexity of detecting a
triangle in an undirected graph on $n$ nodes can be done using $O(n^{1+{3\over
7}}\log^{2}n)$ quantum queries. The same complexity bound applies for
outputting the triangle if there is any. This improves upon the earlier bound
of $O(n^{1+{1\over 2}})$.

Affiliated with

Also associated with

No associations

Rating

On the Quantum Query Complexity of Detecting Triangles in Graphs 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 On the Quantum Query Complexity of Detecting Triangles in Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Quantum Query Complexity of Detecting Triangles in Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-22502