Optimizing quantum circuit parameters via SDP

Understand

In recent years, parameterized quantum circuits have become a major tool to design quantum algorithms for optimization problems.

• The challenge in fully taking advantage of a given family of parameterized circuits lies in finding a good set of parameters in a non-convex landscape that can grow exponentially to the number of parameters.
• We introduce a new framework for optimizing parameterized quantum circuits: round SDP solutions to circuit parameters.
• Within this framework, we propose an algorithm that produces approximate solutions for a quantum optimization problem called Quantum Max Cut.