Compiling SU(4) quantum circuits to IBM QX architectures

The Noisy Intermediate-Scale Quantum (NISQ) technology is currently investigated by major players in the field to build the first practically useful quantum computer. IBM QX architectures are the first ones which are already publicly available today. However, in order to use them, the respective quantum circuits have to be compiled for the respectively used target architecture. While first approaches have been proposed for this purpose, they are infeasible for a certain set of SU(4) quantum circuits which have recently been introduced to benchmark corresponding compilers. In this work, we analyze the bottlenecks of existing compilers and provide a dedicated method for compiling this kind of circuits to IBM QX architectures. Our experimental evaluation (using tools provided by IBM) shows that the proposed approach significantly outperforms IBM's own solution regarding fidelity of the compiled circuit as well as runtime. Moreover, the solution proposed in this work has been declared winner of the IBM QISKit Developer Challenge. An implementation of the proposed methodology is publicly available at http://iic.jku.at/eda/research/ibm_qx_mapping.

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

[2]  Chen-Fu Chiang,et al.  Scaffold: Quantum Programming Language , 2012 .

[3]  Robert Wille,et al.  Improving the mapping of reversible circuits to quantum circuits using multiple target lines , 2013, 2013 18th Asia and South Pacific Design Automation Conference (ASP-DAC).

[4]  Jeremy Frank,et al.  Compiling quantum circuits to realistic hardware architectures using temporal planners , 2017, ArXiv.

[5]  Eyob A. Sete,et al.  A functional architecture for scalable quantum computing , 2016, 2016 IEEE International Conference on Rebooting Computing (ICRC).

[6]  Colin P. Williams,et al.  Optimal quantum circuits for general two-qubit gates (5 pages) , 2003, quant-ph/0308006.

[7]  Lee Gomes,et al.  Quantum computing: Both here and not here , 2018, IEEE Spectrum.

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

[9]  Robert Wille,et al.  Exact Global Reordering for Nearest Neighbor Quantum Circuits Using A ^* ∗ , 2017, RC.

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

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

[12]  Benoît Valiron,et al.  Quipper: a scalable quantum programming language , 2013, PLDI.

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

[14]  Barenco,et al.  Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.

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

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

[17]  Andrew W. Cross,et al.  Open Quantum Assembly Language , 2017, 1707.03429.

[18]  P. Oscar Boykin,et al.  A new universal and fault-tolerant quantum basis , 2000, Inf. Process. Lett..

[19]  Rachel Courtland,et al.  Google aims for quantum computing supremacy [News] , 2017 .

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

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

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

[23]  Simon J. Devitt,et al.  Implementation of Shor's algorithm on a linear nearest neighbour qubit array , 2004, Quantum Inf. Comput..