Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Multiple-Valued Logic (ISMVL)

Efficient Implementation of Nearest Neighbor Quantum Circuits Using Clustering with Genetic Algorithm

Anirban Bhattacharjee, Chandan Bandyopadhyay, Angshu Mukherjee, Robert Wille, Rolf Drechsler, Hafizur Rahaman

Published Nov 1, 2020• 14 citations
Publisher

Abstract

Although quantum computing has made tremendous progress in last couple of years and technologies like NMR, Ion Trap, superconducting qubits have come out as promising platforms to implement quantum computing devices, such technologies are facing several design constraints. One such constraint is the Nearest Neighbor (NN) property, which demands the adjacency of logical qubits. Aiming to contribute to this cause, here we are proposing an improved design approach for transforming quantum circuits for NN-based architectures using genetic algorithms. In this work, our primary objective remains to form efficient NN structures by restricting the SWAP usage. In the design phase, initially, we use the k-means clustering scheme for partitioning the qubits into separate objects and, then, a genetic algorithm is applied that eventually fixes the order of qubits for each individual cluster. In the final phase, all these local solutions are combined and, again, a genetic algorithm is employed to obtain a global solution. We have tested our approach over a large spectrum of benchmarks and improvements are registered over some state-of-the-art design works.

DOI
10.1109/ismvl49045.2020.00-32

Related papers

An Efficient 2D Mapping of Quantum Circuits to Nearest Neighbor Designs

Anirban Bhattacharjee, Hafizur Rahaman

In the last few years, tremendous improvement in the field of quantum computing has been witnessed. Although quantum technologies such as ion-trap, NMR, quantum dots have emerged as the promising platforms for implementing quantum circuits but these technologies have faced several design issues. One such important design problem is the nearest neighbor condition, which requires the qubits to interact with adjacent neighbors. This problem can be addressed by adding SWAP gates in the circuit. By doing so, the overhead in the circuit increases thus NN designs with minimum number of SWAP gates need to be developed. Focusing on this, here, in this work, we introduce a heuristic design method for efficient NN realization of quantum circuits in 2D architecture. Our NN transformation process is carried out in two phases, where initially in the first phase, the input circuit is mapped to 2D configuration using a qubit placement strategy and then in the second phase NN designs are obtained through SWAP gate insertion. At the end, the design algorithm has been evaluated over a large set of benchmark functions and the results are compared with some of the existing works. From this comparison, it is seen that our proposed method performs better than the reported works.

IEEE International Symposium on Smart Electronic Systems (iSES)•Dec 1, 2021•2 citations

Linear Nearest Neighbor Realization of Quantum Circuits Using Clustering and Look-ahead Policy

Anirban Bhattacharjee, Chandan Bandyopadhyay, Bappaditya Mondal +1 more

In the last couple of years, quantum computing has come out as emerging trends of computation not only due to its immense popularity but also for its commitment towards physical realization of quantum circuit in on-chip units. At the same time, the process of physical realization has faced several design constraints and one such problem is nearest neighbor (NN) enforcement which demands all the operating qubits to be placed adjacent in the implementable circuit. Though SWAP gate embedment can transform a design into NN architecture, it still creates overhead in the design. So, designing algorithms to restrict the use of SWAPs bears high importance. Considering this fact, in this work, we are proposing a heuristic-based improved qubit placement strategy for efficient implementation of NN circuit. Two different design policies are being developed here. In the first scheme, a global reordering technique based on clustering approach is shown. In the second scheme, a local reordering technique based on look-ahead policy is developed. This look-ahead strategy considers the impact over the gates in the circuit and thereby estimates the effect using a cost metric to decide the suitable option for SWAP implementation. Furthermore, the joint use of both the ordering schemes also has been explored here. To ascertain the correctness of our design algorithms, we have tested them over a wide range of benchmarks and the obtained results are compared with some state-of-the-art design approaches. From this comparison, we have witnessed a considerable reduction on SWAP cost in our design scheme against the reported works’ results.

Journal of Circuits Systems and Computers•Jul 18, 2020•2 citations

An Improved Circuit Transformation Technique for Nearest Neighbor Implementation of Quantum Circuits

Sourodeep Kundu, Subham Kumar, Laxmidhar Biswal +3 more

Advancements in quantum circuit manufacturing methodologies have exhibited substantial progress over the past decade. One persisting challenge and technological constraint in this domain is the Nearest Neighbour (NN) implementation, necessitating physical qubits to be adjacent. One of the promising solutions to addressing this nearest neighbor problem was recognized, revealing that optimizing the grid selection could lead to a substantial reduction in the conversion cost for nearest neighbors and a more efficient utilization of SWAP operations. We have employed a mapping scheme to situate them effectively within suitable 2D grids. The conversion of quantum circuits into NN-compatible designs demonstrates promising outcomes, surpassing heuristic and meta- heuristic techniques. Through experimental evaluations and comparisons with state-of-the-art methodologies, we have identified significant enhancements. Experimental results exhibit notable breakthroughs, showcasing advancements of approximately 7.63%, 11.76%, 20.5%, 25.46% and 11.56% over existing 2D works. Furthermore, considerable improvements of 16.87% and 5.46% have been registered over large 2D benchmarks and meta-heuristic approaches, respectively.

