QPU does not solve my problem
My problem size is 39 qubits. The optimal solution can be attained using exhaustive search and QBSolve can for most of the time return the optimal...but not the 2000Q and Advantagesystem1.1...regardless of how large my num_reads is set. And 2000Q always returns an objective value larger than Advantagesystem1.1
Is it something to do with my problem structure? How does it relate to the performance of the QPU in particular? I assume the problem size is not that large to exceed the capacity of the QPU...am I correct?
The H,J matrix are densely populated so there is no fixed variable. The problem can not be trimmed in this case.
Please kindly give a hint. Thanks.