{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T20:11:56Z","timestamp":1780344716341,"version":"3.54.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,7,10]],"date-time":"2021-07-10T00:00:00Z","timestamp":1625875200000},"content-version":"vor","delay-in-days":9,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2021,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>As quantum computation grows, the number of qubits involved in a given quantum computer increases. But due to the physical limitations in the number of qubits of a single quantum device, the computation should be performed in a distributed system. In this paper, a new model of quantum computation based on the matrix representation of quantum circuits is proposed. Then, using this model, we propose a novel approach for reducing the number of teleportations in a distributed quantum circuit. The proposed method consists of two phases: the pre-processing phase and the optimization phase. In the pre-processing phase, it considers the bi-partitioning of quantum circuits by Non-Dominated Sorting Genetic Algorithm <jats:italic>(NSGA-III)<\/jats:italic> to minimize the number of global gates and to distribute the quantum circuit into two balanced parts with equal number of qubits and minimum number of global gates. In the optimization phase, two heuristics named <jats:italic>Heuristic I<\/jats:italic> and <jats:italic>Heuristic II<\/jats:italic> are proposed to optimize the number of teleportations according to the partitioning obtained from the pre-processing phase. Finally, the proposed approach is evaluated on many benchmark quantum circuits. The results of these evaluations show an average of 22.16% improvement in the teleportation cost of the proposed approach compared to the existing works in the literature.<\/jats:p>","DOI":"10.1007\/s11128-021-03170-5","type":"journal-article","created":{"date-parts":[[2021,7,10]],"date-time":"2021-07-10T05:02:30Z","timestamp":1625893350000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization"],"prefix":"10.1007","volume":"20","author":[{"given":"Ismail","family":"Ghodsollahee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zohreh","family":"Davarzani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1308-3453","authenticated-orcid":false,"given":"Mariam","family":"Zomorodi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pawe\u0142","family":"P\u0142awiak","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Monireh","family":"Houshmand","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mahboobeh","family":"Houshmand","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,7,10]]},"reference":[{"key":"3170_CR1","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (1996)","DOI":"10.1145\/237814.237866"},{"key":"3170_CR2","unstructured":"Grover, L.K.: Quantum Telecomputation (1997). arXiv preprint quant-ph\/9704012"},{"issue":"2","key":"3170_CR3","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303\u2013332 (1999)","journal-title":"SIAM Rev."},{"key":"3170_CR4","doi-asserted-by":"crossref","unstructured":"Huang, H.-L., et al.: Experimental blind quantum computing for a classical client. 119(5), 050503 (2017)","DOI":"10.1103\/PhysRevLett.119.050503"},{"key":"3170_CR5","doi-asserted-by":"crossref","unstructured":"Krantz, P., et al.: A quantum engineer's guide to superconducting qubits. 6(2), 021318 (2019)","DOI":"10.1063\/1.5089550"},{"key":"3170_CR6","doi-asserted-by":"crossref","unstructured":"Cacciapuoti, A.S., et al.: When entanglement meets classical communications: Quantum teleportation for the quantum Internet. IEEE Trans. Commun. (2020).","DOI":"10.1109\/TCOMM.2020.2978071"},{"key":"3170_CR7","doi-asserted-by":"crossref","unstructured":"Cacciapuoti, A.S., Caleffi, M.: Toward the quantum Internet: A directional-dependent noise model for quantum signal processing. In: ICASSP 2019\u20132019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE (2019)","DOI":"10.1109\/ICASSP.2019.8683195"},{"key":"3170_CR8","doi-asserted-by":"crossref","unstructured":"Blatt, R., Roos, C.F.J.N.P.: Quantum simulations with trapped ions. 8(4), 277\u2013284 (2012)","DOI":"10.1038\/nphys2252"},{"key":"3170_CR9","doi-asserted-by":"crossref","unstructured":"Bruzewicz, C.D., et al.: Trapped-ion quantum computing: progress and challenges. 6(2), 021314 (2019)","DOI":"10.1063\/1.5088164"},{"issue":"3","key":"3170_CR10","doi-asserted-by":"publisher","first-page":"032308","DOI":"10.1103\/PhysRevA.100.032308","volume":"100","author":"P Andr\u00e9s-Mart\u00ednez","year":"2019","unstructured":"Andr\u00e9s-Mart\u00ednez, P., Heunen, C.: Automated distribution of quantum circuits via hypergraph partitioning. Phys. Rev. A 100(3), 032308 (2019)","journal-title":"Phys. Rev. A"},{"issue":"1","key":"3170_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1126257.1126259","volume":"2","author":"Meter, R.v. and M. Oskin,","year":"2006","unstructured":"Meter, R.v. and M. Oskin, : Architectural implications of quantum computing technologies. ACM J. Emerg. Technol. Comput. Syst. (JETC) 2(1), 31\u201363 (2006)","journal-title":"ACM J. Emerg. Technol. Comput. Syst. (JETC)"},{"key":"3170_CR12","doi-asserted-by":"crossref","unstructured":"Kjaergaard, M., et al.: Superconducting qubits: current state of play. 11, 369\u2013395 (2020)","DOI":"10.1146\/annurev-conmatphys-031119-050605"},{"key":"3170_CR13","doi-asserted-by":"crossref","unstructured":"Huang, H.-L., et al.: Superconducting quantum computing: a review. 63(8), 1\u201332 (2020)","DOI":"10.1007\/s11432-020-2881-9"},{"key":"3170_CR14","doi-asserted-by":"crossref","unstructured":"Slussarenko, S., Pryde, G.J.J.A.P.R.: Photonic quantum information processing: a concise review. 6(4), 041303 (2019)","DOI":"10.1063\/1.5115814"},{"issue":"6","key":"3170_CR15","doi-asserted-by":"publisher","first-page":"1330","DOI":"10.1103\/PhysRevLett.85.1330","volume":"85","author":"G Brassard","year":"2000","unstructured":"Brassard, G., et al.: Limitations on practical quantum cryptography. Phys. Rev. Lett. 85(6), 1330 (2000)","journal-title":"Phys. Rev. Lett."},{"issue":"13","key":"3170_CR16","doi-asserted-by":"publisher","first-page":"1895","DOI":"10.1103\/PhysRevLett.70.1895","volume":"70","author":"CH Bennett","year":"1993","unstructured":"Bennett, C.H., et al.: Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Phys. Rev. Lett. 70(13), 1895 (1993)","journal-title":"Phys. Rev. Lett."},{"issue":"4","key":"3170_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1324177.1324179","volume":"3","author":"RV Meter","year":"2008","unstructured":"Meter, R.V., et al.: Arithmetic on a distributed-memory quantum multicomputer. ACM J. Emerg. Technol. Comput. Syst. (JETC) 3(4), 1\u201323 (2008)","journal-title":"ACM J. Emerg. Technol. Comput. Syst. (JETC)"},{"issue":"5886","key":"3170_CR18","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1038\/299802a0","volume":"299","author":"WK Wootters","year":"1982","unstructured":"Wootters, W.K., Zurek, W.H.: A single quantum cannot be cloned. Nature 299(5886), 802\u2013803 (1982)","journal-title":"Nature"},{"issue":"2","key":"3170_CR19","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1103\/PhysRevA.56.1201","volume":"56","author":"R Cleve","year":"1997","unstructured":"Cleve, R., Buhrman, H.: Substituting quantum entanglement for communication. Phys. Rev. A 56(2), 1201 (1997)","journal-title":"Phys. Rev. A"},{"issue":"6","key":"3170_CR20","doi-asserted-by":"publisher","first-page":"4249","DOI":"10.1103\/PhysRevA.59.4249","volume":"59","author":"J Cirac","year":"1999","unstructured":"Cirac, J., et al.: Distributed quantum computation over noisy channels. Phys. Rev. A 59(6), 4249 (1999)","journal-title":"Phys. Rev. A"},{"key":"3170_CR21","doi-asserted-by":"crossref","unstructured":"Reichardt, B.W., Unger, F., Vazirani, U.J.N.: Classical command of quantum systems. 496(7446), 456\u2013460 (2013)","DOI":"10.1038\/nature12035"},{"key":"3170_CR22","doi-asserted-by":"crossref","unstructured":"Sheng, Y.-B., Zhou, L.J.S.B.: Distributed secure quantum machine learning. 62(14), 1025\u20131029 (2017)","DOI":"10.1016\/j.scib.2017.06.007"},{"issue":"09","key":"3170_CR23","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1142\/S0129183101002668","volume":"12","author":"J Yepez","year":"2001","unstructured":"Yepez, J.: Type-II quantum computers. Int. J. Mod. Phys. C 12(09), 1273\u20131284 (2001)","journal-title":"Int. J. Mod. Phys. C"},{"issue":"2153","key":"3170_CR24","first-page":"20120686","volume":"469","author":"R Beals","year":"2013","unstructured":"Beals, R., et al.: Efficient distributed quantum computing. Proc. Roy. Soc. A Math. Phys. Eng. Sci. 469(2153), 20120686 (2013)","journal-title":"Proc. Roy. Soc. A Math. Phys. Eng. Sci."},{"key":"3170_CR25","doi-asserted-by":"crossref","unstructured":"Cuomo, D., Caleffi, M., Cacciapuoti, A.S.: Towards a Distributed Quantum Computing Ecosystem. (2020). arXiv preprint arXiv:2002.11808","DOI":"10.1049\/iet-qtc.2020.0002"},{"key":"3170_CR26","doi-asserted-by":"crossref","unstructured":"Caleffi, M., Cacciapuoti, A.S., Bianchi, G.: Quantum internet: from communication to distributed computing! In: Proceedings of the 5th ACM International Conference on Nanoscale Computing and Communication (2018)","DOI":"10.1145\/3233188.3233224"},{"issue":"1","key":"3170_CR27","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1109\/MNET.001.1900092","volume":"34","author":"AS Cacciapuoti","year":"2019","unstructured":"Cacciapuoti, A.S., et al.: Quantum internet: networking challenges in distributed quantum computing. IEEE Netw. 34(1), 137\u2013143 (2019)","journal-title":"IEEE Netw."},{"issue":"26","key":"3170_CR28","doi-asserted-by":"publisher","first-page":"5932","DOI":"10.1103\/PhysRevLett.81.5932","volume":"81","author":"H-J Briegel","year":"1998","unstructured":"Briegel, H.-J., et al.: Quantum repeaters: the role of imperfect local operations in quantum communication. Phys. Rev. Lett. 81(26), 5932 (1998)","journal-title":"Phys. Rev. Lett."},{"issue":"3","key":"3170_CR29","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1007\/s10773-017-3618-x","volume":"57","author":"M Zomorodi-Moghadam","year":"2018","unstructured":"Zomorodi-Moghadam, M., Houshmand, M., Houshmand, M.: Optimizing teleportation cost in distributed quantum circuits. Int. J. Theor. Phys. 57(3), 848\u2013861 (2018)","journal-title":"Int. J. Theor. Phys."},{"issue":"4","key":"3170_CR30","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1007\/s10773-020-04409-0","volume":"59","author":"M Houshmand","year":"2020","unstructured":"Houshmand, M., Zahra, M., Zomorodi-Moghadam, M., Houshmand, M.: An evolutionary approach to optimizing teleportation cost in distributed quantum computation. Int. J. Theor. Phys. 59(4), 1315-1329 (2020)","journal-title":"Int. J. Theor. Phys."},{"issue":"10","key":"3170_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-020-02871-7","volume":"19","author":"Z Davarzani","year":"2020","unstructured":"Davarzani, Z., Zomorodi-Moghadam, M., Houshmand, M., Nouri-baygi, M.: A dynamic programming approach for distributing quantum circuits by bipartite graphs. Quantum Inf. Process. 19(10), 1-18 (2020)","journal-title":"Quantum Inf. Process."},{"issue":"12","key":"3170_CR32","doi-asserted-by":"publisher","first-page":"3804","DOI":"10.1007\/s10773-020-04633-8","volume":"59","author":"O Daei","year":"2020","unstructured":"Daei, O., Navi, K., Zomorodi-Moghadam, M.: Optimized quantum circuit partitioning. Int. J. Theor. Phys. 59(12), 3804-3820 (2020)","journal-title":"Int. J. Theor. Phys."},{"key":"3170_CR33","doi-asserted-by":"crossref","unstructured":"Nikahd, E., et al.: Automated window-based partitioning of quantum circuits. 96(3), 035102 (2021).","DOI":"10.1088\/1402-4896\/abd57c"},{"key":"3170_CR34","doi-asserted-by":"crossref","unstructured":"Marinescu, D.C.: Classical and Quantum Information. Academic Press (2011)","DOI":"10.1016\/B978-0-12-383874-2.00003-5"},{"key":"3170_CR35","doi-asserted-by":"crossref","unstructured":"Barenco, A.: Elemntary gates for quntom computation. Phys. Rev. A Gen. Phys. 52(5), 3457\u20133467 (1995).","DOI":"10.1103\/PhysRevA.52.3457"},{"issue":"6","key":"3170_CR36","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/s00224-006-1350-7","volume":"39","author":"K Andreev","year":"2006","unstructured":"Andreev, K., Racke, H.: Balanced graph partitioning. Theory Comput. Syst. 39(6), 929\u2013939 (2006)","journal-title":"Theory Comput. Syst."},{"key":"3170_CR37","unstructured":"Miettinen, K.: Nonlinear multiobjective optimization, vol. 12. Springer Science & Business Media (2012)"},{"key":"3170_CR38","doi-asserted-by":"crossref","unstructured":"Deb, K.: Multi-objective optimization. In: Search Methodologies, pp. 403\u2013449. Springer (2014)","DOI":"10.1007\/978-1-4614-6940-7_15"},{"key":"3170_CR39","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.swevo.2019.05.011","volume":"49","author":"Z Cui","year":"2019","unstructured":"Cui, Z., et al.: Improved NSGA-III with selection-and-elimination operator. Swarm Evol. Comput. 49, 23\u201333 (2019)","journal-title":"Swarm Evol. Comput."},{"key":"3170_CR40","doi-asserted-by":"crossref","unstructured":"Deb, K., et al.: A fast and elitist multiobjective genetic algorithm: NSGA-II. 6(2): 182\u2013197 (2002)","DOI":"10.1109\/4235.996017"},{"key":"3170_CR41","doi-asserted-by":"crossref","unstructured":"Alexander Green, P.L.L., Ross, N.J., Selinger, P., Va-liron, B.: An introduction to quantum proigramming in quipper. In: 5th International Conference on Reversible Computing, RC 2013. Springer. Victoria, British Colombia (2013).","DOI":"10.1007\/978-3-642-38986-3_10"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-021-03170-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-021-03170-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-021-03170-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,4]],"date-time":"2021-08-04T08:27:41Z","timestamp":1628065661000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-021-03170-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":41,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["3170"],"URL":"https:\/\/doi.org\/10.1007\/s11128-021-03170-5","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7]]},"assertion":[{"value":"24 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"235"}}