Quantum Computing and the P vs. NP Problem.

In this video we discuss how Quantum Computing can impact and be impacted by the famous millennium problem P vs. NP. This video is lighter on the mathematics and exemplifies the strengths of quantum computer. This series will be continuing live every Wednesday around 1pm.

Stream Schedule:
Su, W;1pm-4pm EDT
Friday Study Stream 9 am EDT

Intro/Outro music by Memitim

It's important to me that this content remain free so any contributions help progress the stream and the content to provide the best experience I can give. Never necessary, always appreciated.

[JVerstry]

Mmmm... Around the 15th minute, one says that if P != NP, then NP-Complete problems cannot be computed with a classical computer. This is not correct, they can still be solved with a classical computer in super polynomial-time at most.

[yenyelinito]

I’m a first-year, but the way you explain is so nice to watch

[reinerczerwinski]

It is unlikely, that factoring is NP-complete. But if one can show, that NP-complete problems are only solvable via brute force, than quantum computers can't solve NP-complete problems in polynomial time ( see BBBV theorem)

[TacticusPrime]

I wonder what the implications would be for things like blockchain. If quantum computing undercuts the entire premise of racing to solve certain calculations to keep the currencies rare, then we could see massive inflation of various coins.