I am doing a thesis on "Metaheuristics and Quantum Computing", and was wondering if anyone could recommend some papers/pages to read talking about hybrid quantum/classical computing.

(My idea is to get quantum population, evaluate through classical function and then considering the classical evaluation, change the original state of qubits to get new quantum sample, and so on and so forth.)

  • 1
    $\begingroup$ Hello Pedro! I hope you don't mind that I edited your post to make it a little more concise. $\endgroup$ Nov 17, 2018 at 21:49

2 Answers 2


So for hybrid quantum-classical algorithms, I suggest looking at :

List is non exhaustive of course.

  • $\begingroup$ Thanks for your help. It's a great starting point. That is exactly what I was looking for. $\endgroup$ Nov 18, 2018 at 21:03

Pedro! I assume you are familiar to Grover's algorithm. Therefore, I suggest to read carefully these two papers below:

1) Tight bounds on quantum searching (BBHT): it's a very broad Grover's algorithm analysis;

2) A quantum algorithm for finding the minimum (DH): this is the first Grover's algorithm application to optimization problems and we call DH (authors' name);

My first steps in quantum computing were in optimization problems. I think the papers below are a very good start:

3) Grover’s quantum algorithm applied to global optimization (BBW): an adaptation of Grover's to optimization and it uses DH at the framework;

4) Using modifications to grover’s search algorithm for quantum global optimization: a modification of BBW;

5) A hybrid method for quantum global optimization

6) A new hybrid classical-quantum algorithm for continuous global optimization problems: this last paper was produced at my research group at LNCC (Brazil) and you search several minimums with classical routines and the algorithm escapes with Grover.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.