Content deleted Content added
m →BQP-complete problems: minor wording improvements |
m Open access bot: doi added to citation with #oabot. |
||
Line 220:
|bibcode=
|doi=10.4086/toc.2005.v001a003
|doi-access=free
}}</ref> and Kutin<ref>
{{cite journal
|last1=Kutin |first1=S.
Line 229 ⟶ 230:
|bibcode=
|doi=10.4086/toc.2005.v001a002
|doi-access=free
}}</ref> independently (and via different proofs) extended his work to obtain the lower bound for all functions.
===Triangle-finding problem===
Line 314 ⟶ 316:
|volume=15 |pages=38–43
|doi=10.1112/S1461157012000046
|doi-access=free
}}</ref> A quantum algorithm requires <math>\Omega(k^{2/3})</math> queries but the best known algorithm uses <math>O(k^{2/3} \log k)</math> queries.<ref>
{{cite journal
| |||