the algoritm itself seems quite straightforward and this presentation is really easy to understand. However I can't quite wrap my mid around the Uf operator... I mean, how can you implement such a gate physically without already knowing the function f.
Missed the most important part, how to encode the values being searched as input to Grover's algorithm. This video just shows how to get 100% yes result for absolutely anything you try to search for in a balanced superposition ... |00> yep, it's there. |01> , yep, etc. Kinda silly example?
@@bobkr4725Yes but how does it know that it needs to apply a CZ gate to 1/2 |11>? Why not apply a CZ gate to 1/2 |00> ? Because otherwise, you would already where your element is.
@@ionescualexandru4748 from what I understand halfway so far: What we already know is the condition that the element needs to fulfil. And we check every state at once in the magic realm quantum computing, hence we know in one iteration where our element is. I will try to correct myself if I notice a mistake here P.S.: I was right. In the example, |11> was assumed as an output of the oracle block which finds the element. So the whole part you're / we're talking about in this thread is to amplify the already found element so that we can measure it at the output correctly.
Clear and concise explanation!
the algoritm itself seems quite straightforward and this presentation is really easy to understand. However I can't quite wrap my mid around the Uf operator... I mean, how can you implement such a gate physically without already knowing the function f.
Missed the most important part, how to encode the values being searched as input to Grover's algorithm. This video just shows how to get 100% yes result for absolutely anything you try to search for in a balanced superposition ... |00> yep, it's there. |01> , yep, etc. Kinda silly example?
How does it comes to know what is amplitude of the target i.e which amplitude to increase?
The Oracle marks target state by multiplying it on "-1". It's often made by using Z or CZ gates.
@@bobkr4725Yes but how does it know that it needs to apply a CZ gate to 1/2 |11>? Why not apply a CZ gate to 1/2 |00> ? Because otherwise, you would already where your element is.
The same questions as you, all tutorials are fuzzy about this point !@@ionescualexandru4748
@@ionescualexandru4748 from what I understand halfway so far: What we already know is the condition that the element needs to fulfil. And we check every state at once in the magic realm quantum computing, hence we know in one iteration where our element is.
I will try to correct myself if I notice a mistake here
P.S.: I was right. In the example, |11> was assumed as an output of the oracle block which finds the element. So the whole part you're / we're talking about in this thread is to amplify the already found element so that we can measure it at the output correctly.
Great Explanation
From the bottom of heart I thank for the videos .. I would like to donate to if you accept
beautiful and brilliant.
genetic lottery winner right here.
fr fr
Why isn't there a link to the playlist below the video??? Dear o dear, you all just live in your own small world, right? Poor creatures.
useless just read the slides
This is a horrible presentation. The lecturer must know that ANYONE CAN READ SLIDES!