A Heuristic Qubit Placement Strategy for Nearest Neighbor Realization in 2D Architecture
Recently, quantum computing has received massive attention of the researchers due to the advantages it offers in solving some problems efficiently compared to conventional computing. But there are several design challenges that need to be satisfied for various quantum technologies to perform reliable quantum operation. One such essential requirement demands to maintain the neighborhood organization of the operating qubits, referred to as the nearest neighbor (NN) constraint. This can be settled through insertion of SWAP gates which helps to synthesize a NN-compliant design by exchanging the positions of the qubits. Consequently, the cost overhead of the circuit enhances due to SWAP gate insertion as the number of gates in the circuit increases, thereby exploitation of various approaches to address this issue has turned out to be essential of late.
In this regard, here we have introduced an improved heuristic design approach for the synthesis of a two dimensional NN-compliant circuit with reduced cost overhead. The approach has been executed in three phases of qubit selection, qubit placement and SWAP gate insertion. Initially, the qubits have been chosen for placement based on some cost metric estimation and then organized them on the grid locations in a specific order in the second phase. Lastly, SWAP gate insertion phase has been exercised to make qubits adjacent. It has been observed that our method has performed comparatively better than the previous works after carrying out experimental evaluations over a wide range of benchmark specifications.
KeywordsQuantum circuit Quantum gates Nearest neighbor SWAP gate 2D architecture
- 2.Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Symposium on the Theory of Computing, pp. 212–219 (1996)Google Scholar
- 9.Perkowski, M., Lukac, M., Shah, D., Kameyama, M.: Synthesis of quantum circuits in linear nearest neighbor model using positive Davio lattices (2011)Google Scholar
- 10.Shafaei, A., Saeedi, M., Pedram, M.: Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures. In: Design Automation Conference (2013)Google Scholar
- 11.Chakrabarti, A., Sur-Kolay, S., Chaudhury, A.: Linear nearest neighbour synthesis of reversible circuits by graph partitioning. arXiv preprint arXiv:1112.0564 (2011)
- 14.Shafaei, A., Saeedi, M., Pedram, M.: Qubit placement to minimize communication overhead in 2D quantum architectures. In: Proceedings of ASP Design Automation Conference, pp. 495–500, January 2014Google Scholar
- 15.Lye, A., Wille, R., Drechsler, R.: Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits. In: Proceedings of ASP Design Automation Conference, pp. 178–183, January 2015Google Scholar
- 17.Shrivastwa, R., Datta, K., Sengupta, I.: Fast qubit placement in 2D architecture using nearest neighbour realization. In: IEEE International Symposium on Nanoelectronic and Information Systems, pp. 95–100, December 2015Google Scholar
- 18.Wille, R., Keszocze, O., Walter, M., Rohrs, P., Chattopadhyay, A., Drechsler, R.: Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits. In: Proceedings of ASP Design Automation Conference, pp. 292–297, January 2016Google Scholar
- 20.Barenco, A., et al.: Elementary gates for quantum computation. APS Phys. Rev. 52, 3457–3467 (1995)Google Scholar
- 22.Miller, D., Wille, R., Sasanian, Z.: Elementary quantum gate realizations for multiple-control Toffolli gates. In: Proceedings of International Symposium on Multiple-valued Logic, pp. 217–222 (2011)Google Scholar
- 23.Sasanian, Z., Wille, R., Miller, D.M.: Realizing reversible circuits using a new class of quantum gates. In: Proceedings of Design Automation Conference, pp. 36–41 (2012)Google Scholar
- 24.Wille, R., Große, D., Teuber, L., Dueck, G.W., Drechsler, R.: RevLib: an online resource for reversible functions and reversible circuits. In: International Symposium on Multi-Valued Logic, pp. 220–225 (2008). RevLib is available at http://www.revlib.org