Post-processing variationally scheduled quantum algorithm for constrained combinatorial optimization problems

Understand

We propose a post-processing variationally scheduled quantum algorithm (pVSQA) for solving constrained combinatorial optimization problems (COPs).

• COPs are typically transformed into ground-state search problems of the Ising model on a quantum annealer or gate-type quantum device.
• Variational methods are used to find an optimal schedule function that leads to high-quality solutions in a short amount of time.
• Post-processing techniques convert the output solutions of the quantum devices to satisfy the constraints of the COPs.