An Efficient Quantum Circuits Optimizing Scheme Compared with QISKit (Short Paper)

  • Xin Zhang
  • Hong XiangEmail author
  • Tao Xiang
Conference paper
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 268)


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.


Quantum computing Quantum circuit Circuit optimizing 



The work is supported by National Key R&D Program of China (NO. 2017YFB0802000).


  1. 1.
    The backend information of IBM quantum cloud.
  2. 2.
    QISKit developer challenge.
  3. 3.
    QISKit Python API.
  4. 4.
    The url of alibaba’s quantum cloud platform.
  5. 5.
    Barenco, A., et al.: Elementary gates for quantum computation. Phys. Rev. A 52(5), 3457 (1995)CrossRefGoogle Scholar
  6. 6.
    Cheung, D., Maslov, D., Severini, S.: Translation techniques between quantum circuit architectures. AAPT (2007)Google Scholar
  7. 7.
    Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 212–219. ACM (1996)Google Scholar
  8. 8.
    Linke, N.M., et al.: Experimental comparison of two quantum computing architectures. In: Proceedings of the National Academy of Sciences, p. 201618020 (2017)Google Scholar
  9. 9.
    Nielsen, M.A., Chuang, I.: Quantum Computation and Quantum Information (2002)Google Scholar
  10. 10.
  11. 11.
    Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303–332 (1999)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Simon, D.R.: On the power of quantum computation. SIAM J. Comput. 26(5), 1474–1483 (1997)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Xin, T., et al.: NMRCloudQ: a quantum cloud experience on a nuclear magnetic resonance quantum computer. Sci. Bull. 63, 17–23 (2017)CrossRefGoogle Scholar
  14. 14.
    Zhong, Y., et al.: Emulating anyonic fractional statistical behavior in a superconducting quantum circuit. Phys. Rev. Lett. 117(11), 110501 (2016)CrossRefGoogle Scholar

Copyright information

© ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2019

Authors and Affiliations

  1. 1.School of Big Data and Software EngineeringChongqing UniversityChongqingChina
  2. 2.Key Laboratory of Dependable Service Computing in Cyber Physical SocietyChongqing University, Ministry of EducationChongqingChina
  3. 3.School of Computer ScienceChongqing UniversityChongqingChina

Personalised recommendations