Quantum processor based techniques minimize an objective function for example by operating the quantum processor as a sample generator providing low-energy samples from a probability distribution with high probability. The probability distribution is shaped to assign relative probabilities to samples based on their corresponding objective function values until the samples converge on a minimum for the objective function. Problems having a number of variables and/or a connectivity between variables that does not match that of the quantum processor may be solved. Interaction with the quantum processor may be via a digital computer. The digital computer stores a hierarchical stack of software modules to facilitate interacting with the quantum processor via various levels of programming environment, from a machine language level up to an end-use applications level.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. (canceled) 2. A method of at least approximately solving a problem comprising a plurality of problem variables by a hybrid problem-solving system that comprises a quantum processor and a digital processor, the quantum processor and the digital processor communicatively coupled to one another, the quantum processor comprising a plurality of qubits and operated as a sample generator providing samples, the method comprising: defining a plurality of models by the digital processor, each of the plurality of models realizing a respective mapping of the plurality of problem variables to the plurality of qubits; processing each of the plurality of models by the digital processor, the processing of a first model overlapping in time with the processing of a second model; generating an initial population of configurations; iterating in one or more steps towards a solution of the problem over a plurality of populations, each of the one or more steps comprising: determining a respective one or more configurations closest to the solution of the problem by the digital processor; and generating a new population by the quantum processor, the new population having at least one attribute in common with the respective one or more configurations closest to the solution of the problem; determining whether an exit condition has been met; and terminating the method in response to a determination that the exit condition has been met. 3. The method of claim 2 wherein generating a new population by the quantum processor includes drawing one or more samples by the quantum processor and returning the one or more samples to the digital processor. 4. The method of claim 2 wherein at least approximately solving a problem includes at least approximately minimizing an objective function. 5. The method of claim 4 wherein iterating in one or more steps towards a solution of the problem over a plurality of populations includes iterating in one or more steps over a plurality of populations to determine successive populations having progressively lower objective values. 6. The method of claim 2 wherein determining whether an exit condition has been met includes at least one of completing a predetermined number of iterations, reaching a predetermined upper bound on allowed computation time, or determining a change in populations between successive iterations is below a predetermined threshold. 7. The method of claim 2 wherein generating an initial population includes generating an initial population comprising at least one of a random or a pseudo-random population of configurations. 8. A method of operating a quantum processor and a digital processor to at least approximately minimize an objective function, the quantum processor and the digital processor communicatively coupled to one another, the quantum processor comprising a plurality of qubits and operated as a sample generator providing samples, the method comprising: initializing a population of configurations by the digital processor; initializing a current lowest objective value configuration and a corresponding objective value; until an outer loop termination condition is met, assigning a first set of variables to be floating variables, the floating variables to be used as optimization variables; assigning each variable in a second set of variables to a respective value in the current lowest objective value configuration; initializing one or more models defined over the first set of variables; and until an inner loop termination condition is met drawing one or more samples from a quantum processor based on the models; returning the one or more samples to the digital processor; evaluating an objective function on the one or more samples; updating the current lowest objective value configuration and the corresponding objective value for each model; and updating the models based on the one or more samples; and returning the current lowest objective value configuration and the corresponding objective value. 9. The method of claim 8 wherein evaluating an objective function on the one or more samples includes evaluating an objective function on the one or more samples and performing at least one search operation. 10. The method of claim 9 wherein performing at least one search operation includes performing at least one search operation using path relinking. 11. The method of claim 8 wherein each of the one or more models represents a respective one or more statistical commonalities of a set of configurations of one or more programmable parameters of the quantum processor. 12. The method of claim 11 wherein the respective one or more statistical commonalities define a corresponding probability for the quantum processor. 13. The method of claim 12 wherein drawing one or more samples from a quantum processor includes realizing one or more alternative configurations comprising the respective one or more statistical commonalities. 14. The method of claim 13 wherein updating the models based on the one or more samples includes generating a new configuration of the one or more programmable parameters of the quantum processor, the new configuration representing a new probability distribution for the quantum processor. 15. The method of claim 8 wherein updating the models based on the one or more samples includes updating a first and a second model based on the samples, the updating of the first and the second models at least partially overlapping in time. 16. The method of claim 8 wherein updating the models based on the one or more samples includes updating the models based on the one or more samples using classical digital processing techniques. 17. The method of claim 8 wherein at least one of the one or more models is a model that mimics a local search around a selected configuration. 18. The method of claim 8 wherein at least one of the one or more models is a model that combines two selected configurations and favors configurations that lie between the two selected configurations. 19. The method of claim 8 wherein the inner loop termination condition includes at least one of completing a predetermined number of iterations, reaching a predetermined upper bound on allowed computation time, or determining a change in models between successive iterations of the inner loop is below a predetermined threshold. 20. The method of claim 8 wherein the outer loop termination condition includes at least one of completing a predetermined number of iterations, reaching a predetermined upper bound on allowed computation time, or determining a change in the corresponding objective value between successive iterations of the outer loop is below a predetermined threshold.