论文标题
网格体系结构的局部感知量子
Locality-aware Qubit Routing for the Grid Architecture
论文作者
论文摘要
由于NISQ时代可用的Qubits的偏光时间很短，因此必须尽可能有效地包装（最小化（最小化大小和或深度））逻辑量子电路。在这项工作中，我们根据图理论框架介绍了一种局部感知的量子路由算法。我们的算法是为网格和某些“网格般”架构设计的。我们通过将算法与近似令牌交换算法进行比较，在实验中表明了算法的竞争力，该算法在许多最新的量子跨科中被用作原始算法。我们的算法会产生可比深度（随机排列更好）的电路，而比典型的令牌交换算法的典型实现速度要快。
Due to the short decohorence time of qubits available in the NISQ-era, it is essential to pack (minimize the size and or the depth of) a logical quantum circuit as efficiently as possible given a sparsely coupled physical architecture. In this work we introduce a locality-aware qubit routing algorithm based on a graph theoretic framework. Our algorithm is designed for the grid and certain "grid-like" architectures. We experimentally show the competitiveness of algorithm by comparing it against the approximate token swapping algorithm, which is used as a primitive in many state-of-the-art quantum transpilers. Our algorithm produces circuits of comparable depth (better on random permutations) while being an order of magnitude faster than a typical implementation of the approximate token swapping algorithm.