International Symposium on VLSI Design and Test (VDAT)•Sep 1, 2024•0 citations

A Novel Approach for Nearest Neighbor Realization of 2D Quantum Circuits

Anirban Bhattacharjee, Chandan Bandyopadhyay, Robert Wille +2 more

Since decades, quantum computing has received tremendous attention among the researchers due to its dominance over classical computing. But simultaneously it has faced some design challenges and implementation constraints in this long run. One such constraint to build quantum circuits is to satisfy the so-called Nearest Neighbor (NN) property in the implemented circuits. Using SWAP gates, this constraint can be satisfied. But this leads to another design issue, namely how to determine such NN designs with a minimum use of SWAP gates. In way to further explore this area, in this work, we propose a heuristic approach for efficient NN complaint representation of quantum circuits in 2D space. The developed technique is segmented in three stages - qubit selection, qubit placement and SWAP gate insertion. The stated approach has been tested over a wide spectrum of benchmarks and reductions in cost parameters are observed. Improvement of more than 17%, 3% over 2D designs and 35%, 22% over 1D designs on SWAP count and quantum cost can be reported, respectively.

IEEE Computer Society Annual Symposium on VLSI•Jul 1, 2018•35 citations

Fast Qubit Placement in 2D Architecture Using Nearest Neighbor Realization

Ritu Ranjan Shrivastwa, Kamalika Datta, Indranil Sengupta

Design and synthesis of quantum circuits have gained huge momentum during the last few years. With various physical constraint sone of the major issues is in making quantum circuits nearest neighbor complaint. The existing one and two dimensional architectures for the placement of qubits does not scale well for larger circuits. The situation thus demands for a faster approach to solve the problem. To make a quantum circuit nearest neighbor compliant, SWAP gates are inserted in the quantum gate circuit to bring the interacting qubits of a gate adjacent. We have proposed a faster method with a simple yet effective algorithm to minimize the number of SWAP gates for adjacent interactions. The time required for processing does not exceed one second even for larger benchmark circuits. The proposed method is found to reduce the number of SWAP gates on an average by 9.5% compared to the best results in previous works on 2D architectures, and by 45.7% compared to the best results on 1D architecture.

IEEE International Symposium on Nanoelectronic and Information Systems (iNIS)•Dec 1, 2015•42 citations

A Novel 2D Mapping Scheme for Nearest Neighbor Design of Quantum Circuits

Subham Kumar, Anirban Bhattacharjee, Sudip Ghosh +1 more

In the last few years, quantum computing has gained the attention of the researchers due to its ability to perform parallel and exponentially faster computation over classical computing. One of the prominent challenges for quantum circuits is to satisfy the nearest neighbor (NN) condition, i.e., the qubits of the computing gate must be placed adjacent. Based on this fact, here, in this paper, we have proposed a heuristic synthesis workflow to realize NN circuits in 2D grid configuration. The implemented approach has been evaluated over a broad range of benchmark circuits and we have reported the best results. To validate the efficiency of the stated approach, we have compared it with the previously reported works, an average improvement of 15.94%, 8.89% and 10.98% are obtained over the existing 2D works, and 44.72% and 70.35% are obtained over existing 1D works, respectively.

