Editing Quantum algorithm (section)

===Triangle-finding problem===
{{main|Triangle finding problem}}

The triangle-finding problem is the problem of determining whether a given graph contains a triangle (a [[clique (graph theory)|clique]] of size 3). The best-known lower bound for quantum algorithms is <math>\Omega(N)</math>, but the best algorithm known requires O(''N''<sup>1.297</sup>) queries,<ref>{{cite arXiv| eprint=1105.4024| author1=Aleksandrs Belovs| title=Span Programs for Functions with Constant-Sized 1-certificates| class=quant-ph| year=2011}}</ref> an improvement over the previous best O(''N''<sup>1.3</sup>) queries.<ref name=Search_via_quantum_walk>
{{cite conference
 |last1=Magniez |first1=F.
 |last2=Nayak |first2=A.
 |last3=Roland |first3=J.
 |last4=Santha |first4=M.
 |year=2007
 |title=Search via quantum walk
 |book-title=Proceedings of the 39th Annual ACM Symposium on Theory of Computing
 |publisher=[[Association for Computing Machinery]]
 |pages=575–584
 |doi=10.1145/1250790.1250874
 |isbn=978-1-59593-631-8
|arxiv=quant-ph/0608026}}</ref><ref>
{{cite journal
 |last1=Magniez |first1=F.
 |last2=Santha |first2=M.
 |last3=Szegedy |first3=M.
 |year=2007
 |title=Quantum Algorithms for the Triangle Problem
 |journal=[[SIAM Journal on Computing]]
 |volume=37 |issue=2 |pages=413–424
 |arxiv= quant-ph/0310134
 |doi=10.1137/050643684
|s2cid=594494
 }}</ref>