Implementation of QMF (Quantum Minimum Finding) algorithm [Feature request] [Idea]

[MatP1337]

In following publication (https://arxiv.org/abs/2308.02342) authors state good scaling using the Quantum Minimum Finding algorithm (https://arxiv.org/pdf/1705.01843.pdf)

QAOA is getting implemented with various mixers and phase separating operators, maybe the QMF could also improve the implementation over COBYLA

This could also be useful to look into for MaxCut: https://arxiv.org/abs/2211.15832

EDIT 1: QMF is also known as Grover adaptive search, the concept used for the qrisp TSP solution. On first sight it seems like qrisp could be really useful for such an implementation

EDIT 2: with the train_function and QAE function we have all the pieces of the puzzle to have an extremely efficient QMF implementation

This issue was migrated from the internal development server after the 0.4 update and transition to open development