Fast Qubit Placement in 2D Architecture Using Nearest Neighbor Realization

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 sc...

Full description

Saved in:
Bibliographic Details
Published in2015 IEEE International Symposium on Nanoelectronic and Information Systems pp. 95 - 100
Main Authors Shrivastwa, Ritu Ranjan, Datta, Kamalika, Sengupta, Indranil
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2015
Subjects
Benchmark testing
Computer architecture
Computers
Logic gates
nearest neighbor
Photonics
Quantum circuit
Quantum computing
Quantum dots
qubit
Online AccessGet full text

Cover

More Information
Summary: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.
DOI:10.1109/iNIS.2015.59