分布式存储量子多计算机算法
Arithmetic on a Distributed-Memory Quantum Multicomputer
摘要：
我们评估的量子算术算法运行在分布式量子计算机（量子多计算机）的性能。我们改变节点容量和I/O功能以及网络拓扑。通过在纠缠的量子比特对上的“隐形传态门”（telegate），与通过量子隐形传态交换相关量子比特，然后使用本地门（teledata）执行算法之间的权衡，被检查。我们表明，teledata的方法执行更好，和携带纹波加法器执行良好时，隐形传态块被分解，使关键的量子操作可以并行化。只要节点具有两个收发器量子位，仅几个逻辑量子比特的节点大小就足以执行。线性网络拓扑在很宽的系统规模和性能参数范围内都可以接受。因此，我们建议采用小型高I/O带宽节点和简单网络。这样的机器将运行肖尔算法，以有效地分解大数。
英文摘要：
We evaluate the performance of quantum arithmetic algorithms run on a distributed quantum computer (a quantum multicomputer). We vary the node capacity and I/O capabilities, and the network topology. The tradeoff of choosing between gates executed remotely, through ``teleported gates'' on entangled pairs of qubits (telegate), versus exchanging the relevant qubits via quantum teleportation, then executing the algorithm using local gates (teledata), is examined. We show that the teledata approach performs better, and that carry-ripple adders perform well when the teleportation block is decomposed so that the key quantum operations can be parallelized. A node size of only a few logical qubits performs adequately provided that the nodes have two transceiver qubits. A linear network topology performs acceptably for a broad range of system sizes and performance parameters. We therefore recommend pursuing small, high-I/O bandwidth nodes and a simple network. Such a machine will run Shor's algorithm for factoring large numbers efficiently.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
