Harmony-search algorithm for 2D nearest neighbor quantum circuits realization

摘要: The emerging field of quantum computing is addressed in this work.A Harmony Search (HS) based algorithm proposed to efficiently realize circuits on two dimension grids.The objective minimize the number SWAP gates for nearest neighbor architecture.A local optimization heuristic embedded with HS further improve solution quality.Experimental results real benchmarks demonstrate scalability and effectiveness technique. Motivated by its promising applications, an area research. This paper addresses NP-complete problem finding Nearest Neighbor (NN) realization a 2-Dimensional grid. In certain technologies, only physically adjacent qubits are allowed interact each other hence need NN requirement. Circuits distant made NN-compliant introducing swap gates, increasing cost. work, we present intelligent metaheuristic low cost utilizing input line reordering. distinct feature technique that initial placement found using followed efficient, problem-specific perform gate insertion. demonstrated comparing performance recent published approaches. Solutions show reduction swaps needed range 4% - 36% average when compared state-of-the-art techniques. Compared approaches, implemented scalable was able find optimized within 4 seconds worst case.