Distribution of Quantum Circuits Over General Quantum Networks
Distribution of Quantum Circuits Over General Quantum Networks
复制标题
DOI：
10.1109/qce53715.2022.00063
复制
发表时间：
2022-06
期刊：
影响因子：
--
通讯作者：
Ranjani G. Sundaram;Himanshu Gupta;C. Ramakrishnan
中科院分区：
文献类型：
--
作者：
Ranjani G. Sundaram;Himanshu Gupta;C. Ramakrishnan
近期的量子计算机只能容纳少量的量子比特。促进大规模量子计算的一种方法是通过量子计算机的分布式网络。在这项工作中，我们考虑了在由异质量子计算机组成的量子网络上分发表示为量子电路的量子程序的问题，以最小化执行分布式电路所需的总体通信成本。我们考虑了两种通信方式：CAT纠缠，即在成对的计算机之间创建量子比特的链接副本，以及隐形传态。异类计算机对猫纠缠和隐形传态操作施加限制，这些操作可以由算法选择。我们首先关注一个只允许猫纠缠而不允许传送进行通信的特殊情况。我们提供了一个两步启发式算法来解决这一特殊设置：(I)使用禁忌搜索来寻找分配给计算机的量子比特；(Ii)使用为集合覆盖问题的约束版本设计的迭代贪婪算法来确定局部执行门所需的猫纠缠操作。对于允许两种通信形式的一般情况，我们提出了两种算法，将量子电路细分为几个部分，并在每个部分上应用针对特定设置的启发式。然后使用传送将每个部分的解决方案缝合在一起。最后，我们在广泛的随机产生的量子网络和电路上对我们的算法进行了模拟，并研究了它们的结果对于几个变化参数的性质。
Near-term quantum computers can hold only a small number of qubits. One way to facilitate large-scale quantum computations is through a distributed network of quantum computers. In this work, we consider the problem of distributing quantum programs represented as quantum circuits across a quantum network of heterogeneous quantum computers, in a way that minimizes the overall communication cost required to execute the distributed circuit. We consider two ways of communicating: cat-entanglement that creates linked copies of qubits across pairs of computers, and teleportation. The heterogeneous computers impose constraints on cat-entanglement and teleportation operations that can be chosen by an algorithm. We first focus on a special case that only allows cat-entanglements and not teleportations for communication. We provide a two-step heuristic for solving this specialized setting: (i) finding an assignment of qubits to computers using Tabu search, and (ii) using an iterative greedy algorithm designed for a constrained version of the set cover problem to determine cat-entanglement operations required to execute gates locally.For the general case, which allows both forms of communication, we propose two algorithms that subdivide the quantum circuit into several portions and apply the heuristic for the specialized setting on each portion. Teleportations are then used to stitch together the solutions for each portion. Finally, we simulate our algorithms on a wide range of randomly generated quantum networks and circuits, and study the properties of their results with respect to several varying parameters.