Feb 27, 2017
Scott Aaronson, professor at the University of Austin Texas and
former professor at MIT explains what a quantum computer is,
various possible applications, the types of problems they are good
at solving and much more.
Scott’s research interests center around the capabilities and
limits of quantum computers, and computational complexity theory
more generally.
NP-hard and NP-complete problems are discussed, as well as the
travelling salesman problem.
Scott explains how quantum computing is going to be an expressive
form of quantum mechanics and how can it affect our daily lives
after going mainstream.
From applications in cryptography to factoring huge numbers to
solving exponential problems, quantum computers can have various
other applications. This is just the first step in a long
journey.
Listen, Share and Subscribe to get the latest, news and updates in
technology. Contribute Bitcoin to fuel our interviews and keep us
going!