Minimizing the Number of Teleportations in Distributed Quantum Computing Using Alloy (2404.15980v1)
Abstract: This paper presents a novel approach for minimizing the number of teleportations in Distributed Quantum Computing (DQC) using formal methods. Quantum teleportation plays a major role in communicating quantum information. As such, it is desirable to perform as few teleportations as possible when distributing a quantum algorithm on a network of quantum machines. Contrary to most existing methods which rely on graph-theoretic or heuristic search techniques, we propose a drastically different approach for minimizing the number of teleportations through utilizing formal methods. Specifically, the contributions of this paper include: the formal specification of the teleportation minimization problem in Alloy, the generalizability of the proposed Alloy specifications to quantum circuits with $n$-ary gates, the reusability of the Alloy specifications for different quantum circuits and networks, the simplicity of specifying and solving other problems such as load balancing and heterogeneity, and the compositionality of the proposed approach. We also develop a software tool, called qcAlloy, that takes as input the textual description of a quantum circuit, generates the corresponding Alloy model, and finally solves the minimization problem using the Alloy analyzer. We have experimentally evaluated qcAlloy for some of the circuits in the RevLib benchmark with more than 100 qubits and 1200 layers, and have demonstrated that qcAlloy outperforms one of the most efficient existing methods for most benchmark circuits in terms of minimizing the number of teleportations.
- P. Andres-Martinez and C. Heunen, “Automated distribution of quantum circuits via hypergraph partitioning,” Physical Review A, vol. 100, no. 3, p. 032308, 2019.
- Z. Davarzani, M. Zomorodi-Moghadam, M. Houshmand, and M. Nouri-Baygi, “A dynamic programming approach for distributing quantum circuits by bipartite graphs,” Quantum Information Processing, vol. 19, pp. 1–18, 2020.
- O. Daei, K. Navi, and M. Zomorodi-Moghadam, “Optimized quantum circuit partitioning,” International Journal of Theoretical Physics, vol. 59, no. 12, pp. 3804–3820, 2020.
- B. W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” The Bell system technical journal, vol. 49, no. 2, pp. 291–307, 1970.
- E. Nikahd, N. Mohammadzadeh, M. Sedighi, and M. S. Zamani, “Automated window-based partitioning of quantum circuits,” Physica Scripta, vol. 96, no. 3, p. 035102, 2021.
- A. Y. Kitaev, “Quantum computations: algorithms and error correction,” Russian Mathematical Surveys, vol. 52, no. 6, p. 1191, 1997.
- C. M. Dawson and M. A. Nielsen, “The solovay-kitaev algorithm,” Quantum Information & Computation, vol. 6, no. 1, pp. 81–95, 2006.
- D. Maslov, G. W. Dueck, and N. Scott, “Reversible Logic Synthesis Benchmarks Page,” 2005, http://webhome.cs.uvic.ca/ dmaslov.
- R. Wille, D. Große, L. Teuber, G. W. Dueck, and R. Drechsler, “Revlib: An online resource for reversible functions and reversible circuits,” in 38th International Symposium on Multiple Valued Logic (ismvl 2008). IEEE, 2008, pp. 220–225.
- M. A. Nielsen and I. L. Chuang, “Quantum computation and quantum information,” Phys. Today, vol. 54, no. 2, p. 60, 2001.
- W. K. Wootters and W. H. Zurek, “A single quantum cannot be cloned,” Nature, vol. 299, no. 5886, pp. 802–803, 1982.
- C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. K. Wootters, “Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels,” Physical review letters, vol. 70, no. 13, p. 1895, 1993.
- R. G. Sundaram and H. Gupta, “Distributing quantum circuits using teleportations,” in 2023 IEEE International Conference on Quantum Software (QSW). IEEE, 2023, pp. 186–192.
- M. Zomorodi-Moghadam, M. Houshmand, and M. Houshmand, “Optimizing teleportation cost in distributed quantum circuits,” International Journal of Theoretical Physics, vol. 57, pp. 848–861, 2018.
- A. Wu, H. Zhang, G. Li, A. Shabani, Y. Xie, and Y. Ding, “Autocomm: A framework for enabling efficient communication in distributed quantum programs,” in 2022 55th IEEE/ACM International Symposium on Microarchitecture (MICRO). IEEE, 2022, pp. 1027–1041.
- A. Wu, Y. Ding, and A. Li, “Qucomm: Optimizing collective communication for distributed quantum computing,” in Proceedings of the 56th Annual IEEE/ACM International Symposium on Microarchitecture, 2023, pp. 479–493.
- D. Ferrari, A. S. Cacciapuoti, M. Amoretti, and M. Caleffi, “Compiler design for distributed quantum computing,” IEEE Transactions on Quantum Engineering, vol. 2, pp. 1–20, 2021.