论文标题
基于双随机矩阵的最佳量子路由方法
A doubly stochastic matrices-based approach to optimal qubit routing
论文作者
论文摘要
交换映射是一种量子编译器优化，通过引入交换门，将逻辑量子电路映射到等效的物理实现。电路的物理可实现性由实现硬件连接约束确定。因此，掉期门的放置可以解释为离散优化过程。在这项工作中，我们采用了一种称为双随机矩阵的结构，该结构定义为置换矩阵的凸组合。直觉是使决策过程变得顺利。双随机矩阵包含在Birkhoff Polytope中，其中顶点代表单个置换矩阵。从本质上讲，该算法使用平滑的约束优化来沿着多层的边缘滑向顶点上的电势解决方案。在实验中，我们表明，与最先进的算法SABER相比，所提出的算法以额外的计算时间为代价可以降低深度。
Swap mapping is a quantum compiler optimization that, by introducing SWAP gates, maps a logical quantum circuit to an equivalent physically implementable one. The physical implementability of a circuit is determined by the fulfillment of the hardware connectivity constraints. Therefore, the placement of the SWAP gates can be interpreted as a discrete optimization process. In this work, we employ a structure called doubly stochastic matrix, which is defined as a convex combination of permutation matrices. The intuition is that of making the decision process smooth. Doubly stochastic matrices are contained in the Birkhoff polytope, in which the vertices represent single permutation matrices. In essence, the algorithm uses smooth constrained optimization to slide along the edges of the polytope toward the potential solutions on the vertices. In the experiments, we show that the proposed algorithm, at the cost of additional computation time, can deliver significant depth reduction when compared to the state of the art algorithm SABRE.
