Constraint satisfaction or optimisation models -- even if they are formulated in high-level modelling languages -- need to be reduced into an equivalent format before they can be solved by the use of Quantum Computing. In this paper we show how Boolean and integer FlatZinc builtins over finite-domain integer variables can be equivalently reformulated as linear equations, linear inequalities or binary products of those variables, i.e. as finite-domain quadratic integer programs. Those quadratic integer programs can be further transformed into equivalent Quadratic Unconstrained Binary Optimisation problem models, i.e. a general format for optimisation problems to be solved on Quantum Computers especially on Quantum Annealers.

翻译：约束满足或优化模型——即便它们是用高级建模语言表述的——在用量子计算求解之前，仍需归约到等价的形式。本文展示了有限域整数变量上的布尔与整数FlatZinc内置函数如何等价地重构为线性方程、线性不等式或这些变量的二元乘积形式，即有限域二次整数规划。这些二次整数规划可进一步转化为等价的二次无约束二元优化问题模型，即适用于量子计算机（尤其是量子退火器）求解的优化问题通用格式。