ProV Logo
0

Quantum Algorithm for Triangle Finding i...
Gall, Francois Le...
Quantum Algorithm for Triangle Finding in Sparse Graphs by Gall, Francois Le ( Author )
N.A
24-07-2015
This paper presents a quantum algorithm for triangle finding over sparse graphs that improves over the previous best quantum algorithm for this task by Buhrman et al. [SIAM Journal on Computing, 2005]. Our algorithm is based on the recent O~(n5/4)-query algorithm given by Le Gall [FOCS 2014] for triangle finding over dense graphs (here n denotes the number of vertices in the graph). We show in particular that triangle finding can be solved with O(n5/4−ϵ) queries for some constant ϵ>0 whenever the graph has at most O(n2−c) edges for some constant c>0.
-
Article
pdf
36.88 KB
English
-
MYR 0.00
-
https://arxiv.org/abs/1507.06878
Share this eBook