基于量子退火的软件构件：一个实验案例研究及SAT求解
Quantum Annealing-Based Software Components: An Experimental Case Study with SAT Solving
摘要：
量子计算机有可能比经典计算机更有效地解决问题。虽然第一个商业原型已经可用，但这种机器在实际应用中的性能仍有待探索。量子计算机不会完全取代经典计算机，而是作为特定问题的加速器。这需要将量子计算原语集成到现有的应用程序中。在本文中，我们进行了一个案例研究如何增强现有的软件与量子计算原语的布尔可满足性问题（SAT）实现使用量子退火（QA）。我们讨论了量子组件的相关质量措施，并表明，数学上等价的，但结构上不同的方式转换SAT的QA可能会导致这些品质的实质性差异。我们认为，工程师需要意识到（以及哪些）细节，尽管它们在传统的软件工程中可能不太相关，但在量子计算中需要相当多的关注。
英文摘要：
Quantum computers have the potential of solving problems more efficiently than classical computers. While first commercial prototypes have become available, the performance of such machines in practical application is still subject to exploration. Quantum computers will not entirely replace classical machines, but serve as accelerators for specific problems. This necessitates integrating quantum computational primitives into existing applications. In this paper, we perform a case study on how to augment existing software with quantum computational primitives for the Boolean satisfiability problem (SAT) implemented using a quantum annealer (QA). We discuss relevant quality measures for quantum components, and show that mathematically equivalent, but structurally different ways of transforming SAT to a QA can lead to substantial differences regarding these qualities. We argue that engineers need to be aware that (and which) details, although they may be less relevant in traditional software engineering, require considerable attention in quantum computing.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
