论文标题
用于合成有限连接性量子计算机排列的递归方法
Recursive Methods for Synthesizing Permutations on Limited-Connectivity Quantum Computers
论文作者
论文摘要
我们描述了一种递归方法，用于合成具有有限量子连接性的量子计算机上的量子排列。两个目标很重要：电路大小和深度。在每种情况下，我们将可扩展的启发式式与不可缩小但精确的合成结合在一起。我们的算法适用于通用连通性约束，在许多情况下达到良好的扩展并实现近距离性能。我们通过优化量子体积电路的汇编来证明这些算法的实用性，并在路径上对逆转是最难置换的旧猜想。
We describe a family of recursive methods for the synthesis of qubit permutations on quantum computers with limited qubit connectivity. Two objectives are of importance: circuit size and depth. In each case we combine a scalable heuristic with a non-scalable, yet exact, synthesis. Our algorithms are applicable to generic connectivity constraints, scale favorably, and achieve close-to-optimal performance in many cases. We demonstrate the utility of these algorithms by optimizing the compilation of Quantum Volume circuits, and to disprove an old conjecture on reversals being the hardest permutation on a path.
