| CPC G06N 5/01 (2023.01) [G06F 9/44505 (2013.01); G06N 10/40 (2022.01)] | 8 Claims |
|
1. A method to improve operation of a computing system for solving a computational problem using a heuristic algorithm, the computing system comprising a digital processor communicatively coupled to a quantum processor that comprises a plurality of qubits, the heuristic algorithm performed by the quantum processor and an amount of computational effort and/or resources used therefor adaptively adjusted based on an amount of time left in a preset run-time of thereof, the heuristic algorithm having at least one effort parameter and a running time, wherein the effort parameter is determinant of an amount of computational work performed and contributes to a length of time used to solve the computational problem, the method comprising:
initializing, by the digital processor, parameters of a meta-algorithm, including at least initialization of a value of the at least one effort parameter of the heuristic algorithm to a first value;
running the meta-algorithm, wherein running the meta-algorithm comprises:
iteratively, until a running time of the heuristic algorithm reaches a time-limit value:
determining, by the digital processor, whether an evaluation criterion has been met, wherein the evaluation criterion is based on the running time and the time-limit value;
adaptively adjusting, by the digital processor, the effort parameter of the heuristic algorithm to an adjusted value, wherein a direction of the adjustment of the effort parameter is based on a result of the determination of whether the evaluation criterion has been met, and
running, by at least the quantum processor, the heuristic algorithm with the adjusted value of the at least one effort parameter to obtain a solution set of a plurality of solution sets to the computational problem, wherein the running the heuristic algorithm comprises application of at least one bias signal to the plurality of qubits of the quantum processor to cause performance of quantum computation, and wherein a current solution set of the plurality of solution sets is based on final states of the plurality of qubits as a result of the quantum computation;
and,
returning the plurality of solution sets to the computational problem once the running time of the heuristic algorithm reaches the time-limit value.
|