IEEE International Conference of Electron Devices Society Kolkata Chapter (EDKCON)•Nov 26, 2022•2 citations
Although quantum computing has made tremendous progress in last couple of years and technologies like NMR, Ion Trap, superconducting qubits have come out as promising platforms to implement quantum computing devices, such technologies are facing several design constraints. One such constraint is the Nearest Neighbor (NN) property, which demands the adjacency of logical qubits. Aiming to contribute to this cause, here we are proposing an improved design approach for transforming quantum circuits for NN-based architectures using genetic algorithms. In this work, our primary objective remains to form efficient NN structures by restricting the SWAP usage. In the design phase, initially, we use the k-means clustering scheme for partitioning the qubits into separate objects and, then, a genetic algorithm is applied that eventually fixes the order of qubits for each individual cluster. In the final phase, all these local solutions are combined and, again, a genetic algorithm is employed to obtain a global solution. We have tested our approach over a large spectrum of benchmarks and improvements are registered over some state-of-the-art design works.
In the last few years, tremendous improvement in the field of quantum computing has been witnessed. Although quantum technologies such as ion-trap, NMR, quantum dots have emerged as the promising platforms for implementing quantum circuits but these technologies have faced several design issues. One such important design problem is the nearest neighbor condition, which requires the qubits to interact with adjacent neighbors. This problem can be addressed by adding SWAP gates in the circuit. By doing so, the overhead in the circuit increases thus NN designs with minimum number of SWAP gates need to be developed. Focusing on this, here, in this work, we introduce a heuristic design method for efficient NN realization of quantum circuits in 2D architecture. Our NN transformation process is carried out in two phases, where initially in the first phase, the input circuit is mapped to 2D configuration using a qubit placement strategy and then in the second phase NN designs are obtained through SWAP gate insertion. At the end, the design algorithm has been evaluated over a large set of benchmark functions and the results are compared with some of the existing works. From this comparison, it is seen that our proposed method performs better than the reported works.
In the last couple of years, quantum computing has come out as emerging trends of computation not only due to its immense popularity but also for its commitment towards physical realization of quantum circuit in on-chip units. At the same time, the process of physical realization has faced several design constraints and one such problem is nearest neighbor (NN) enforcement which demands all the operating qubits to be placed adjacent in the implementable circuit. Though SWAP gate embedment can transform a design into NN architecture, it still creates overhead in the design. So, designing algorithms to restrict the use of SWAPs bears high importance. Considering this fact, in this work, we are proposing a heuristic-based improved qubit placement strategy for efficient implementation of NN circuit. Two different design policies are being developed here. In the first scheme, a global reordering technique based on clustering approach is shown. In the second scheme, a local reordering technique based on look-ahead policy is developed. This look-ahead strategy considers the impact over the gates in the circuit and thereby estimates the effect using a cost metric to decide the suitable option for SWAP implementation. Furthermore, the joint use of both the ordering schemes also has been explored here. To ascertain the correctness of our design algorithms, we have tested them over a wide range of benchmarks and the obtained results are compared with some state-of-the-art design approaches. From this comparison, we have witnessed a considerable reduction on SWAP cost in our design scheme against the reported works’ results.
Advancements in quantum circuit manufacturing methodologies have exhibited substantial progress over the past decade. One persisting challenge and technological constraint in this domain is the Nearest Neighbour (NN) implementation, necessitating physical qubits to be adjacent. One of the promising solutions to addressing this nearest neighbor problem was recognized, revealing that optimizing the grid selection could lead to a substantial reduction in the conversion cost for nearest neighbors and a more efficient utilization of SWAP operations. We have employed a mapping scheme to situate them effectively within suitable 2D grids. The conversion of quantum circuits into NN-compatible designs demonstrates promising outcomes, surpassing heuristic and meta- heuristic techniques. Through experimental evaluations and comparisons with state-of-the-art methodologies, we have identified significant enhancements. Experimental results exhibit notable breakthroughs, showcasing advancements of approximately 7.63%, 11.76%, 20.5%, 25.46% and 11.56% over existing 2D works. Furthermore, considerable improvements of 16.87% and 5.46% have been registered over large 2D benchmarks and meta-heuristic approaches, respectively.
Since decades, quantum computing has received tremendous attention among the researchers due to its dominance over classical computing. But simultaneously it has faced some design challenges and implementation constraints in this long run. One such constraint to build quantum circuits is to satisfy the so-called Nearest Neighbor (NN) property in the implemented circuits. Using SWAP gates, this constraint can be satisfied. But this leads to another design issue, namely how to determine such NN designs with a minimum use of SWAP gates. In way to further explore this area, in this work, we propose a heuristic approach for efficient NN complaint representation of quantum circuits in 2D space. The developed technique is segmented in three stages - qubit selection, qubit placement and SWAP gate insertion. The stated approach has been tested over a wide spectrum of benchmarks and reductions in cost parameters are observed. Improvement of more than 17%, 3% over 2D designs and 35%, 22% over 1D designs on SWAP count and quantum cost can be reported, respectively.
Design and synthesis of quantum circuits have gained huge momentum during the last few years. With various physical constraint sone of the major issues is in making quantum circuits nearest neighbor complaint. The existing one and two dimensional architectures for the placement of qubits does not scale well for larger circuits. The situation thus demands for a faster approach to solve the problem. To make a quantum circuit nearest neighbor compliant, SWAP gates are inserted in the quantum gate circuit to bring the interacting qubits of a gate adjacent. We have proposed a faster method with a simple yet effective algorithm to minimize the number of SWAP gates for adjacent interactions. The time required for processing does not exceed one second even for larger benchmark circuits. The proposed method is found to reduce the number of SWAP gates on an average by 9.5% compared to the best results in previous works on 2D architectures, and by 45.7% compared to the best results on 1D architecture.
In the last few years, quantum computing has gained the attention of the researchers due to its ability to perform parallel and exponentially faster computation over classical computing. One of the prominent challenges for quantum circuits is to satisfy the nearest neighbor (NN) condition, i.e., the qubits of the computing gate must be placed adjacent. Based on this fact, here, in this paper, we have proposed a heuristic synthesis workflow to realize NN circuits in 2D grid configuration. The implemented approach has been evaluated over a broad range of benchmark circuits and we have reported the best results. To validate the efficiency of the stated approach, we have compared it with the previously reported works, an average improvement of 15.94%, 8.89% and 10.98% are obtained over the existing 2D works, and 44.72% and 70.35% are obtained over existing 1D works, respectively.