Trying to solve a 100-vertex Max-Cut problem but not getting accurate results?

[robliou]

Hello,

I am attempting to solve a 100-vertex max cut graph by using the max-cut code given here and inserting my own pre-built matrix, but even after increasing numruns to 3000 and chain_strength to 8, I am only getting a response that is 89.4% accurate after about 20 seconds of run time.

Meanwhile, using Dwave's simulated annealing program (https://docs.ocean.dwavesys.com/projects/neal/en/latest/reference/sampler.html) to solve the same matrix, I get a fully-solved response that is 100% accurate after just 0.01 seconds.

Is this the optimal quantum performance we could expect for a 100-vertex graph (i.e. <100% accuracy), or does my quantum annealing code need further tweaking? Are there other solvers or methods I should consider using?

For reference, I am simply using the code in this codebase but have inserted a 100-vertex graph with edges as such:

all_edges = [(1, 36), (1, 37),...]

and have edited the following two parameters as such:

# Set up QPU parameters
chainstrength = 8
numruns = 3000

Everything else in the code is basically the same.

Thanks and Best Regards,

R

[arcondello]

Hi @robliou , because this is not a bug or feature request, but rather a question of how to optimize a program, these sorts of questions will be answered better and more quickly in our community.

[robliou]

Hi @arcondello ,

I appreciate your prompt response! I have already posted this question to the community forum as well; hopefully I can get a response soon about how to utilize and optimize this type of problem:

100-vertex-issue

Thanks and Best,

Rob