arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2308.03344quant-phcs.DC
收藏

一种基于纠缠与量子隐形传态的并行分布式量子SAT求解器

A Parallel and Distributed Quantum SAT Solver Based on Entanglement and Quantum Teleportation

Shang-Wei Lin, Tzu-Fan Wang, Yean-Ru Chen, Zhe Hou, David Sanán, Yon Shin Teo

AI总结:

本文提出一种基于纠缠和量子隐形传态的并行分布式量子SAT求解器,将每次Grover迭代的时间复杂度从O(m)降至O(1),并通过多节点协作提升大规模问题的可扩展性。

摘要:

布尔可满足性(SAT)求解是计算机科学中的一个基本问题。寻找高效的SAT求解算法在计算机科学的许多领域及其他领域具有广泛影响。文献中已提出基于Grover算法的量子SAT求解器。尽管现有的量子SAT求解器可以同时考虑所有可能的输入,但它们逐条顺序地评估公式中的每个子句,使得每次Grover迭代的时间复杂度为O(m)——与子句数量m成线性关系。在这项工作中,我们开发了一种并行量子SAT求解器,通过利用额外的纠缠量子比特,将每次迭代的时间复杂度从线性时间O(m)降低到常数时间O(1)。为了在极大规模问题下进一步提高我们方案的可扩展性,我们基于量子隐形传态开发了所提出的并行SAT求解器的分布式版本,使得所需的总量子比特在一组量子计算机(节点)之间共享和分布,并且量子SAT求解由所有节点协作完成。我们证明了所提方法的正确性,并在仿真中对其进行了演示。

英文摘要:

Boolean satisfiability (SAT) solving is a fundamental problem in computer science. Finding efficient algorithms for SAT solving has broad implications in many areas of computer science and beyond. Quantum SAT solvers have been proposed in the literature based on Grover's algorithm. Although existing quantum SAT solvers can consider all possible inputs at once, they evaluate each clause in the formula one by one sequentially, making the time complexity O(m) -- linear to the number of clauses m -- per Grover iteration. In this work, we develop a parallel quantum SAT solver, which reduces the time complexity in each iteration from linear time O(m) to constant time O(1) by utilising extra entangled qubits. To further improve the scalability of our solution in case of extremely large problems, we develop a distributed version of the proposed parallel SAT solver based on quantum teleportation such that the total qubits required are shared and distributed among a set of quantum computers (nodes), and the quantum SAT solving is accomplished collaboratively by all the nodes. We have proved the correctness of our approaches and demonstrated them in simulations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