.. title: PAR Class 21, Mon 2019-04-01
.. slug: class21
.. date: 2019-04-01
.. tags: class
.. category: 
.. link: 
.. description: 
.. type: text

.. raw:: html

   <style> .red {color:red} </style>
   <style> .blue {color:blue} </style>

.. role:: red
.. role:: blue

.. sectnum::
.. contents:: Table of contents::
..

   
GTC19 videos, part 3
--------------------

#. `Robotics in Action at GTC 2019 (1:21) <https://www.youtube.com/watch?v=m0nQhc4kVgA>`_

#. `Evolution of NVIDIA GeForce 1999-2017 (14:00) <https://www.youtube.com/watch?v=6MmiaqK342c>`_

#. `Project Sol Part 3: A Real-Time Ray-Tracing Cinematic Scene Powered by NVIDIA RTX (3:44) <https://www.youtube.com/watch?v=b2WOjo0C-xE&list=PLZHnYvH1qtOa_0ScP_Zif7ICR1ABryFTZ&index=7&t=>`_

#. `Introducing NVIDIA Safety Force Field (2:15) <https://www.youtube.com/watch?v=R0H77yZSEUk&list=PLZHnYvH1qtOa_0ScP_Zif7ICR1ABryFTZ&index=9>`_

#. `Top 5 Higher Education Sessions at GTC 2019 (1:28) <https://www.youtube.com/watch?v=bcJk6HEVFwM&index=17&list=PLZHnYvH1qtOa_0ScP_Zif7ICR1ABryFTZ>`_

#. `GPU-Accelerated Data Science | NVIDIA GTC Keynote Demo (13:04) <https://www.youtube.com/watch?v=LztHuPh3GyU&list=PLZHnYvH1qtOa_0ScP_Zif7ICR1ABryFTZ&index=27>`_


Quantum computing on youtube
----------------------------

#. `Quantum Algorithms (2:52) <https://www.youtube.com/watch?v=-ysVGWtAjio>`_

   Which problems can quantum computers solve exponentially faster than classical computers? David Gosset, IBM quantum computing research scientist, explains why algorithms are key to finding out.

#. `David Deutsch - Why is the Quantum so Strange? (8:43) <https://www.youtube.com/watch?v=MckuBQC6gKU>`_

#. `Grover's Algorithm (9:57) <https://www.youtube.com/watch?v=hK6BBluTGhU>`_

   An overview of Grover's Algorithm. An unstructured search algorithm that can find an item in a list much faster than a classical computer can.   Several sources are listed.

#. `Bob Sutor demonstrates the IBM Q quantum computer (6:53) <https://www.youtube.com/watch?v=b-0ZNlqaSBE>`_

#. `Can we make quantum technology work? | Leo Kouwenhoven | TEDxAmsterdam (18:19) <https://www.youtube.com/watch?v=aUuaWVHhx-U>`_

#. `"Spooky" physics | Leo Kouwenhoven | TEDxDelft (18:00) <https://www.youtube.com/watch?v=wZzHnZzm_58>`_


Quantum computing
-----------------

ctd

#. Algorithms:

   a. Some, but not all, are faster.

   #. Bounded-error quantum polynomial time (BQP)

      i. "is the class of decision problems solvable by a quantum computer in polynomial time, with an error probability of at most 1/3 for all instances" -       https://en.wikipedia.org/wiki/BQP

      #. Includes integer factorization and discrete log.

      #. Relation to NP is unknown (big unsolved problem).

   #. Grover's algorithm:

      i. https://en.wikipedia.org/wiki/Grover%27s_algorithm

      #. Given a black box with N inputs and 1 output.

      #. Exactly one input makes the output 1.
	    
      #. Problem: which one?

      #. Classical solution: Try each input, T=N.

      #. Quantum:  $T=\\sqrt(N)$.

      #. Probabilistic.

      #. Apps: mean, median, reverse a crypto hash, find collisions, generate false blocks.

      #. Can extend to quantum partial search.

      #. Grover's algorithm is optimal.

      #. This suggests that NP is not in BQP .

   #. Shor's algorithm:

      i. Factorize an int.

      #. in BQP.

      #. almost exponentially faster than best classical algorithm.

      #. Largest examples I can find:
	 
         #. 56153 = 233 × 241.

	 #. https://medium.com/@aditya.yadav/rsa-2048-cracked-using-shors-algorithm-on-a-quantum-computer-660cb2297a95	 


#. https://quantumexperience.ng.bluemix.net/qx/tutorial ctd.