Join
Quantum query complexity of triangle finding
Close the gap between the Ω(n) lower bound and O(n^1.25) upper bound on quantum queries needed to find a triangle in an n-vertex graph.
Comparing changes
Choose two branches to see what changed, then open a pull request to bring the work across.
Pick two different branches
A pull request can go from any branch into any other.