Chinese Journal of Quantum Electronics, Volume. 36, Issue 1, 40(2019)

A synthesis algorithm of quantum circuit based on look-ahead influencing factors

Yang LIU*... Xueyun CHENG, Zhijin GUAN, Yingying TAN and Yizhen WANG |Show fewer author(s)
Author Affiliations
  • [in Chinese]
  • show less

    To resolve the problem of circuit synthesis and quantum cost optimization in linear nearest neighboring of quantum circuits, an algorithm considering look-ahead influencing factors for synthesizing and optimizing the linear nearest neighbor quantum circuit is proposed. For any given non-nearest neighbor quantum circuit, the algorithm can separately measure the impact of operating the current quantum gate with different methods on the nearest neighbor cost of the subsequent quantum gate and reduce the number of SWAP gates required for the near-neighboring process of adjacent quantum gates. Thus, the requirements of constructing and optimizing linear nearest neighbor quantum circuits can be achieved. Experiments are conducted with the typical Benchmark examples, and the results of the logic synthesis algorithms for linear nearest neighbor circuit are compared among the representative and comparable research findings. Results show that the proposed optimization algorithm makes a great improvement in adding the incremental SWAP gates. Among the 22 Benchmark examples, 18(81.82%) are positively optimized, with an average positive optimization rate of 18.32%, and an average optimization rate of 11.75%.

    Tools

    Get Citation

    Copy Citation Text

    LIU Yang, CHENG Xueyun, GUAN Zhijin, TAN Yingying, WANG Yizhen. A synthesis algorithm of quantum circuit based on look-ahead influencing factors[J]. Chinese Journal of Quantum Electronics, 2019, 36(1): 40

    Download Citation

    EndNote(RIS)BibTexPlain Text
    Save article for my favorites
    Paper Information

    Category:

    Received: Sep. 7, 2017

    Accepted: --

    Published Online: Apr. 3, 2019

    The Author Email: Yang LIU (345144117@qq.com)

    DOI:10.3969/j.issn.1007-5461. 2019.01.007

    Topics