Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search

Quantum algorithm design usually assumes access to a perfect quantum computer with ideal properties like full connectivity, noise-freedom, and arbitrarily long coherence time. In noisy intermediate-scale quantum (NISQ) devices, however, the number of qubits is highly limited and quantum operation error and qubit coherence are not negligible. Besides, the connectivity of physical qubits in a quantum processing unit (QPU) is also strictly constrained. Thereby, additional operations like SWAP gates have to be inserted to satisfy this constraint while preserving the functionality of the original circuit. This process is known as quantum circuit transformation. Adding additional gates will increase both the size and depth of a quantum circuit and, therefore, cause further decay of the performance of a quantum circuit. Thus, it is crucial to minimize the number of added gates. In this article, we propose an efficient method to solve this problem. We first choose by using simulated annealing an initial mapping which fits well with the input circuit and then, with the help of a heuristic cost function, stepwise apply the best-selected SWAP gates until all quantum gates in the circuit can be executed. Our algorithm runs in time polynomial in all parameters, including the size and the qubit number of the input circuit, and the qubit number in the QPU. Its space complexity is quadratic to the number of edges in the QPU. The experimental results on extensive realistic circuits confirm that the proposed method is efficient and the number of added gates of our algorithm is, on average, only 57% of that of state-of-the-art algorithms on IBM Q20 (Tokyo), the most recent IBM quantum device.

[1]  Imran Ashraf,et al.  Mapping of quantum circuits onto NISQ superconducting processors , 2019 .

[2]  Yoshio Okamoto,et al.  Approximation and Hardness for Token Swapping , 2016 .

[3]  Aleks Kissinger,et al.  CNOT circuit extraction for topologically-constrained quantum memories , 2019, Quantum Inf. Comput..

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

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

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

[7]  Gerhard W. Dueck,et al.  Finding Optimal Qubit Permutations for IBM's Quantum Computer Architectures , 2019, 2019 32nd Symposium on Integrated Circuits and Systems Design (SBCCI).

[8]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[9]  Gerhard W. Dueck,et al.  CNOT Gate Optimizations via Qubit Permutations for IBM's Quantum Architectures , 2019, J. Low Power Electron..

[10]  Matthias Troyer,et al.  A software methodology for compiling quantum programs , 2016, ArXiv.

[11]  Hideharu Amano,et al.  Extracting Success from IBM’s 20-Qubit Machines Using Error-Aware Compilation , 2019, ACM J. Emerg. Technol. Comput. Syst..

[12]  Gushu Li,et al.  SANQ: A Simulation Framework for Architecting Noisy Intermediate-Scale Quantum Computing System , 2019, ArXiv.

[13]  Margaret Martonosi,et al.  Full-Stack, Real-System Quantum Computer Studies: Architectural Comparisons and Design Insights , 2019, 2019 ACM/IEEE 46th Annual International Symposium on Computer Architecture (ISCA).

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

[15]  Margaret Martonosi,et al.  Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers , 2019, ASPLOS.

[16]  Noga Alon,et al.  Routing permutations on graphs via matchings , 1993, SIAM J. Discret. Math..

[17]  Alexandru Paler.  On the Influence of Initial Qubit Placement During NISQ Circuit Compilation , 2017, QTOP@NetSys.

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

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

[20]  Fei Yan,et al.  A quantum engineer's guide to superconducting qubits , 2019, Applied Physics Reviews.

[21]  Robert Wille,et al.  Computer-Aided Design for Quantum Computation , 2018, 2018 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[22]  Michele Mosca,et al.  Quantum circuit optimizations for NISQ architectures , 2019, Quantum Science and Technology.

[23]  Jay M. Gambetta,et al.  Building logical qubits in a superconducting quantum computing system , 2015, 1510.04375.

[24]  J. Christopher Beck,et al.  Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation , 2018, ICAPS.

[25]  Moinuddin K. Qureshi,et al.  Not All Qubits Are Created Equal: A Case for Variability-Aware Policies for NISQ-Era Quantum Computers , 2018, ASPLOS.

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

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

[28]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[29]  Bryan O'Gorman,et al.  Quantum Circuit Compilation : An Emerging Application for Automated Reasoning , 2019 .

[30]  Akihiro Kishimoto,et al.  On the Complexity of Quantum Circuit Compilation , 2018, SOCS.

[31]  Michael Cubeddu,et al.  Qubit Allocation for Noisy Intermediate-Scale Quantum Computers , 2018 .

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

[33]  Andrew M. Childs,et al.  Circuit Transformations for Quantum Architectures , 2019, TQC.