{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T21:03:25Z","timestamp":1771016605898,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T00:00:00Z","timestamp":1766966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T00:00:00Z","timestamp":1766966400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"publisher","award":["24LZ1400500"],"award-info":[{"award-number":["24LZ1400500"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372182"],"award-info":[{"award-number":["62372182"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372183"],"award-info":[{"award-number":["62372183"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-025-05028-6","type":"journal-article","created":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T14:32:56Z","timestamp":1767018776000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["QMin: Quantum Circuit Minimization via Gate Fusions for Efficient State Vector Simulation"],"prefix":"10.1007","volume":"25","author":[{"given":"Longshan","family":"Xu","sequence":"first","affiliation":[]},{"given":"Edwin Hsing-Mean","family":"Sha","sequence":"additional","affiliation":[]},{"given":"Yuhong","family":"Song","sequence":"additional","affiliation":[]},{"given":"Qingfeng","family":"Zhuge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,29]]},"reference":[{"issue":"2","key":"5028_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":"5028_CR2","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the ACM STOC, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"5028_CR3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.150502","volume":"103","author":"AW Harrow","year":"2009","unstructured":"Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103, 150502 (2009). https:\/\/doi.org\/10.1103\/PhysRevLett.103.150502","journal-title":"Phys. Rev. Lett."},{"issue":"6","key":"5028_CR4","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."},{"key":"5028_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-023-04160-5","author":"Y Song","year":"2023","unstructured":"Song, Y., Sha, E.H.-M., Zhuge, Q., Xu, R., Wang, H.: Efficient algorithm for full-state quantum circuit simulation with DD compression while maintaining accuracy. Quant. Inf. Proc. (2023). https:\/\/doi.org\/10.1007\/s11128-023-04160-5","journal-title":"Quant. Inf. Proc."},{"key":"5028_CR6","doi-asserted-by":"crossref","unstructured":"Tencent Quantum Laboratory: TensorCircuit: a Quantum Software Framework for the NISQ Era. Quantum 7, 912 (2023)","DOI":"10.22331\/q-2023-02-02-912"},{"key":"5028_CR7","unstructured":"Origin Quantum Computing Technology (Hefei)\u00a0Co., L.: OriginQC - Building China\u2019s Independent and Controllable Quantum Computers. https:\/\/originqc.com.cn\/index.html. Official website of OriginQC, covering quantum computing hardware, software, industry solutions, and related information (Accessed: July 27, 2025)"},{"key":"5028_CR8","unstructured":"Group, C.T.Q.: Tianyan Quantum Computing Cloud Platform. https:\/\/qc.zdxlz.com\/home. Official platform for Tianyan quantum computing cloud services, providing quantum computing-related resources and solutions (Accessed 27 July 2025)"},{"key":"5028_CR9","unstructured":"Quantum, I.: Qiskit - IBM Quantum. https:\/\/www.ibm.com\/quantum\/qiskit. Official page for Qiskit, IBM\u2019s open-source quantum computing software development kit, including documentation, tutorials, and resources for quantum programming. Accessed 27 July 2025"},{"key":"5028_CR10","unstructured":"Smelyanskiy, M., Sawaya, N.P., Aspuru-Guzik, A.: qHiPSTER: the quantum high performance software testing environment. arXiv (2016)"},{"issue":"1","key":"5028_CR11","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":"5028_CR12","unstructured":"IBM Quantum: Quantum computing with Qiskit. arXiv (2024)"},{"key":"5028_CR13","unstructured":"Asadi, A., Dusko, A., Park, C.-Y., Michaud-Rioux, V., Schoch, I., Shu, S., Vincent, T., O\u2019Riordan, L.J.: Hybrid quantum programming with PennyLane Lightning on HPC platforms (2024). arxiv.org\/abs\/2403.02512"},{"key":"5028_CR14","doi-asserted-by":"publisher","unstructured":"Developers, C.: Cirq. Zenodo (2025). https:\/\/doi.org\/10.5281\/ZENODO.4062499","DOI":"10.5281\/ZENODO.4062499"},{"key":"5028_CR15","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":"5028_CR16","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: ACM SC, pp. 1\u201324 (2019)","DOI":"10.1145\/3295500.3356155"},{"issue":"1","key":"5028_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-023-04192-x","volume":"23","author":"Y Song","year":"2023","unstructured":"Song, Y., Sha, E.H.-M., Zhuge, Q., Xiao, W., Dai, Q., Xu, L.: QuanPath: achieving one-step communication for distributed quantum circuit simulation. Quantum Inf. Process. 23(1), 1 (2023). https:\/\/doi.org\/10.1007\/s11128-023-04192-x","journal-title":"Quantum Inf. Process."},{"key":"5028_CR18","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"},{"key":"5028_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, X., Xiang, H., Xiang, T.: An efficient quantum circuits optimizing scheme compared with QISKit. In: Collaborative Computing: Networking, Applications and Worksharing, pp. 467\u2013476 (2019)","DOI":"10.1007\/978-3-030-12981-1_32"},{"key":"5028_CR20","doi-asserted-by":"crossref","unstructured":"H\u00e4ner, T., Steiger, D.S.: 0.5 petabyte simulation of a 45-qubit quantum circuit. In: ACM SC, pp. 1\u201310 (2017)","DOI":"10.1145\/3126908.3126947"},{"key":"5028_CR21","unstructured":"Horii, H., Doi, J.: Optimization of quantum computing simulation with gate fusion. IPSJ SIG Technical Report (2021)"},{"issue":"2","key":"5028_CR22","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1063\/1.1359716","volume":"54","author":"MA Nielsen","year":"2001","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum computation and quantum information. Phys. Today 54(2), 60 (2001)","journal-title":"Phys. Today"},{"key":"5028_CR23","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1103\/PhysRevA.51.1015","volume":"51","author":"DP DiVincenzo","year":"1995","unstructured":"DiVincenzo, D.P.: Two-bit gates are universal for quantum computation. Phys. Rev. A 51, 1015\u20131022 (1995). https:\/\/doi.org\/10.1103\/PhysRevA.51.1015","journal-title":"Phys. Rev. A"},{"issue":"1","key":"5028_CR24","doi-asserted-by":"publisher","first-page":"36090","DOI":"10.1038\/srep36090","volume":"6","author":"D Dong","year":"2016","unstructured":"Dong, D., Wu, C., Chen, C., Qi, B., Petersen, I.R., Nori, F.: Learning robust pulses for generating universal quantum gates. Sci. Rep. 6(1), 36090 (2016). https:\/\/doi.org\/10.1038\/srep36090","journal-title":"Sci. Rep."},{"key":"5028_CR25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.70.052328","volume":"70","author":"S Aaronson","year":"2004","unstructured":"Aaronson, S., Gottesman, D.: Improved simulation of stabilizer circuits. Phys. Rev. A 70, 052328 (2004). https:\/\/doi.org\/10.1103\/PhysRevA.70.052328","journal-title":"Phys. Rev. A"},{"key":"5028_CR26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.116.250501","volume":"116","author":"S Bravyi","year":"2016","unstructured":"Bravyi, S., Gosset, D.: Improved classical simulation of quantum circuits dominated by Clifford gates. Phys. Rev. Lett. 116, 250501 (2016). https:\/\/doi.org\/10.1103\/PhysRevLett.116.250501","journal-title":"Phys. Rev. Lett."},{"key":"5028_CR27","unstructured":"Gottesman, D.: The Heisenberg Representation of Quantum Computers (1998). arxiv.org\/abs\/quant-ph\/9807006"},{"key":"5028_CR28","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.91.147902","volume":"91","author":"G Vidal","year":"2003","unstructured":"Vidal, G.: Efficient classical simulation of slightly entangled quantum computations. Phys. Rev. Lett. 91, 147902 (2003). https:\/\/doi.org\/10.1103\/PhysRevLett.91.147902","journal-title":"Phys. Rev. Lett."},{"issue":"5","key":"5028_CR29","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1109\/TCAD.2018.2834427","volume":"38","author":"A Zulehner","year":"2019","unstructured":"Zulehner, A., Wille, R.: Advanced simulation of quantum computations. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 38(5), 848\u2013859 (2019). https:\/\/doi.org\/10.1109\/TCAD.2018.2834427","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"5","key":"5028_CR30","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E Bernstein","year":"1997","unstructured":"Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM J. Comput. 26(5), 1411\u20131473 (1997)","journal-title":"SIAM J. Comput."},{"key":"5028_CR31","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:1710.0586715 (2017)"},{"issue":"3","key":"5028_CR32","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1137\/050644756","volume":"38","author":"IL Markov","year":"2008","unstructured":"Markov, I.L., Shi, Y.: Simulating quantum computation by contracting tensor networks. SIAM J. Comput. 38(3), 963\u2013981 (2008). https:\/\/doi.org\/10.1137\/050644756","journal-title":"SIAM J. Comput."},{"key":"5028_CR33","unstructured":"Boixo, S., Isakov, S.V., Smelyanskiy, V.N., Neven, H.: Simulation of low-depth quantum circuits as complex undirected graphical models. arXiv:1712.05384 (2017)"},{"key":"5028_CR34","doi-asserted-by":"publisher","unstructured":"Fu, R., Su, Z., Zhong, H.-S., Zhao, X., Zhang, J., Pan, F., Zhang, P., Zhao, X., Chen, M.-C., Lu, C.-Y., Pan, J.-W., Pei, Z., Zhang, X., Ouyang, W.: Surpassing sycamore: achieving energetic superiority through system-level circuit simulation. In: SC24: International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1\u201320 (2024). https:\/\/doi.org\/10.1109\/SC41406.2024.00085","DOI":"10.1109\/SC41406.2024.00085"},{"key":"5028_CR35","doi-asserted-by":"crossref","unstructured":"Fatima, A., Markov, I.L.: Faster Schr\u00f6dinger-style simulation of quantum circuits. In: 2021 IEEE Proceedings HPCA Seventh International Symposium on High-Performance Computer Architecture (HPCA), pp. 194\u2013207. IEEE (2021)","DOI":"10.1109\/HPCA51647.2021.00026"},{"key":"5028_CR36","doi-asserted-by":"publisher","unstructured":"Li, A., Subasi, O., Yang, X., Krishnamoorthy, S.: Density matrix quantum circuit simulation via the BSP machine on modern GPU clusters. In: SC20: International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1\u201315 (2020). https:\/\/doi.org\/10.1109\/SC41405.2020.00017","DOI":"10.1109\/SC41405.2020.00017"},{"key":"5028_CR37","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill, J.: Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018). https:\/\/doi.org\/10.22331\/q-2018-08-06-79","journal-title":"Quantum"},{"key":"5028_CR38","doi-asserted-by":"publisher","unstructured":"Lykov, D., Schutski, R., Galda, A., Vinokur, V., Alexeev, Y.: Tensor network quantum simulator with step-dependent parallelization. In: IEEE QCE, pp. 582\u2013593 (2022). https:\/\/doi.org\/10.1109\/QCE53715.2022.00081","DOI":"10.1109\/QCE53715.2022.00081"},{"key":"5028_CR39","doi-asserted-by":"publisher","DOI":"10.1002\/qute.201900070","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. (2019). https:\/\/doi.org\/10.1002\/qute.201900070","journal-title":"Adv. Quantum Technol."},{"key":"5028_CR40","unstructured":"Coppersmith, D.: An approximate Fourier transform useful in quantum factoring. arXiv (2002) arXiv:quant-ph\/0201067 [quant-ph]"},{"key":"5028_CR41","unstructured":"Draper, T.G.: Addition on a quantum computer. arXiv (2000) arXiv:quant-ph\/0008033 [quant-ph]"},{"key":"5028_CR42","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.117.080501","author":"MJ Bremner","year":"2016","unstructured":"Bremner, M.J., Montanaro, A., Shepherd, D.J.: Average-case complexity versus approximate simulation of commuting quantum computations. Phys. Rev. Lett. (2016). https:\/\/doi.org\/10.1103\/physrevlett.117.080501","journal-title":"Phys. Rev. Lett."},{"key":"5028_CR43","unstructured":"Kitaev, A.Y.: Quantum measurements and the Abelian stabilizer problem. arXiv (1995) arXiv:quant-ph\/9511026 [quant-ph]"},{"key":"5028_CR44","doi-asserted-by":"publisher","unstructured":"Tomesh, T., Gokhale, P., Omole, V., Ravi, G.S., Smith, K.N., Viszlai, J., Wu, X.-C., Hardavellas, N., Martonosi, M.R., Chong, F.T.: SupermarQ: a scalable quantum benchmark suite. In: 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA), pp. 587\u2013603. IEEE Computer Society, Los Alamitos, CA, USA (2022). https:\/\/doi.org\/10.1109\/HPCA53966.2022.00050 . https:\/\/doi.ieeecomputersociety.org\/10.1109\/HPCA53966.2022.00050","DOI":"10.1109\/HPCA53966.2022.00050"},{"key":"5028_CR45","unstructured":"Corporation, I.: Intel Quantum Simulator (Intel-QS). https:\/\/github.com\/intel\/intel-qs. GitHub repository for Intel Quantum Simulator (Intel-QS), an open-source library for quantum circuit simulation and quantum computing research. Accessed 27 July 2025"},{"key":"5028_CR46","doi-asserted-by":"publisher","unstructured":"team, Q.A.: collaborators: Qsim. https:\/\/doi.org\/10.5281\/zenodo.4023103","DOI":"10.5281\/zenodo.4023103"},{"key":"5028_CR47","unstructured":"Team, Q.D.: Qiskit Aer. https:\/\/github.com\/Qiskit\/qiskit-aer. GitHub repository for Qiskit Aer, a high-performance quantum circuit simulator library that supports various simulation methods (statevector, density matrix, etc.) and integrates with the Qiskit ecosystem. Accessed 28 July 2025"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-05028-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-025-05028-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-05028-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T20:02:40Z","timestamp":1771012960000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-025-05028-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,29]]},"references-count":47,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1]]}},"alternative-id":["5028"],"URL":"https:\/\/doi.org\/10.1007\/s11128-025-05028-6","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,29]]},"assertion":[{"value":"26 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2025","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":"Conflicts of Interest"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"6"}}