PAR Class 21, Mon 20190401
Table of contents::
1 GTC19 videos, part 3
 Robotics in Action at GTC 2019 (1:21)
 Evolution of NVIDIA GeForce 19992017 (14:00)
 Project Sol Part 3: A RealTime RayTracing Cinematic Scene Powered by NVIDIA RTX (3:44)
 Introducing NVIDIA Safety Force Field (2:15)
 Top 5 Higher Education Sessions at GTC 2019 (1:28)
 GPUAccelerated Data Science  NVIDIA GTC Keynote Demo (13:04)
2 Quantum computing on youtube

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.

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.

Can we make quantum technology work?  Leo Kouwenhoven  TEDxAmsterdam (18:19)
3 Quantum computing
ctd
 Algorithms:
 Some, but not all, are faster.
 Boundederror quantum polynomial time (BQP)
 "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:
 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:
 Factorize an int.
 in BQP.
 almost exponentially faster than best classical algorithm.
 Largest examples I can find:
 https://quantumexperience.ng.bluemix.net/qx/tutorial ctd.