Optimization of Quantum Circuit Mapping using Gate Transformation and Commutation

This paper addresses quantum circuit mapping for Noisy Intermediate-Scale Quantum (NISQ) computers. Since NISQ computers constraint two-qubit operations on limited couplings, an input circuit must be transformed into an equivalent output circuit obeying the constraints. The transformation often requires additional gates that can affect the accuracy of running the circuit. Based upon a previous work of quantum circuit mapping that leverages gate commutation rules, this paper shows algorithms that utilize both transformation and commutation rules. Experiments on a standard benchmark dataset confirm the algorithms with more rules can find even better circuit mappings compared with the previously-known best algorithms.

[1]  Jeremy Frank,et al.  Temporal Planning for Compilation of Quantum Approximate Optimization Circuits , 2017, IJCAI.

[2]  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).

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

[4]  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).

[5]  Stefan Frehse,et al.  RevKit: An Open Source Toolkit for the Design of Reversible Circuits , 2011, RC.

[6]  Robert Wille,et al.  NISQ circuit compilers: search space structure and heuristics , 2018, ArXiv.

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

[8]  Andrew W. Cross,et al.  Quantum circuit compilers using gate commutation rules , 2019, ASP-DAC.

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

[10]  Susmita Sur-Kolay,et al.  Linear Nearest Neighbor Synthesis of Reversible Circuits by Graph Partitioning , 2011, ArXiv.

[11]  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.

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

[13]  V.V. Shende,et al.  Synthesis of quantum-logic circuits , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[14]  Gerhard W. Dueck,et al.  Synthesis of Linear Nearest Neighbor Quantum Circuits , 2015, ArXiv.

[15]  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).

[16]  Masaki Nakanishi,et al.  An efficient conversion of quantum circuits to a linear nearest neighbor architecture , 2011, Quantum Inf. Comput..

[17]  Shigeru Yamashita,et al.  Changing the Gate Order for Optimal LNN Conversion , 2011, RC.

[18]  Alireza Shafaei,et al.  Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures , 2013, 2013 50th ACM/EDAC/IEEE Design Automation Conference (DAC).

[19]  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.

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

[21]  Anupam Chattopadhyay,et al.  Depth-Optimal Quantum Circuit Placement for Arbitrary Topologies , 2017, ArXiv.

[22]  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).

[23]  Robert Wille,et al.  Synthesis of quantum circuits for linear nearest neighbor architectures , 2011, Quantum Inf. Process..