{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T10:25:27Z","timestamp":1771064727404,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T00:00:00Z","timestamp":1703116800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T00:00:00Z","timestamp":1703116800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62372182"],"award-info":[{"award-number":["62372182"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62372183"],"award-info":[{"award-number":["62372183"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-023-04192-x","type":"journal-article","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T08:02:21Z","timestamp":1703145741000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["QuanPath: achieving one-step communication for distributed quantum circuit simulation"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4310-2766","authenticated-orcid":false,"given":"Yuhong","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5605-5631","authenticated-orcid":false,"given":"Edwin Hsing-Mean","family":"Sha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1107-3470","authenticated-orcid":false,"given":"Qingfeng","family":"Zhuge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenlong","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qijun","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longshan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,21]]},"reference":[{"issue":"2","key":"4192_CR1","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":"4192_CR2","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, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"issue":"9","key":"4192_CR3","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1038\/s42254-021-00348-9","volume":"3","author":"M Cerezo","year":"2021","unstructured":"Cerezo, M., Arrasmith, A., Babbush, R., Benjamin, S.C., Endo, S., Fujii, K., McClean, J.R., Mitarai, K., Yuan, X., Cincio, L.: Variational quantum algorithms. Nat. Rev. Phys. 3(9), 625\u2013644 (2021)","journal-title":"Nat. Rev. Phys."},{"key":"4192_CR4","first-page":"18612","volume":"35","author":"K Zhang","year":"2022","unstructured":"Zhang, K., Liu, L., Hsieh, M.-H., Tao, D.: Escaping from the barren plateau via gaussian initializations in deep variational quantum circuits. Adv. Neural. Inf. Process. Syst. 35, 18612\u201318627 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"4192_CR5","doi-asserted-by":"crossref","unstructured":"Hu, Z., Lin, Y., Guan, Q., Jiang, W.: Battle against fluctuating quantum noise: Compression-aided framework to enable robust quantum neural network. arXiv preprint arXiv:2304.04666 (2023)","DOI":"10.1109\/DAC56929.2023.10247922"},{"key":"4192_CR6","doi-asserted-by":"crossref","unstructured":"Wang, H., Ding, Y., Gu, J., Lin, Y., Pan, D.Z., Chong, F.T., Han, S.: Quantumnas: Noise-adaptive search for robust quantum circuits. In: 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA), pp. 692\u2013708 (2022). IEEE","DOI":"10.1109\/HPCA53966.2022.00057"},{"key":"4192_CR7","unstructured":"List of QC simulators. https:\/\/www.quantiki.org\/wiki\/list-qc-simulators (2023)"},{"key":"4192_CR8","doi-asserted-by":"crossref","unstructured":"Burgholzer, L., Ploier, A., Wille, R.: Exploiting arbitrary paths for the simulation of quantum circuits with decision diagrams. In: 2022 Design, Automation & Test in Europe Conference & Exhibition (DATE), pp. 64\u201367 (2022). IEEE","DOI":"10.23919\/DATE54114.2022.9774631"},{"key":"4192_CR9","unstructured":"Boixo, S., Isakov, S.V., Smelyanskiy, V.N., Neven, H.: Simulation of low-depth quantum circuits as complex undirected graphical models. arXiv preprint arXiv:1712.05384 (2017)"},{"key":"4192_CR10","doi-asserted-by":"crossref","unstructured":"Wu, X.-C., Di, S., Dasgupta, E.M., Cappello, F., Finkel, H., Alexeev, Y., Chong, F.T.: Full-state quantum circuit simulation by using data compression. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1\u201324 (2019)","DOI":"10.1145\/3295500.3356155"},{"key":"4192_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.22331\/q-2018-01-31-49","volume":"2","author":"DS Steiger","year":"2018","unstructured":"Steiger, D.S., H\u00e4ner, T., Troyer, M.: ProjectQ: an open source software framework for quantum computing. Quantum 2, 49 (2018)","journal-title":"Quantum"},{"key":"4192_CR12","unstructured":"Smelyanskiy, M., Sawaya, N.P., Aspuru-Guzik, A.: qHiPSTER: the quantum high performance software testing environment. arXiv preprint arXiv:1601.07195 (2016)"},{"issue":"2","key":"4192_CR13","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.cpc.2006.08.007","volume":"176","author":"K De Raedt","year":"2007","unstructured":"De Raedt, K., Michielsen, K., De Raedt, H., Trieu, B., Arnold, G., Richter, M., Lippert, T., Watanabe, H., Ito, N.: Massively parallel quantum computer simulator. Comput. Phys. Commun. 176(2), 121\u2013136 (2007)","journal-title":"Comput. Phys. Commun."},{"key":"4192_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.cpc.2018.11.005","volume":"237","author":"H De Raedt","year":"2019","unstructured":"De Raedt, H., Jin, F., Willsch, D., Willsch, M., Yoshioka, N., Ito, N., Yuan, S., Michielsen, K.: Massively parallel quantum computer simulator, eleven years later. Comput. Phys. Commun. 237, 47\u201361 (2019)","journal-title":"Comput. Phys. Commun."},{"key":"4192_CR15","doi-asserted-by":"crossref","unstructured":"H\u00e4ner, T., Steiger, D.S.: 0.5 petabyte simulation of a 45-qubit quantum circuit. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1\u201310 (2017)","DOI":"10.1145\/3126908.3126947"},{"key":"4192_CR16","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"issue":"1","key":"4192_CR17","doi-asserted-by":"publisher","first-page":"10736","DOI":"10.1038\/s41598-019-47174-9","volume":"9","author":"T Jones","year":"2019","unstructured":"Jones, T., Brown, A., Bush, I., Benjamin, S.C.: Quest and high performance simulation of quantum computers. Sci. Rep. 9(1), 10736 (2019)","journal-title":"Sci. Rep."},{"key":"4192_CR18","unstructured":"Pednault, E., Gunnels, J.A., Nannicini, G., Horesh, L., Magerlein, T., Solomonik, E., Wisnieff, R.: Breaking the 49-qubit barrier in the simulation of quantum circuits. arXiv preprint arXiv:1710.0586715 (2017)"},{"issue":"12","key":"4192_CR19","doi-asserted-by":"publisher","first-page":"0206704","DOI":"10.1371\/journal.pone.0206704","volume":"13","author":"A McCaskey","year":"2018","unstructured":"McCaskey, A., Dumitrescu, E., Chen, M., Lyakh, D., Humble, T.: Validating quantum-classical programming models with tensor network simulations. PLoS ONE 13(12), 0206704 (2018)","journal-title":"PLoS ONE"},{"issue":"5","key":"4192_CR20","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s11128-023-03955-w","volume":"22","author":"A Ahmadzadeh","year":"2023","unstructured":"Ahmadzadeh, A., Sarbazi-Azad, H.: Fast and scalable quantum computing simulation on multi-core and many-core platforms. Quantum Inf. Process. 22(5), 215 (2023)","journal-title":"Quantum Inf. Process."},{"key":"4192_CR21","doi-asserted-by":"crossref","unstructured":"Fatima, A., Markov, I.L.: Faster schr\u00f6dinger-style simulation of quantum circuits. In: 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA), pp. 194\u2013207 (2021). IEEE","DOI":"10.1109\/HPCA51647.2021.00026"},{"key":"4192_CR22","doi-asserted-by":"crossref","unstructured":"Huang, Y., Martonosi, M.: Statistical assertions for validating patterns and finding bugs in quantum programs. In: Proceedings of the 46th International Symposium on Computer Architecture (ISCA), pp. 541\u2013553 (2019)","DOI":"10.1145\/3307650.3322213"},{"issue":"4","key":"4192_CR23","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1109\/TPDS.2019.2947511","volume":"31","author":"R Li","year":"2020","unstructured":"Li, R., Wu, B., Ying, M., Sun, X., Yang, G.: Quantum supremacy circuit simulation on sunway taihulight. IEEE Trans. Parallel Distrib. Syst. 31(4), 805\u2013816 (2020)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"4192_CR24","unstructured":"Chen, J., Zhang, F., Huang, C., Newman, M., Shi, Y.: Classical simulation of intermediate-size quantum circuits. arXiv preprint arXiv:1805.01450 (2018)"},{"issue":"6","key":"4192_CR25","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1038\/s41567-018-0124-x","volume":"14","author":"S Boixo","year":"2018","unstructured":"Boixo, S., Isakov, S.V., Smelyanskiy, V.N., Babbush, R., Ding, N., Jiang, Z., Bremner, M.J., Martinis, J.M., Neven, H.: Characterizing quantum supremacy in near-term devices. Nat. Phys. 14(6), 595\u2013600 (2018)","journal-title":"Nat. Phys."},{"issue":"4","key":"4192_CR26","volume":"10","author":"Y Zhou","year":"2020","unstructured":"Zhou, Y., Stoudenmire, E.M., Waintal, X.: What limits the simulation of quantum computers? Phys. Rev. X 10(4), 041038 (2020)","journal-title":"Phys. Rev. X"},{"issue":"1","key":"4192_CR27","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.3.010313","volume":"3","author":"Z Holmes","year":"2022","unstructured":"Holmes, Z., Sharma, K., Cerezo, M., Coles, P.J.: Connecting ansatz expressibility to gradient magnitudes and barren plateaus. PRX Quantum 3(1), 010313 (2022)","journal-title":"PRX Quantum"},{"issue":"12","key":"4192_CR28","doi-asserted-by":"publisher","first-page":"1900070","DOI":"10.1002\/qute.201900070","volume":"2","author":"S Sim","year":"2019","unstructured":"Sim, S., Johnson, P.D., Aspuru-Guzik, A.: Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms. Adv. Quantum Technol. 2(12), 1900070 (2019)","journal-title":"Adv. Quantum Technol."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-04192-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-023-04192-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-04192-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T17:14:08Z","timestamp":1706721248000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-023-04192-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,21]]},"references-count":28,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,1]]}},"alternative-id":["4192"],"URL":"https:\/\/doi.org\/10.1007\/s11128-023-04192-x","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,21]]},"assertion":[{"value":"4 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have declared that they do not have any conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"1"}}