论文标题
SAT的基于绝热的算法：一种全面的算法描述
Adiabatic based Algorithm for SAT: a comprehensive algorithmic description
论文作者
论文摘要
本文涉及量子启发式方法能够扩展量子计算的领域，从而在大量众所周知的古典算法中定义了一种有希望的方式。量子近似启发式方法利用了指定解决问题的哈密顿量和混合哈密顿量之间的交替。最初在量子物理学中定义的绝热定理允许计算Schrödinger方程的解决方案，但是这种方法的基础需要强大的物理和数学技能。首先，我们在本文中的主要目标是为绝热优化提供基于算法的演示（与运营研究实践中的经典计算机科学界），其次是为了全面解决众所周知的SAT问题。这提供了对绝热能力的简洁但明确分析的机会，以定义新的有效的运营研究趋势。我们的实验包括对模拟器和IBM提供的实际量子计算机的数值评估。在Qiskit和MyQLM上都实现了模拟器的数值实验。
This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a promising way in the large number of well-known classical algorithms. Quantum approximate heuristics take advantage of alternation between a Hamiltonian defining the problem to solve and a mixing Hamiltonian. The adiabatic theorem initially defined in quantum physic allows to compute a solution for the Schrödinger equation, but the foundation of this methods requires strong skill in physics and mathematics. Our main objectives in this paper are at first to provide an algorithm-based presentation (as close as possible of the classical computer science community in operational research practice) of the adiabatic optimization and secondly to give a comprehensive resolution of the well-known SAT problem. This gives opportunities to provide a concise but explicit analysis of the adiabatic capability to define a new efficient operational research trend. Our experiments encompass numerical evaluations on both simulator and on real quantum computer provided by IBM. Numerical experiments on simulator have been achieved on both Qiskit and MyQLM.
