-1

Has anyone attempted to solve a simple optimization problem using both classical and quantum optimization methods and compared the results?

I have tried multiple times, but the quantum method has given poor results and varies every time I run it. Has anyone else experienced this issue? If so, how did you resolve it?

Many sources suggest that quantum optimization is faster and more efficient, but the results have been worse in my case. I would appreciate any insights or advice.

For example: I solved The problem below by classical and quantum optimization methods using QAOA.

enter image description hereenter image description here enter image description hereenter image description here

Edwin Isdory
  • 47
  • 4

1 Answers1

1

If your goal is to verify that QAOA or other quantum optimization algorithms are faster in time you won't be able to. What you have in code calls a simulator so your computer has to simulate a quantum computer which will be inherently slower than simply running a classical program.

To see if it is more efficient complexity analysis of the QAOA algorithm is needed and can be found here.

For the code posted your SparsePauliOp is not correct for your problem see how to formulate it here. For the randomness you're encountering you didn't specify an initial point in the QAOA decleration so every run you're finding a different local optimum which is why it varies every time you run it.

broncosaurus
  • 341
  • 5