论文标题
基于量子退火的软件组件：SAT解决的实验案例研究
Quantum Annealing-Based Software Components: An Experimental Case Study with SAT Solving
论文作者
论文摘要
量子计算机的潜力比古典计算机更有效地解决问题。尽管已经获得了第一个商业原型，但此类机器在实际应用中的性能仍需要探索。量子计算机不会完全替代经典机器，而是作为特定问题的加速器。这需要将量子计算基原始人集成到现有应用中。 在本文中，我们进行了一个案例研究，介绍如何使用量子退火器（QA）实现的布尔可满足性问题（SAT）来增强现有软件。我们讨论了量子成分的相关质量度量，并表明在数学上等效，但是将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.
