A doubly stochastic matrices-based approach to optimal qubit routing

DOI10.1007/S11128-023-04023-ZMaRDI QIDQ6107769zbMATH OpenOpenAlexFDO

Authors Nicola Mariella, Sergiy M. Zhuk

Publication date 3 July 2023

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2211.07222

zbMATH Keywords

quantum circuit compilersquantum circuit optimizationquantum circuitsquantum SWAP mapping

Mathematics Subject Classification ID

Quantum computation (81P68)

Abstract: 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.

Recommendations

• Improving quantum computation by optimized qubit routing
• Quantum circuit optimization by changing the gate order for 2D nearest neighbor architectures
• An Efficient Method for Quantum Circuit Placement Problem on a 2-D Grid
• scientific article; zbMATH DE number 7453177
• A binary integer programming-based method for qubit mapping in sparse architectures

Cites work

• An exact qubit allocation approach for NISQ architectures
• Combinatorial matrix classes
• First-order methods in optimization
• scientific article; zbMATH DE number 1601795 (Why is no real title available?)
• scientific article; zbMATH DE number 3273761 (Why is no real title available?)
• Mathematical formulation of quantum circuit design problems in networks of quantum computers
• Optimality Study of Existing Quantum Computing Layout Synthesis Tools

Cited in

(4)

• scientific article; zbMATH DE number 7496272 (Why is no real title available?)
• An Efficient Method for Quantum Circuit Placement Problem on a 2-D Grid
• Improving quantum computation by optimized qubit routing
• A binary integer programming-based method for qubit mapping in sparse architectures

This page was built for publication: A doubly stochastic matrices-based approach to optimal qubit routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6107769)