Fig. 6: Success probabilities of COMBO when executed for the same number of cycles as QTG in comparison with those obtained by QTG. | npj Quantum Information

Fig. 6: Success probabilities of COMBO when executed for the same number of cycles as QTG in comparison with those obtained by QTG.

From: A quantum algorithm for solving 0-1 Knapsack problems

Fig. 6

The subfigures (from left to right) show the measured average success probability for different groups g = 2, 3 ≤ g ≤ 6 and 7 ≤ g ≤ 10, respectively. Due to the nature of COMBO, it either produces an optimal solution or fails to find any solution. The results show that when both methods are executed with a timeout, QTG-based search is able to compete with COMBO when comes to finding optimal solutions for instances with 7≤g≤10 with a high success probability.

Back to article page