This lecture series is just awesome! I have yet to find a comprehensive series like this. Please do let us know how to join the next Qiskit Summer School, I will be really happy to join this :)
We need n inputs and m output bits. But because the operation is unitary (i.e. reversible, #inputs = #outputs), we need to keep additional n output bits for input, and m input bits for the output.
Thank you very much for this great lecture! However, I am confused by the term at minute 40:18: 1/sqrt * sum (-1)^f(x) * sum (-1)^(k dot x). Shouldn't the 2nd sum read: .. sum (-1)^(k dot |psi>_2)? As this whole exponent will become zero anyway, it won't turn out in the end, still I would appreciate if you could clarify, if I misunderstood something.
Thank you so much for putting this online. I feel so lucky to have come across this series. I wish Qiskit and Elisa the best!
This lecture series is just awesome! I have yet to find a comprehensive series like this. Please do let us know how to join the next Qiskit Summer School, I will be really happy to join this :)
This is the best lecture series I've seen so far. Thank you so much to Qiskit.
Thanks so much for this series of lectures. Elisa really explains this well.
Best lecture ever. Thanks to Elisa and IBM
I read this in Nielsen and Chuang, but didn't really understand the details until watching this lecture. Thanks!
Same. It’s an amazing textbook, but man do they cover this early and briefly.
Amazing! Learning so much I can feel my brain growing with each lecture
14:01 since f(x) is either 0 or 1, why would we still write (-1)**f(x)
At 35:04 - the output can be all 1s too right? - with U_f maps input only to 1
thank you Ellisa.
It's me, Mario!
thank you very much for these wodnerfull lectures
Wonderful explanation ... BIG THANKS
at 6:44 why again take m qubits as input when we already use n qubits for inputs.?
We need n inputs and m output bits. But because the operation is unitary (i.e. reversible, #inputs = #outputs), we need to keep additional n output bits for input, and m input bits for the output.
@@kimjongun5073 Thanks
Thank you very much for this great lecture! However, I am confused by the term at minute 40:18: 1/sqrt * sum (-1)^f(x) * sum (-1)^(k dot x). Shouldn't the 2nd sum read: .. sum (-1)^(k dot |psi>_2)? As this whole exponent will become zero anyway, it won't turn out in the end, still I would appreciate if you could clarify, if I misunderstood something.
brillant!! keep going
Input---| Oracle f(x) |----Output
well done