整数二进制编码HOBO公式中不等式约束的简化方法
A Simplification Method for Inequality Constraints in Integer Binary Encoding HOBO Formulations
AI总结:
提出一种简化HOBO公式中不等式约束的新方法,通过高效整合约束减少松弛变量和辅助量子比特,提升量子与经典求解器的计算效率和精度,并扩展量子算法在高维问题上的适用性。
摘要:
本研究提出了一种简化高阶二进制优化(HOBO)公式中不等式约束的新方法。该方法解决了与二次无约束二进制优化(QUBO)公式相关的挑战,特别是由引入松弛变量及由此导致的辅助量子比特数量增长所带来的计算复杂度增加和求解精度降低的问题。通过高效整合约束,该方法提升了量子求解器和经典求解器的计算效率与精度。通过对组合优化问题的数值实验验证了所提方法的有效性。结果表明,该方法扩展了量子算法在高维问题上的适用性,并提高了经典优化求解器在处理涉及不等式约束的优化问题时的实用性。
英文摘要:
This study proposes a novel method for simplifying inequality constraints in Higher-Order Binary Optimization (HOBO) formulations. The proposed method addresses challenges associated with Quadratic Unconstrained Binary Optimization (QUBO) formulations, specifically the increased computational complexity and reduced solution accuracy caused by the introduction of slack variables and the resulting growth in auxiliary qubits. By efficiently integrating constraints, the method enhances the computational efficiency and accuracy of both quantum and classical solvers. The effectiveness of the proposed approach is demonstrated through numerical experiments applied to combinatorial optimization problems. The results indicate that this method expands the applicability of quantum algorithms to high-dimensional problems and improves the practicality of classical optimization solvers for optimization problems involving inequality constraints.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。