SYSTEMS AND METHODS FOR FINDING QUANTUM BINARY OPTIMIZATION PROBLEMS

摘要

Methods and systems represent constraint as an Ising model penalty function and a penalty gap associated therewith, the penalty gap separating a set of feasible solutions to the constraint from a set of infeasible solutions to the constraint; and determines the Ising model penalty function subject to the bounds on the programmable parameters imposed by the hardware limitations of the second processor, where the penalty gap exceeds a predetermined threshold greater than zero. Such may be employed to find quantum binary optimization problems and associated gap values employing a variety of techniques.

主权项

1. A method of operation in a problem solving system which includes at least a first processor and at least one non-transitory processor-readable medium communicatively coupled to the first processor and which stores at least one of processor-executable instructions or data, wherein one of a number of hardware limitations of a second processor imposes a number of bounds on a set of programmable parameters, the method comprising:
receiving, by the first processor, a problem to be solved; representing, by the first processor, the problem to be solved as an Ising model, the Ising model having a number of constraints associated therewith; and for each of the constraints associated the Ising model, determining, by the first processor, a respective Ising model penalty function subject to the bounds on the programmable parameters imposed by the hardware limitations of the second processor, where the respective Ising model penalty function for each constraint has a penalty gap associated therewith that exceeds a predetermined threshold greater than zero.