Advertisement

A Heuristic Qubit Placement Strategy for Nearest Neighbor Realization in 2D Architecture

  • Anirban Bhattacharjee
  • Chandan BandyopadhyayEmail author
  • Laxmidhar Biswal
  • Hafizur Rahaman
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 892)

Abstract

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.

Keywords

Quantum circuit Quantum gates Nearest neighbor SWAP gate 2D architecture 

References

  1. 1.
    Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484–1509 (1997)MathSciNetCrossRefGoogle Scholar
  2. 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
  3. 3.
    Kielpinski, D., Monroe, C., Wineland, D.J.: Architecture for a largescale ion-trap quantum computer. Nature 417(6890), 709–711 (2002)CrossRefGoogle Scholar
  4. 4.
    Criger, B., Passante, G., Park, D., Laflamme, R.: Recent advances in nuclear magnetic resonance quantum information processing. Philos. Trans. R. Soc. Lond. A: Math. Phys. Eng. Sci. 370(1976), 4620–4635 (2012)CrossRefGoogle Scholar
  5. 5.
    Taylor, J., Petta, J., Johnson, A., Yacoby, A., Marcus, C., Lukin, M.: Relaxation, dephasing, and quantum control of electron spins in double quantum dots. Phys. Rev. B 76(3), 035315 (2007)CrossRefGoogle Scholar
  6. 6.
    Blais, A., et al.: Quantum information processing with circuit quantum electrodynamics. Phys. Rev. A 75(3), 032329 (2007)CrossRefGoogle Scholar
  7. 7.
    Alfailakawi, M., Alterkawi, L., Ahmad, I., Hamdan, S.: Line ordering of reversible circuits for linear nearest neighbor realization. Quant. Info. Proc. 12(10), 3319–3339 (2013)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Saeedi, M., Wille, R., Drechsler, R.: Synthesis of quantum circuits for linear nearest neighbor architectures. Quant. Info. Proc. 10(3), 355–377 (2011)MathSciNetCrossRefGoogle Scholar
  9. 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. 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. 11.
    Chakrabarti, A., Sur-Kolay, S., Chaudhury, A.: Linear nearest neighbour synthesis of reversible circuits by graph partitioning. arXiv preprint arXiv:1112.0564 (2011)
  12. 12.
    Hirata, Y., Nakanishi, M., Yamashita, S., Nakashima, Y.: An efficient conversion of quantum circuits to a linear nearest neighbor architecture. Quantum Info. Comput. 11(1), 142–166 (2011)MathSciNetzbMATHGoogle Scholar
  13. 13.
    Wille, R., Lye, A., Drechsler, R.: Exact reordering of circuit lines for nearest neighbour quantum architectures. IEEE Trans. CAD 33(12), 1818–1831 (2014)CrossRefGoogle Scholar
  14. 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. 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
  16. 16.
    Alfailakawi, M.G., Ahmad, I., Hamdan, S.: Harmony-search algorithm for 2D nearest neighbor quantum circuits realization. Expert Syst. Appl. 61, 16–27 (2016)CrossRefGoogle Scholar
  17. 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. 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
  19. 19.
    Kole, A., Datta, K., Sengupta, I.: A new heuristic for N-dimensional nearest neighbour realization of a quantum circuit. In: IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 12 (2017).  https://doi.org/10.1109/tcad.2017.2693284CrossRefGoogle Scholar
  20. 20.
    Barenco, A., et al.: Elementary gates for quantum computation. APS Phys. Rev. 52, 3457–3467 (1995)Google Scholar
  21. 21.
    Sasanian, Z., Miller, D.Michael: Transforming MCT circuits to NCVW circuits. In: De Vos, A., Wille, R. (eds.) RC 2011. LNCS, vol. 7165, pp. 77–88. Springer, Heidelberg (2012).  https://doi.org/10.1007/978-3-642-29517-1_7CrossRefGoogle Scholar
  22. 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. 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. 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

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  • Anirban Bhattacharjee
    • 1
  • Chandan Bandyopadhyay
    • 1
    Email author
  • Laxmidhar Biswal
    • 1
  • Hafizur Rahaman
    • 1
  1. 1.Indian Institute of Engineering Science and Technology, ShibpurHowrahIndia

Personalised recommendations