论文标题
一种动态编程方法，用于通过两分图分配量子电路
A dynamic programming approach for distributing quantum circuits by bipartite graphs
论文作者
论文摘要
近期大量子计算机无法作为单个处理单元运行。因此，需要将量子电路划分为较小的零件，然后在小型单元上执行每个部分。该方法称为分布式量子计算。在这项研究中，提出了一种动态编程算法，以最大程度地减少分布式量子电路（DQC）中的通信数量。该算法由两个步骤组成：首先，量子电路将转换为两部分图模型，然后提出了动态编程方法（DP）将模型分配到低容量的量子电路中。对所提出的方法进行了一些基准量子电路的评估，并显着减少了所需的传送量。
Near-term large quantum computers are not able to operate as a single processing unit. It is therefore required to partition a quantum circuit into smaller parts, and then each part is executed on a small unit. This approach is known as distributed quantum computation. In this study, a dynamic programming algorithm is proposed to minimize the number of communications in a distributed quantum circuit (DQC). This algorithm consists of two steps: first, the quantum circuit is converted into a bipartite graph model, and then a dynamic programming approach (DP) is proposed to partition the model into low-capacity quantum circuits. The proposed approach is evaluated on some benchmark quantum circuits with remarkable reduction in the number of required teleportations.
