Because...people, even famous people, can have interests and goals outside of those they're publicly known for? It seems fairly unsurprising to me that there exists a chess grandmaster who also has an interest in other strongly intellectual pursuits.
Maybe I’m wrong, Can someone explain? f is a classical black box. But U_f cant be a black box. Or It would take O( 2^n ) to brute force build it from f. Then it seems that the conclusion is that a quantum gray box is easier to crack. I’m confused.
That example was just an aside to illustrate how the "addition" works. The "addition" is actually a bitwise XOR, where there is no carrying. He wasn't implying that bit string (s=101) was the secret string for f(x).
I know this is a year later but i had the same question, the key is that the question does not say F(x)=x XOR s But it says, i guarantee that: F(x)=F(x XOR s) Meaning that this function has a special property that if you give it as input x, you will get the same answer as had you given it as input x XOR s. And with this extra bit of information tell me what S is I missed it the first few times 😅
Excellent explanation, thank you so much! I was confused for the longest time as to why this algorithm works but you made it seem simple =)
I have tried many different resources to understand this algorithm and yours is by far the best explanation! Thanks
why on earth is a chess grandmaster posting quantum info videos? but it's of great help ... needed this video badly
Because...people, even famous people, can have interests and goals outside of those they're publicly known for? It seems fairly unsurprising to me that there exists a chess grandmaster who also has an interest in other strongly intellectual pursuits.
Maybe I’m wrong, Can someone explain? f is a classical black box. But U_f cant be a black box. Or It would take O( 2^n ) to brute force build it from f. Then it seems that the conclusion is that a quantum gray box is easier to crack. I’m confused.
The example you give on mod 2 addition, doesn't compare to the table. Was that because you forgot to carry a 1 in the addition?
That example was just an aside to illustrate how the "addition" works. The "addition" is actually a bitwise XOR, where there is no carrying. He wasn't implying that bit string (s=101) was the secret string for f(x).
I know this is a year later but i had the same question, the key is that the question does not say
F(x)=x XOR s
But it says, i guarantee that:
F(x)=F(x XOR s)
Meaning that this function has a special property that if you give it as input x, you will get the same answer as had you given it as input x XOR s. And with this extra bit of information tell me what S is
I missed it the first few times 😅
@@sawneedles Thanks