[00:00] Imagine I have a function and there's going to be one special number where if you input it to the function it returns true, but on all other inputs it returns false. And let's say you know that special input is somewhere among the first n numbers.
[00:15] allowed to do with this function is to simply try it out on inputs, On average, this would take N halvesteps and following the CS convention
[00:29] of disregarding constants like that 1/2 people would call this a runtime of big O of n. Now here's your for the equivalent version of this question. But in a quantum computer where you're given a function that is in a certain
[00:42] how many times would you have to use this mystery function to be able to find I threw this quiz up as a YouTube post giving the options of O of square root of N,
[00:56] O of log of N, O of log of log of N and O of one. would look like in that context, the question is not really coherent. In the responses on YouTube and also many other times that I've presented
[01:12] I just put up a full video describing how quantum If you just want the answer to this quiz, you can jump to the timestamp 3:50.
[01:24] content on your phone mood right now, but if at some point you want a half-hour explainer for the fundamentals of quantum computing walking you through a specific algorithm, well, that full video will be there waiting for you.