Solution of a problem of determining values of a set of N problem variables x, makes use of a quantum processor that has a limited number of hardware elements for representing quantum bits and/or limitations on coupling between quantum bits. A method includes accepting a specification of the problem that includes a specification of a set of terms where each term corresponds to a product of at least three variables and is associated with a non-zero coefficient. A set of ancilla variables, each ancilla variable corresponding to a pair of problem variables, is determined by applying an optimization procedure to the specification of the set of the terms. The accepted problem specification is then transformed according to the determined ancilla variables to form a modified problem specification for use in configuring the quantum processor and solution of problem.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A method for use in solution of a problem of determining values of a set of problem variables by a quantum processor that has limitations on coupling between hardware elements representing quantum bits, the method comprising: accepting a specification of the problem that includes a specification of a set of terms where each of at least some of the terms corresponds to a product of at least three problem variables and is associated with a non-zero coefficient; selecting a plurality of tuples of problem variables, each tuple of problem variables corresponding to a set of one or more ancilla variables, the selecting including applying an optimization procedure to the specification of the set of the terms to determine the selected tuples of problem variables, and the optimization procedure using an optimality criterion based at least in part on the limitations on coupling between hardware elements including a limitation on a precision of said coupling; and transforming the accepted problem specification according to the selected tuples of problem variables to form a modified problem specification for use in configuring the quantum processor and solution of problem, the modified problem specification including terms where each term corresponds to a product of a problem variable to the accepted problem specification and an ancilla variable corresponding to a tuple of problem variables of the accepted problem specification. 2. The method of claim 1 wherein each tuple of at least some of the selected tuples of problem variables consists of a pair of the problem variables. 3. The method of claim 1 wherein at least some of the sets of ancilla variables corresponding to respective ones of the selected tuples of problem variables each consists of a single ancilla variable. 4. The method of claim 1 wherein at least some of the sets of ancilla variables corresponding to respective ones of the selected tuples of problem variables each comprises multiple ancilla variables. 5. The method of claim 1 wherein accepting the specification of a problem comprises accepting a specification of a Polynomial Unconstrained Binary Optimization (PUBO) problem. 6. The method of claims 1 wherein the quantum processor has a limited number of hardware elements, each associated with a different problem variable. 7. The method of claim of claim 6 wherein the limited number of hardware elements comprise a limited number of quantum bit elements. 8. The method of claims 6 wherein selecting a plurality of tuples of problem variables comprises selecting said tuples according to a number of resulting ancilla variables required to transform the problem specification. 9. The method of claim 8 wherein each set of ancilla variables corresponding to a selected tuple of problem variables consists of one corresponding ancilla variable. 10. The method of claim 8 wherein selecting the plurality of tuples of problem variables comprises applying an optimal set covering procedure. 11. The method of claim 8 wherein selecting the plurality of tuples of problem variables comprises applying a 0-1 integer Linear Programming (LP) procedure. 12. (canceled) 13. (canceled) 14. The method of claim 1 wherein each set of ancilla variables corresponding to a selected tuple of problem variables consists of one corresponding ancilla variable. 15. The method of claim 1 wherein each set of ancilla variables corresponding to a selected tuple of problem variables comprises three or more corresponding ancilla variables. 16. The method of claim 1 wherein selecting the plurality of tuples of problem variables comprises applying a 0-1 integer Linear Programming (LP) procedure. 17. The method of claim 1 wherein selecting the plurality of tuples of problem variables comprises applying a greedy assignment procedure. 18. The method of claim 1 further comprising: configuring the quantum processor according to the modified problem specification. 19. The method of claim 18 further comprising: operating the quantum processor configured according to the modified problem specification; and providing a specification of a problem solution determined from a state of the quantum processor after the operating. 20. The method of claim 19 wherein operating the quantum processor comprises operating said quantum processor according to a quantum annealing procedure. 21. A quantum computing system comprising: a quantum processor that has limitations on coupling between hardware elements representing quantum bits for use in solution of a problem of determining values of a set of problem variables, the quantum processor configured to: accept a specification of the problem that includes a specification of a set of terms where each of at least some of the terms corresponds to a product of at least three problem variables and is associated with a non-zero coefficient: select a plurality of tuples of problem variables, each tuple of problem variables corresponding to a set of one or more ancilla variables, the selecting including applying an optimization procedure to the specification of the set of the terms to determine the selected tuples of problem variables, and the optimization procedure using an optimality criterion based at least in part on the limitations on coupling between hardware elements including a limitation on a precision coupling; and transform the accepted problem specification according to the selected tuples of problem variables to form a modified problem specification for use in configuring the quantum processor and solution of problem, the modified problem specification including terms where each term corresponds to a product of a problem variable to the accepted problem specification and an ancilla variable corresponding to a tuple of problem variables of the accepted problem specification. 22. Software for use in solution of a problem of determining values of a set of problem variables by a quantum processor that has limitations on coupling between hardware elements representing quantum bits, the software comprising instructions stored on a non-transitory computer-readable medium for causing a compiler to: accept a specification of the problem that includes a specification of a set of terms where each of at least some of the terms corresponds to a product of at least three problem variables and is associated with a non-zero coefficient select plurality of tuples of problem variables, each tuple of problem variables; corresponding to a set of one or more ancilla variables, the selecting including applying an optimization procedure to the specification of the set of the terms to determine the selected tuples of problem variables, and the optimization procedure using an optimality criterion based at least in part on the limitations on coupling between hardware elements including a limitation on a precision of said coupling; and transform the accepted problem specification according to the selected tuples of problem variables to form a modified problem specification for use in configuring the quantum processor and solution of problem, the modified problem specification including terms where each term corresponds to a product of a problem variable to the accepted problem specification and an ancilla variable corresponding to a tuple of problem variables of the accepted problem specification. 23. The method of claim 20 wherein operating the quantum processor comprises operating said quantum processor according to an adiabatic quantum computation procedure. 24. The method of claim 1 wherein said limitation on a precision of said coupling includes a limitation on a control precision corresponding to a range of distinguishable values that are attainable for controlling a coefficient that represents a degree of a coupling between hardware elements. 25. The method of claim 24 wherein the distinguishable values comprise integral multiples of a fixed step size up to a maximum magnitude. 26. The method of claim 24 wherein the optimality criterion is configured to reduce a control precision cost of a reduction in locality associated with the selected tuples of problem variables compared to a control precision cost of a reduction in locality associated with a random selection of tuples of problem variables.