Search

With the advancement of technological footprints, high-end computation techniques, like quantum computation, have made significant progress in the design industry. Although quantum computation has proved itself as the next-generation computing paradigm, it is facing several design challenges, and one such design issue is in the form of the Nearest Neighbour (NN)t. This much-talked NN property demands the qubits in operating quantum gates to be adjacent, and a circuit should satisfy this NN property to be eligible for implementation. Considering the importance of NN enforcement in implementing circuits, we introduce a synthesis approach for the efficient transformation of reversible circuits to equivalent LNN representations. Our main focus in this work is to minimize the use of SWAP gates in designing NN-satisfied MCT-based reversible circuits. Towards transforming input circuits to LNN architecture, we have exploited a template matching scheme followed by two-qubit reordering policies, global and local, to improve the NN designs and reduce SWAP utilization. In finding the global solution, here we have used a dynamic programming algorithm where the initial order of qubit lines gets changed, while a heuristic-based SWAP placement function is used for finding a local qubit order sequence. The proposed synthesis workflow has been tested over an extensive set of benchmark functions, and comparison with the reported design approaches showed a substantial reduction in cost parameters. [ABSTRACT FROM AUTHOR]

In recent years, the semiconductor industry is increasingly considering alternative computation schemes and in this conjuncture quantum computing has come up as a promising alternative due its ability to perform parallel computations (by exploiting superposition) and capacity to solve some of the intractable problems exponentially faster. But one of the criteria in the realization of quantum circuits is that corresponding descriptions demand a so-called nearest neighbour (NN) constraint to be satisfied. One of the possible solutions towards satisfying such constraints is through the insertion of SWAP gates that makes the qubit interactions within a gate adjacent. But since the incorporation of SWAP gates increases the cost of the circuits, strategies should be employed which satisfy the NN constraint while placing SWAP gates so that the cost are reduced. In this work, we propose improved design strategies to realize low-cost NN-compliant quantum circuits. Two approaches are introduced, where the first approach relies on a graph traversal process and uses heuristics in critical decision-making conditions to design a 1D NN-compliant representation. The second approach considers qubit-to-qubit interactions and realizes the circuits in a 2D platform based on some weighted metric. Both the designs are evaluated over a wide spectrum of benchmarks and results have been compared with related works. In those comparisons, we have seen that our approaches perform fairly better than the reported ones. [ABSTRACT FROM AUTHOR]

Although this decade is witnessing tremendous advancements in fabrication technologies for quantum circuits, this industry is facing several design challenges and technological constraints. Nearest Neighbor (NN) enforcement is one such design constraint that demands the physical qubits to be adjacent. In the last couple of years, this domain has made progress starting from designing advanced algorithms to improved synthesis methodologies, even though developing efficient design solutions remains an active area of research. Here, we propose such a synthesis technique that efficiently transforms quantum circuits to NN designs. To find the NN solution, we have taken help of an ant colony algorithm which completes the circuit conversion in two phases: in the first phase, it finds the global qubit ordering for the input circuit and, in the second phase, a heuristic driven look-ahead scheme is executed for local reordering of gates. The proposed algorithm is first fitted into a 1D design and, later, mapped to 2D and 3D configurations. The combination of such heuristic and the meta-heuristic schemes has resulted promising solutions in the transformation of quantum circuits to NN-compliant architectures. We have tested our algorithm over a wide spectrum of benchmarks and comparisons with state-of-the-art design approaches showed considerable improvements. • Although this decade is witnessing tremendous advancements in fabrication technologies for quantum circuits, this industry is facing several design challenges and technological constraints. Nearest Neighbor (NN) enforcement is one such design constraint that demands the physical qubits to be adjacent. In the last couple of years, this domain has made several progresses starting from designing advanced algorithms to improved synthesis methodologies, even though developing efficient design solutions remains an active area of research. Motivated by this objective, in this work, we propose an ant colony based synthesis technique for the efficient transformation of quantum circuits to NN-compliant architectures. This synthesis scheme is implemented in two phases: In the first phase, we initiate a global qubit reordering approach which muchly depends on the ideas and applied heuristics of the ant colony algorithm. Then we execute a look-ahead-based local gate ordering technique, where we have shown three different classes of optimization. The proposed transformation scheme is first fitted into a 1D design and, later, mapped to 2D and 3D configurations. The developed transformation approach has been tested over a wide spectrum of benchmarks. Comparisons with state-of-the-art design approaches showed considerable improvements. [ABSTRACT FROM AUTHOR]

Last couple of years has witnessed tremendous advancements in the field of quantum computing and even it has started providing technological footprints in the design industry. Though advancements in the physical implementation of quantum circuits has taken a giant leap but it has faced with several design challenges and one such design constraint is Nearest Neighbor (NN) criteria which demands the operating qubits of the quantum gates to be adjacent. Focusing on the design issue, here, we show a heuristic design technique for efficient transformation of quantum circuits to NN based designs in 2D configuration. Our entire strategy is based on initial qubit mapping policy, where we have introduced three different mapping techniques 1) Influence Index, 2) Adjacency Matrix and 3) Distance Ratio based strategy. After placing the qubits in appropriate positions, we also undertake a dynamic windowing based local reordering scheme to further reduce the SWAP requirement in the designs. At the end of the work, to check the effectiveness of our transformation algorithms, we have tested a wide range of benchmarks over our algorithms and a comparative study over state-of-the-art design techniques also has been undertaken. • Last couple of years has witnessed tremendous advancements in the field of quantum computing and even it has started providing technological footprints in the design industry. • Though advancements in the physical implementation of quantum circuits has taken a giant leap but it has faced with several design challenges and one such design constraint is Nearest Neighbor (NN) criteria which demands the operating qubits of the quantum gates to be adjacent. • Focusing on the design issue, here, we show a heuristic design technique for efficient transformation of quantum circuits to NN based designs in 2D configuration. Our entire strategy is based on initial qubit mapping policy, where we have introduced three different mapping techniques 1) Influence Index, 2) Adjacency Matrix and 3) Distance Ratio based strategy. After placing the qubits in appropriate positions, we also undertake a dynamic windowing based local reordering scheme to further reduce the SWAP requirement in the designs. At the end of the work, to check the effectiveness of our transformation algorithms, we have tested a wide range of benchmarks over our algorithms and a comparative study over state-of-the-art design techniques also has been undertaken. [ABSTRACT FROM AUTHOR]