A Dynamic Look-Ahead Heuristic for the Qubit Mapping Problem of NISQ Computers

In the past few years, several quantum computers realized by the noisy intermediate-scale quantum (NISQ) technology have been released. However, there exists a significant limitation to using such computers, i.e., the connectivity constraint between physical qubits. To perform a 2-qubit quantum operation on such NISQ computers, its two logical qubits have to be mapped to a pair of physical qubits that satisfy the connectivity constraint. This mapping procedure requires additional operations to be introduced into the original quantum circuit, reducing its fidelity. Therefore, it is of great significance to design an algorithm that is able to complete the mapping task with minimal additional operations. In this article, we propose an efficient algorithm to solve this problem. Our algorithm consists of two core components, an expansion-from-center scheme to determine the initial mapping and a SWAP-based heuristic search algorithm to update the mapping. We introduce the maximum consecutive positive effect of a SWAP operation as the heuristic cost function, allowing our search algorithm to look ahead dynamically. Our algorithm is evaluated on IBM Q 20. The experimental results show that our algorithm can complete the mapping task in a very short time even for large-scale benchmarks with hundreds of thousands of operations, and outperforms the state-of-the-art in terms of the number of additional operations for most benchmarks considered.

[1]  Fernando Magno Quintão Pereira,et al.  Qubit allocation , 2018, CGO.

[2]  Ross Duncan,et al.  On the qubit routing problem , 2019, TQC.

[3]  Massoud Pedram,et al.  Layout Optimization for Quantum Circuits with Linear Nearest Neighbor Architectures , 2016, IEEE Circuits and Systems Magazine.

[4]  Robert Wille,et al.  Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits , 2015, The 20th Asia and South Pacific Design Automation Conference.

[5]  M. Mosca,et al.  A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits , 2012, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  Robert Wille,et al.  An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Architectures , 2017, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  N. Linke,et al.  High-Fidelity Quantum Logic Gates Using Trapped-Ion Hyperfine Qubits. , 2015, Physical review letters.

[8]  John Preskill,et al.  Quantum Computing in the NISQ era and beyond , 2018, Quantum.

[9]  Robert Wille,et al.  Mapping Quantum Circuits to IBM QX Architectures Using the Minimal Number of SWAP and H Operations , 2019, 2019 56th ACM/IEEE Design Automation Conference (DAC).

[10]  K. Bertels,et al.  Mapping of lattice surgery-based quantum circuits on surface code architectures , 2018, Quantum Science and Technology.

[11]  Dmitri Maslov,et al.  Quantum Circuit Placement , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  Robert Wille,et al.  Elementary Quantum Gate Realizations for Multiple-Control Toffoli Gates , 2011, 2011 41st IEEE International Symposium on Multiple-Valued Logic.

[13]  Gushu Li,et al.  Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices , 2018, ASPLOS.

[14]  Imtiaz Ahmad,et al.  Harmony-search algorithm for 2D nearest neighbor quantum circuits realization , 2016, Expert Syst. Appl..

[15]  Susmita Sur-Kolay,et al.  PAQCS: Physical Design-Aware Fault-Tolerant Quantum Circuit Synthesis , 2015, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[16]  D. West.  Introduction to Graph Theory , 1995 .

[17]  Robert Wille,et al.  Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits , 2016, 2016 21st Asia and South Pacific Design Automation Conference (ASP-DAC).

[18]  Gian Giacomo Guerreschi,et al.  Two-step approach to scheduling quantum circuits , 2018, Quantum Science and Technology.

[19]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[20]  Naser Mohammadzadeh,et al.  Qubit mapping of one-way quantum computation patterns onto 2D nearest-neighbor architectures , 2019, Quantum Inf. Process..

[21]  Benjamín Barán,et al.  Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective , 2017, Quantum Information Processing.

[22]  Kazuyuki Amano,et al.  Representation of Quantum Circuits with Clifford and $\pi/8$ Gates , 2008, 0806.3834.

[23]  Kamalika Datta,et al.  A Heuristic for Linear Nearest Neighbor Realization of Quantum Circuits by SWAP Gate Insertion Using $N$-Gate Lookahead , 2016, IEEE Journal on Emerging and Selected Topics in Circuits and Systems.

[24]  Akash Sengupta,et al.  Using Reinforcement Learning to find Efficient Qubit Routing Policies for Deployment in Near-term Quantum Computers , 2018, 1812.11619.

[25]  Naser MohammadZadeh,et al.  Quantum circuit physical design flow for 2D nearest‐neighbor architectures , 2017, Int. J. Circuit Theory Appl..

[26]  Robert Wille,et al.  Optimal SWAP gate insertion for nearest neighbor quantum circuits , 2014, 2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC).

[27]  Kamalika Datta,et al.  A New Heuristic for $N$ -Dimensional Nearest Neighbor Realization of a Quantum Circuit , 2018, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[28]  Robert Wille,et al.  Exact Reordering of Circuit Lines for Nearest Neighbor Quantum Architectures , 2014, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[29]  Alireza Shafaei,et al.  Qubit placement to minimize communication overhead in 2D quantum architectures , 2014, 2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC).

[30]  I. Chuang,et al.  Quantum Computation and Quantum Information: Introduction to the Tenth Anniversary Edition , 2010 .