Steve Simon - Topological Quantum Computing (Part 1) - CSSQI 2012
Вставка
- Опубліковано 22 лис 2012
- Professor Steve Simon, Department of Physics at Oxford University, lectures on topological quantum computing.
The lecture is the first of two parts, and was filmed at the Canadian Summer School on Quantum Information, held at the University of Waterloo in June of 2012.
For More:
iqc.uwaterloo.ca
/ quantumiqc
/ quantumiqc
QuantumFactory Blog: quantumfactory.wordpress.com - Наука та технологія
Thanks a lot to both the speaker and to IQC! This is a great introduction to an otherwise apparently esoteric subject. The presentation was very enjoyable with a nice historical and coherent narrative.
استاذ شرحه رائع جدا. شكرا على هذه المحاضرة القيمة.
Many thanks for such an amazing lecture. Excellent exquisite professor.
Thank you so much, this one video helped me a lot to understand topological qubits!
This is a good presentation, but the interferometer description (46:30) was kind of poor, I don't know what he meant by backscattering, "long" and "short" paths, these could have been explained much better by adding some more diagrams in his slides, and it didn't need much to add.
Very interesting talk, especially the historic part. Never heard about treating atoms as knots
I love this guy!
Nice explanation.
And to those who have not landed deeper in the field of mathematical logic, at least start with differentiating between non computer problems and computer problems that can be or can not be solved in reasonable time. There is a great difference that even an amateurs like me can appreciate at the start before diving deeper to disturb experts in this field for better or more explanations. And in this case, I research by focusing on a universal fact that, given an infinite doomains and ranges of input, a computer will provide an out put in finite (polynomial) time This is simple complexity from simple relativity point of view. Anything above or below logical scrutiny (proof and verification) is not a computer problem since computer problems are solved or unsolved in "reasonable" time.
And since math is human invention and creativity(not devinely inspired) what you need is just the ability to use your head mathematically plus
1-respectable hard work of finding other already made mathematical spare parts from other mathematicians to patch up your invention work effectively and efficiently.
2- evidence in support of your invention that it passes testable standards
Computers don't always output in polynomial time. You can easily write a program that just loops infinitely after reading a single input value.
Does anyone know the name of that video at 2:38? I really want to watch it if it's on youtube.
Search for vortex Cannon on UA-cam