It does show how 2-bit quantum search is faster than conventional, requiring onl... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		jcoffland on Dec 12, 2017 \| parent \| context \| favorite \| on: An Interactive Introduction to Quantum Computing It does show how 2-bit quantum search is faster than conventional, requiring only one evaluation of the oracle function instead of three.

avodonosov on Dec 12, 2017 [–]

In the second part and not explaining the principle.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact