Description: Quantum approximate optimization is a hybrid classical/quantum algorithm used for solving combinatorial optimization problems. We will discuss the application of this algorithm on constrained optimization problems and use the maximum independent set as an example. A dynamic variational extension of the algorithm will be introduced that allows us control over the quantum resources used. We will also discuss quantum local search and divide and conquer strategies that can be used with this algorithm.

BlueJeans Info:

Join Meeting <https://bluejeans.com/1265962662/5207?src=htmlEmail>

Join from computer or phone:

Phone Dial-in

+1.312.216.0325<tel:+1.312.216.0325> (US (Chicago))

+1.408.740.7256<tel:+1.408.740.7256> (US (San Jose))

+1.866.226.4650<tel:+1.866.226.4650> (US Toll Free)

(Global Numbers<https://www.bluejeans.com/premium-numbers>)

Meeting ID: 126 596 2662