Harmony-search algorithm for 2D nearest neighbor quantum circuits realization
作者：
Highlights：
• The emerging field of quantum computing is addressed in this work.
• A Harmony Search (HS) based algorithm is proposed to efficiently realize quantum circuits on two dimension grids.
• The objective is to minimize the number of SWAP gates for two dimension nearest neighbor architecture.
• A local optimization heuristic is embedded with HS algorithm to further improve the solution quality.
• Experimental results on real benchmarks demonstrate the scalability and effectiveness of the proposed technique.
摘要
•The emerging field of quantum computing is addressed in this work.•A Harmony Search (HS) based algorithm is proposed to efficiently realize quantum circuits on two dimension grids.•The objective is to minimize the number of SWAP gates for two dimension nearest neighbor architecture.•A local optimization heuristic is embedded with HS algorithm to further improve the solution quality.•Experimental results on real benchmarks demonstrate the scalability and effectiveness of the proposed technique.
论文关键词：Quantum circuit,2D Nearest neighbor,Reversible circuit,Algorithm,Harmony search
论文评审过程：Received 12 December 2015, Revised 29 April 2016, Accepted 30 April 2016, Available online 14 May 2016, Version of Record 24 May 2016.
论文官网地址：https://doi.org/10.1016/j.eswa.2016.04.038
