Quantum Algorithms (VQAs) have emerged to obtain possible quantum advantage. In particular, how to effectively incorporate hard constraints in VQAs remains a critical and open question.

Embeddings play a pivotal role across various disciplines, offering compact representations of complex data structures.

But it is often the case that we want to find global optima.

The general recipe for each communication round is composed of three steps.