Відео

This video makes generating a GHZ state so clear! Thanks for the awesome high-quality content!

Thanks! Excellent explanation

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?

Great lecture!

На мой арифметически простой взгляд, Сфера Блоха - это *не* физический объект. Можно сказать, что это условное вспомогательное мнемоническое представление о характере взаимодействия физических объектов. Природа не оперирует подобными трансцендентными представлениями. Поэтому на их основе невозможно строить логически правильные умозаключения о практической реализации этих представлений. 08.09.2024.

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.

Very good video thanks Hadamard gates always get confusing for me due to the blending of 0 and 1 qbit. IBM's qiskit handbook gets kind of confusing.

Clear and concise explanation!

this is very help full to understand , but video has audio problem @UChicago will fix it

1/root(2) [a|000>+a|011>+b|100>+b|111>] applying cnot where q1 is target and q2 & q3 are targets , we get 1/root(2) [a|000>+a|011>+b|111>+b|100>] but how are you getting 1/root(2) [a|000>+a|011>+b|101>+b|110>]

00:01 Quantum computer efficiency in cryptography and AI. 00:46 Quantum algorithms can solve problems with fewer guesses than classical algorithms 01:27 Quantum computers could render RSA cryptography useless 02:08 Black box is ideal for constructing quantum algorithms due to its generality. 02:50 Quantum Oracle outputs 1 only if both inputs are 1. 03:35 Quantum Oracle's must be reversible with equivalent inputs and outputs 04:20 Quantum computers can determine if an Oracle's function is constant or balanced efficiently 05:01 Quantum algorithm is more efficient due to asking the Oracle fewer times. Crafted by Merlin

Hi @Qunatum Computing, I have a doubt. In the Hamiltonian -1.0467 is the coefficient of sigma z I, why is it told in the video that we are trying to get +1 so that it cancel out with the coefficient of sigma z I ? Ultimately Hamiltonian as a whole should be smaller value right, so should'nt we try to make it more negative by getting -1 ?

i need cutqc HPC code any one have

thankyou

Amazing simplest explanation, Thank you

Amazing explanation

I like how those videos simplified quantum computing… thanks for your work 😊

useless just read the slides

It's so tough to not type "First Comment". So sorry my Quantum friends who will see this comment.

2:30 why that must be the initial state? three white balls and one black ball?

amazing! thanks for the videos!!

Emma stone?

I'm sorry but I find the explanations on both Bernstein-Vazirani and Archimedes to be very confusing and uneffective. They should really be improved and prepared better by the lecturer.

great video! benefit a lot from ur channel! please keep it up

very helpful! Big thanks to the video

Very helpful! Thank you!

How does it comes to know what is amplitude of the target i.e which amplitude to increase?

i am writing a paper on QUANTUM COMPUTING ADVANCEMENTS: IMPLICATIONS FOR CYBERSECURITY and i have been looking for the easiest way to explain this Shor's Algorithm. Thanks for this informative video

@ 26:33 Nice to know, but why?

@ 13:31 Quantum Teleportation. And without any derivation he concludes: @ 19:29

A bit more energy and enthusiasm in the presentation wouldn't have hurt this video.

Great Explanation

From the bottom of heart I thank for the videos .. I would like to donate to if you accept

Very helpful thankyou… Please forgive me to help you… muchly no slight intended… Etcetera has no ‘k’

Fantastic video!

This is fantastic! 😄

Thanks

Is the archimedes ORACLE a theoretical construct in quantum computing that can be used as a building block for certain types of quantum algorithms or a real algorithm with practical use like Bosch's?

beautiful and brilliant. genetic lottery winner right here.

Simple and clear.

Didactic lecture. Thank you.

Suggestion: A translucent basketball or some 3D image may result in better comprehension of viewers

A perfect answer to a question I struggled with! Thank you!

Way above my head..... thank god we have such smart people

0

Nice superposition examples--they require a change in our own perspective.

6:45 negative sign sounds like reflections which can be realized via transmission line theory. Open circuit, closed circuit and maximum power transfer into the load with no reflection are three cases.

This narrator has terrible diction. Please enunciate next time.

You are just awesome and I have an interview tomorrow with certain topics which is luckily covered here..Thank you soo much

Thankyou so much!