Quantum Algorithms - John Watrous - USEQIP 2012

Prof. John Watrous discusses quantum algorithms during the 2012 Undergraduate School on Experimental Quantum Information Processing (USEQIP) at the Institute for Quantum Computing.

For More:

[rifatulislamhimel]

At the point of 30:23, when Prof. Watrous made comments on making the efficient quantum circuit without keeping the input at the end, some questions hit me. How long does a qubit state remain as it is? Like if we pulled out a superposition state by sending a similar state to the input, how long would that superposition state remain? and if the state remains long enough, can't we use that output for the input of another quantum circuit? If it is possible then why would we throw qubit away to garbage rather than using those in some other circuits?

[deleriumk]

Aaronson himself agrees that it is not known with certainty whether classical can run QC in poly time. Just like it is not *commonly* known whether P and NP are one in the same. Post-IQP collapses the poly hierarchy if it can be simulated with a log algo... Not known again whether such an algo exists but this can collapse the exp probability which makes QC so difficult for classical machines

[jepkofficial]

Future programming is great but it would be nice to build one larger than 5 atoms first. :/

[dadogdlc]

idk why i am here i was watching guitar after like 5 videos this was next... HAHA

[ravimohan]

Its not a mistake. Its the truth which was told by Feynman. At classical level "nearly" all the quantum effects vanish.