Revision as of 22:19, 13 May 2020 edit InternetArchiveBot (talk \| contribs) Bots, Pending changes reviewers 5,680,027 edits Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0 ← Previous edit		Revision as of 22:26, 29 May 2020 edit undo Kjslag (talk \| contribs) 52 edits →Element distinctness problem: Remove confusing phrase since both algorithms require the same number of queries Next edit →
Line 194: {{main\|Element distinctness problem}} The element distinctness problem is the problem of determining whether all the elements of a list are distinct. Classically, Ω(''N'') queries are required for a list of size ''N''~~, since this problem is harder than the search problem which requires Ω(''N'') queries~~. However, it can be solved in <math>\Theta(N^{2/3})</math> queries on a quantum computer. The optimal algorithm is by [[Andris Ambainis]].<ref> {{cite journal \|last=Ambainis \|first=A.

Quantum algorithm: Difference between revisions