An efficient quantum circuits optimizing scheme compared with QISKit

Abstract

Recently, the development of quantum chips has made great progress-- the number of qubits is increasing and the fidelity is getting higher. However, qubits of these chips are not always fully connected, which sets additional barriers for implementing quantum algorithms and programming quantum programs. In this paper, we introduce a general circuit optimizing scheme, which can efficiently adjust and optimize quantum circuits according to arbitrary given qubits' layout by adding additional quantum gates, exchanging qubits and merging single-qubit gates. Compared with the optimizing algorithm of IBM's QISKit, the quantum gates consumed by our scheme is 74.7%, and the execution time is only 12.9% on average.

References in corpus (6)

• Elementary gates for quantum computation
• Experimental Comparison of Two Quantum Computing Architectures
• Optimal Quantum Circuits for General Two-Qubit Gates
• Resource-Aware Quantum Programming with General Recursion and Quantum Control
• Emulating anyonic fractional statistical behavior in a superconducting quantum circuit
• Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral

Cited by in corpus (4)

• Time-Sliced Quantum Circuit Partitioning for Modular Architectures
• Full-Stack, Real-System Quantum Computer Studies: Architectural Comparisons and Design Insights
• Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
• Demonstration of teleportation-based error correction in the IBM quantum computer