I'm studying about the variational quantum algorithms and I would like to know about the usage of VQE for solving combinatorial optimization problems.

VQE can find the ground state energy of a given Hamiltonian using a classical optimizer with quantum hardware, and as far as I know, QAOA is a special case of VQE to solve combinatorial optimization problems.

I'm trying to understand the difference between VQE and QAOA when solving combinatorial optimization problems.

If I have a system that can prepare any arbitrary quantum states and measure the quantum state pretty well, can VQE efficiently solve combinatorial optimization problems as QAOA solve?

  • $\begingroup$ it's not advised to try to avoid closure by deleting the post and reasking an identical one. It increases the chance of incurring in automatic measures that eventually can lead to question bans. The correct course of action is to edit the question addressing the isuses. The previous question was closed as needing details or clarity. Can you edit the post to improve on this aspect? For example, you might include your current understanding of the topic and/or your thoughts on the possible answer. $\endgroup$
    – glS
    Mar 14 at 12:01


Your Answer

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