Time: 10:00am, Jul. 2nd (Fri.), 2021

Venue: 4th floor, KITS Meeting Room, UCAS [View Map]

Speaker: Yunlong Yu (Tsinghua)

Abstract:

The quantum approximate optimization algorithm (QAOA) transforms a simple many-qubit wavefunction into one which encodes the solution to a difficult classical optimization problem. It does this by optimizing the schedule according to which two unitary operators are alternately applied to the qubits. In this paper, this procedure is modified by updating the operators themselves to include local fields, using information from the measured wavefunction at the end of one iteration step to improve the operators at later steps. It is shown by numerical simulation on MAXCUT problems that this decreases the runtime of QAOA very substantially. This improvement appears to increase with the problem size. Our method requires essentially the same number of quantum gates per optimization step as the standard QAOA. Application of this modified algorithm should bring closer the time to quantum advantage for optimization problems.

https://arxiv.org/abs/2105.11946

Invited by Prof. Shenghan Jiang