用于分子对接的量子近似优化算法
Quantum Approximate Optimization Algorithms for Molecular Docking
AI总结:
本文提出一种用于分子对接的数字化反绝热量子近似优化算法(DC-QAOA),在GPU集群上模拟验证了14和17节点实例,发现结合相互作用为精确解且计算时间随规模显著增加。
摘要:
分子对接是药物发现的关键过程,由于生物分子系统的复杂性和规模庞大,确定药物与靶蛋白的最佳结合构型极具挑战性。混合经典-量子计算技术为应对这些挑战提供了一种新方法。量子近似优化算法(QAOA)及其变体是混合经典-量子技术,也是解决组合优化挑战的有前景工具。本文提出了一种用于分子对接的数字化反绝热量子近似优化算法(DC-QAOA)方法。在GPU集群上进行了模拟量子运行。我们研究了14和17个节点的实例——据我们所知,Ding等人发表的最大实例为12个节点,我们展示了相关结果。基于计算结果,我们得出结论,结合相互作用代表了预期的精确解。此外,随着所检查实例规模的增加,计算时间显著增加。
英文摘要:
Molecular docking is a critical process for drug discovery and challenging due to the complexity and size of biomolecular systems, where the optimal binding configuration of a drug to a target protein is determined. Hybrid classical-quantum computing techniques offer a novel approach to address these challenges. The Quantum Approximate Optimization Algorithm (QAOA) and its variations are hybrid classical-quantum techniques, and a promising tool for combinatorial optimization challenges. This paper presents a Digitized Counterdiabatic QAOA (DC-QAOA) approach to molecular docking. Simulated quantum runs were conducted on a GPU cluster. We examined 14 and 17 nodes instances - to the best of our knowledge the biggest published instance is 12-node at Ding et al. and we present the results. Based on computational results, we conclude that binding interactions represent the anticipated exact solution. Additionally, as the size of the examined instance increases, the computational times exhibit a significant escalation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。