Top Comments
All Comments (27)
-
okay, ummkay, okay, mmkay
-
What Aaronson is saying is that your exponential run time task is not done in linear time because of a sort of massively parallel calculation, but because of the essence of the quantum computer: you shoot the electrons just once and get ONE task done, not many tasks simultaneously.
Think about a computer automatically counting in the base of the size of your input. You don't have to try many solutions (e.g SAT values combinations), all of them are checked in one calculation.
-
He obviously knows this stuff, he appears to have spent years researching this, but I don't understand the part where he says that QC cannot be thought of as parallel computing. If an quantum system sits in an state of superposition of all possible solutions, it is not only parallel, it is massively parallel, even hyper-parallel.
-
This was interesting.
-
I am very happy to see the vidoe Scott Aaronson, an expert in the realm of computational complexity theory and the founder after you give this
-
I Love The Video Scott Aaronson, an expert in the realm of computational complexity theory and the founder It Can Increase My Knowledge
-
Steady I Really Like This Video Scott Aaronson, an expert in the realm of computational complexity theory and the founder
-
mmmmm...okay
-
@MarthamadaySaamanu new to me!
-
Jazz hands..OK?... Actually sarcasm aside..this was a very interesting talk thank you Scott :)
Scott Aaronson starts at 4:30
yp06407012 8 months ago 36
love how giddy he gets when he talks about P and NP. really shows his enthusiasm for the field
carl14706 8 months ago 13