Lecture 2.1 - Simple Quantum Algorithms I

preview_player
Показать описание

Lecturer: Elisa Bäumer

Lecture Notes and Labs:

The Qiskit Global Summer School 2021 was a two-week intensive summer school designed to empower the next generation of quantum researchers and developers with the skills and know-how to explore quantum applications on their own. This second-annual course, made up of twenty lectures, five applied lab exercises, hands-on mentorship, and live Q&A sessions, focused on developing hands-on experience and understanding of quantum machine learning.

#Qiskit #QuantumMachineLearning #QGSS21
Рекомендации по теме
Комментарии
Автор

Isn't this just awesome. Thank you Elisa Baumer. Deutsh-Jozsa Algorithm now well understood...☺

victoradeyemi
Автор

20:06 k*x^t (to get a sign, e.g. (01)*(01)^t= 1, thus the sign before |01> will be (-1)^1 = -1)

the same for 29:47: \Psi_0^t

victoriaporozova
Автор

Can you please give a single real-life example of an application where we need to differentiate between balanced functions and constant functions?

fakharzaman
Автор

The key question is how to implement arbitrary oracles with quantum circuits, such as oracle_f = sigmoid(x)

rx
Автор

How realistic is the demand that the result must always be constant or balanced?

byronwatkins
Автор

10:02 confusion
|1⊕1> = |0>
How?
Carry bit lost as one bit only??
Or something else?

rahuldeo
Автор

28:12 : what if we get 111....1 bitstring? isn't it balanced?

lenishpandey
Автор

i waqs wondering if anyone can explain 8:03

sarkersaadahmed
Автор

You should instead use variables to explain a system that you have built given a set of quantum hardware components. Quantum mechanics opens up many possibilities.Does the listener want to learn about your quantum software or be reminded of quantum theory.

calebhaines
Автор

Write neatly if possible...or atleast write bigger this ...like ants path? Use full screen

nalayakshindra