Hi All,
During our Quantum Algorithm lecture, we’ll take a quick look at what some researchers are doing to solve an NP-complete problem called the Traveling Salesperson problem. The video we will look at will be the start and end (2:42 and 47:50) of William Cook’s lecture here.
Also, find an intro to the math behind Quantum Computing here.
Leave a Reply