Abstract
In order to achieve speedup over conventional classical computing for finding solution of computationally hard problems, quantum computing was introduced. Quantum algorithms can be simulated in a pseudo quantum environment, but implementation involves realization of quantum circuits through physical synthesis of quantum gates. This requires decomposition of complex quantum gates into a cascade of simple one-qubit and two-qubit gates. The methodological framework for physical synthesis imposes a constraint regarding placement of operands (qubits) and operators. If physical qubits can be placed on a grid, where each node of the grid represents a qubit, then quantum gates can only be operated on adjacent qubits, otherwise SWAP gates must be inserted to convert nonlinear nearest neighbour architecture to linear nearest neighbour architecture. Insertion of SWAP gates should be made optimal to reduce cumulative cost of physical implementation. A schedule layout generation is required for placement and routing a priori to actual implementation. In this paper, two algorithms are proposed to optimize the number of SWAP gates in any arbitrary quantum circuit. The first algorithm is intended to start with generation of an interaction graph followed by finding the longest path starting from the node with maximum degree. The second algorithm optimizes the number of SWAP gates between any pair of non-neighbouring qubits. Our proposed approach has a significant reduction in number of SWAP gates in 1D and 2D NTC architecture.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Meier, F., Levy, J., Loss, D.: Quantum computing with spin cluster qubits. Phys. Rev. Lett. 90 (2003)
Hollenberg, L.C.L., Greentree, A.D., Fowler, A.G., Wellard, C.J.: Spin transport and quasi 2D architectures for donor-based quantum computing, Centre for Quantum Computer Technology School of Physics, University of Melbourne, VIC 3010, Australia
Maslov, D., Falconer, S.M., Mosca, M.: Quantum Circuit Placement. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 27(4), 752–763 (2008)
Whitney, M., Isailovic, N., Patel, Y., Kubiatowicz, J.: Automated generation of layout and control for quantum circuits. In: Proceedings of the 4th International Conference on Computing Frontiers, pp. 83–94 (2007)
Lin, C.-C., Sur-Kolay, S., Jha, N.K.: PAQCS: physical design-aware fault-tolerant quantum circuit synthesis. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 23(7) (2015)
Paler, A., Devitt, S.J., Nemoto, K., Polian, I.: Synthesis of topological quantum circuits. In: IEEE/ACM International Symposium on Nanoscale Architectures (NANOARCH), pp. 181–187 (2013)
DiVincenzo, D.P.: The Physical Implementation of Quantum Computation, IBM T.J. Watson Research Center, Yorktown Heights (2008)
Wille, R., Lye, A., Drechsler, R.: Optimal SWAP gate insertion for nearest neighbor quantum circuits. In: 2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC) (2014)
Lin, C.-C., Chakrabarti, A., Jha, N.K.: Optimized quantum gate library for various physical machine descriptions. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 21(11) (2013)
Maslov, D., Falconer, S.M., Mosca, M.: Quantum circuit placement: optimizing qubit-to-qubit interactions through mapping quantum circuits into a physical experiment. In: 44th ACM/IEEE Design Automation Conference (2007)
Hirata, Y., Nakanishi, M., Yamashita, S., Nakashima, Y.: An efficient method to convert arbitrary quantum circuits to ones on a linear nearest neighbor architecture. In: Proceedings of the 3rd International Conference on Quantum, Nano and Micro Technologies, pp. 26–33 (2009)
Saeedi, M., Wille, R., Drechsler, R.: Synthesis of quantum circuits for linear nearest neighbor architectures. Quantum Inform. Process. 10(3), 355–377 (2011)
Shafaei, A., Saeedi, M., Pedram, M.: Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures. In: Proceedings of the 50th Annual Design Automation Conference, pp. 41:1–41:6 (2013)
Mohammadzadeh, N., Sedighi, M., Zamani, M.S.: Quantum physical synthesis: improving physical design by netlist modifications. Micro- electron. J. 41(4), 219–230 (2010)
Mohammadzadeh, N., Zamani, M.S., Sedighi, M.: Quantum circuit physical design methodology with emphasis on physical synthesis. Quantum Inform. Process. 13(2), 445–65 (2014)
Goudarzi, H., Dousti, M., Shafaei, A., Pedram, M.: Design of a universal logic block for fault-tolerant realization of any logic operation in trapped-ion quantum circuits. Quantum Inform. Process. 13(5), 1267–1299 (2014)
Choi, B.-S., Meter, R.V.: A \(\theta (\sqrt{n})\)-depth quantum adder on a 2D NTC quantum computer architecture. ACM J. Emerg. Technol. Comput. Syst. 8(3), 24:–24:22 (2012)
Saeedi, M., Shafaei, A., Pedram, M.: Constant-factor optimization of quantum adders on 2D quantum architectures. In: Proceedings of the 5th International Conference on Reversible Computation, pp. 5–69 (2013)
Pham, P., Svore, K.M.: A 2D nearest-neighbor quantum architecture for factoring in polylogarithmic depth. Quantum Inform. Comput. 13, 11–12 (2013)
Shafaei, A., Saeedi, M., Pedram, M.: Qubit placement to minimize communication overhead in 2D quantum architectures. In: Proceedings of the 19th Asia South Pacific Design Automation Conference, pp. 495–500 (2014)
Wille, R., Saeedi, M., Drechsler, R.: Synthesis of reversible functions beyond gate count and quantum cost. In: International Workshop on Logic Synthesis (IWLS) (2009)
Chakrabarti, A., Sur-Kolay, S., Chaudhury, A.: Linear nearest neighbor synthesis of reversible circuits by graph partitioning, CoRR, abs/1112.0564 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Ghosh, M., Dey, N., Mitra, D., Chakrabarti, A. (2020). 2D Qubit Placement of Quantum Circuits Using LONGPATH. In: Chaki, R., Cortesi, A., Saeed, K., Chaki, N. (eds) Advanced Computing and Systems for Security. Advances in Intelligent Systems and Computing, vol 996. Springer, Singapore. https://doi.org/10.1007/978-981-13-8969-6_8
Download citation
DOI: https://doi.org/10.1007/978-981-13-8969-6_8
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-8968-9
Online ISBN: 978-981-13-8969-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)