A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
In this paper we present a quantum algorithm solving the triangle finding problem in unweighted graphs with query complexity Õ(n^5/4), where n denotes the number of vertices in the graph. This improves the previous upper bound O(n^9/7)=O(n^1.285...) recently obtained by Lee, Magniez and Santha. Our result shows, for the first time, that in the quantum query complexity setting unweighted triangle finding is easier than its edge-weighted version, since for finding an edge-weighted triangle BelovsarXiv:1407.0085v2 fatcat:it5egcbufngx3oabx56u4ipk3e