This is part of a winter school on optimization theory and quantum computing held for members of a quantum computing consortium based in Germany. Several lectures are planned, and they will be uploaded in the coming month. Sincerely, Tobias Osborne
Hi, many thanks! I'm around the minute 58:00 and struggling to find exactly what this "sigma ^zeta" "F" means in simplified terms of quantum computing. I'll try to pose my question as this: which resource (like a wikipedia page) should I lookup to expect to find the definition p("click") = tr( ho F)? Where in the literature is this F defined?
btw, maybe one of the best classes i ever watched about anything (I hope someday I'll post a wikipedia page to AI and ask "explain me this as it was Tobias Osborne!!) 🤣
in one course of QM a professor said that physicists use a special kind of Probability theory where the amplitudes are what is added. Wouldnt it be more precise to say that QM is a pseudo-probabilistic?
Many thanks for your comment: I am using the terminology with reference to "generalized probabilistic theories", of which QM is an example. See e.g., en.wikipedia.org/wiki/Generalized_probabilistic_theory Sincerely, Tobias Osborne
Are the Quantum gates mentioned in this lecture special cases of Quantum channels? The lecture itself is very clear, I'm just wondering whether these are somewhat related
Yes they are directly related: to every gate U there is a corresponding quantum channel E given by E(rho) = U rho U^dagger I hope this helps; sincerely, Tobias Osborne
is this a first lesson of the quantum information course?
This is part of a winter school on optimization theory and quantum computing held for members of a quantum computing consortium based in Germany. Several lectures are planned, and they will be uploaded in the coming month. Sincerely, Tobias Osborne
@@tobiasjosborne can you please upload the rest of the lectures ?
sincerely
Aravind
@@aravin314 In the end these were only these two lectures on QM and there were no further lectures.
Thanks Tobias very nice lecture. In less than two hours I get very fundamental understanding on QC
Hi, many thanks! I'm around the minute 58:00 and struggling to find exactly what this "sigma ^zeta" "F" means in simplified terms of quantum computing. I'll try to pose my question as this: which resource (like a wikipedia page) should I lookup to expect to find the definition p("click") = tr(
ho F)? Where in the literature is this F defined?
btw, maybe one of the best classes i ever watched about anything (I hope someday I'll post a wikipedia page to AI and ask "explain me this as it was Tobias Osborne!!) 🤣
Beautiful lecture, thank you for sharing.
Here is the playlist for the whole sequence, changing between classical and quantum computation:
ruclips.net/p/PL48X6M57PpK83hqVPHYQWfllF3zJSL-XK
where does F come from ? i havent seen this on any source i have used so far
is this part of some course @ the LUH?
Many thanks for your comment. Please see my response to lorenzo magro above.
Sincerely,
Tobias Osborne
in one course of QM a professor said that physicists use a special kind of Probability theory where the amplitudes are what is added. Wouldnt it be more precise to say that QM is a pseudo-probabilistic?
Many thanks for your comment: I am using the terminology with reference to "generalized probabilistic theories", of which QM is an example. See e.g.,
en.wikipedia.org/wiki/Generalized_probabilistic_theory
Sincerely,
Tobias Osborne
@@tobiasjosborne thank you but then is a different story. I have never heard of a generalized PT
@@tobiasjosborne also, do you think its possible to give QM a non-probabilistic interpretation?
Are the Quantum gates mentioned in this lecture special cases of Quantum channels? The lecture itself is very clear, I'm just wondering whether these are somewhat related
Yes they are directly related: to every gate U there is a corresponding quantum channel E given by
E(rho) = U rho U^dagger
I hope this helps; sincerely,
Tobias Osborne
Yeah yeah yeah easy as that.