{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:32:28Z","timestamp":1760661148735,"version":"build-2065373602"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Anhui Provincial Key Research and Development Project","award":["2022b13020002"],"award-info":[{"award-number":["2022b13020002"]}]},{"name":"Major Program of the Education Department of Anhui Province","award":["2022AH040289"],"award-info":[{"award-number":["2022AH040289"]}]},{"name":"Anhui Provincial Candidates for Academic and Technical Leaders Foundation","award":["2019H208"],"award-info":[{"award-number":["2019H208"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-025-04895-3","type":"journal-article","created":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T09:30:34Z","timestamp":1755855034000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A practical applicable quantum\u2013classical hybrid ant colony algorithm for the NISQ era"],"prefix":"10.1007","volume":"24","author":[{"given":"Mohan","family":"Wu","sequence":"first","affiliation":[]},{"given":"Qian","family":"Qiu","sequence":"additional","affiliation":[]},{"given":"Liang","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yin","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Qichun","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Xiaogang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Da-Chuang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hua","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,22]]},"reference":[{"key":"4895_CR1","unstructured":"Dorigo, M., Colorni, A., Maniezzo, V.: Distributed optimization by ant colonies. In: Proceedings of ECAL91- European Conf. on Artificial Life, (1991)"},{"issue":"1","key":"4895_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1049\/qtc2.12023","volume":"3","author":"M Ghosh","year":"2022","unstructured":"Ghosh, M., Dey, N., Mitra, D., Chakrabarti, A.: A novel quantum algorithm for ant colony optimization. IET Quant. Commun. 3(1), 13\u201319 (2022)","journal-title":"IET Quant. Commun."},{"key":"4895_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2022.101816","volume":"55","author":"M Das","year":"2023","unstructured":"Das, M., Roy, A., Maity, S., Kar, S.: A Quantum-inspired Ant Colony Optimization for solving a sustainable four-dimensional traveling salesman problem under type-2 fuzzy variable. Adv. Eng. Inf. 55, 101816 (2023)","journal-title":"Adv. Eng. Inf."},{"key":"4895_CR4","doi-asserted-by":"crossref","unstructured":"Li, B., Li, T.: Vehicle path optimization with time window based on improved ant colony algorithm. Data Processing Techniques and Applications for Cyber-Physical Systems, pp. 167\u2013175 (2020)","DOI":"10.1007\/978-981-15-1468-5_22"},{"issue":"1","key":"4895_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.3390\/sym13010070","volume":"13","author":"SA Mohsin","year":"2021","unstructured":"Mohsin, S.A., Younes, A., Darwish, S.M.: Dynamic cost ant colony algorithm to optimize query for distributed database based on quantum-inspired approach. Symmetry 13(1), 70 (2021)","journal-title":"Symmetry"},{"key":"4895_CR6","unstructured":"Demiral, M. F.: Ant colony optimization for a variety of classic assignment problems. Int. Turk. World Eng. Sci. Congr., Antalya (2017)"},{"issue":"1","key":"4895_CR7","first-page":"285","volume":"195","author":"HQ Saremi","year":"2008","unstructured":"Saremi, H.Q., Kermani, A.M.: Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique. Appl. Math. Comput. 195(1), 285\u2013298 (2008)","journal-title":"Appl. Math. Comput."},{"key":"4895_CR8","doi-asserted-by":"crossref","unstructured":"Montero, A. R.: Ant colony optimization for solving the quadratic assign problem. In: 2015 Fourteenth Mexican International Conference on Artificial Intelligence (2015)","DOI":"10.1109\/MICAI.2015.34"},{"issue":"5","key":"4895_CR9","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.3390\/electronics12051171","volume":"12","author":"JK Madhloom","year":"2023","unstructured":"Madhloom, J.K., Ali, H.N.A., Hasan, H.A.: A quantum-inspired ant colony optimization approach for exploring routing gateways in mobile ad hoc networks. Electronics 12(5), 1171 (2023)","journal-title":"Electronics"},{"key":"4895_CR10","doi-asserted-by":"crossref","unstructured":"Ding, Y., Zhao, Y., Gao, Y., Zhang, R.: Q-learning quantum ant colony routing algorithm for micro-nano satellite network. In: 2021 IEEE 6th International Conference on Computer and Communication Systems (2021)","DOI":"10.1109\/ICCCS52626.2021.9449129"},{"key":"4895_CR11","doi-asserted-by":"crossref","unstructured":"An, L., Song, X., Ning, T.: An improved quantum ant colony algorithm for fuzzy dynamic vehicle routing problem. In: 2021 IEEE 9th International Conference on Computer Science and Network Technology (2021)","DOI":"10.1109\/ICCSNT53786.2021.9615478"},{"key":"4895_CR12","doi-asserted-by":"crossref","unstructured":"Li, B., Li, T.: Vehicle path optimization with time window based on improved ant colony algorithm. In: Data Processing Techniques and Applications for Cyber-Physical Systems (DPTA 2019) (2019)","DOI":"10.1007\/978-981-15-1468-5_22"},{"issue":"23","key":"4895_CR13","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1103\/PhysRevLett.48.1581","volume":"48","author":"P Benioff","year":"1982","unstructured":"Benioff, P.: Quantum mechanical models of turing machines that dissipate no energy. Phys. Rev. Lett. 48(23), 1581\u20131585 (1982)","journal-title":"Phys. Rev. Lett."},{"issue":"1818","key":"4895_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1098\/rspa.1985.0070","volume":"400","author":"D Deutsch","year":"1985","unstructured":"Deutsch, D.: Quantum theory, the Church-turing principle and the universal quantum computer. Proc. R. Soc. Lond. Ser. A 400(1818), 97\u2013117 (1985)","journal-title":"Proc. R. Soc. Lond. Ser. A"},{"key":"4895_CR15","unstructured":"Shor, P. W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science (1994)"},{"issue":"2","key":"4895_CR16","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/s42484-024-00220-w","volume":"6","author":"J Xie","year":"2024","unstructured":"Xie, J., Liu, C., Dong, Y.: An evolutionary quantum generative adversarial network. Q. Mach. Intell. 6(2), 84 (2024)","journal-title":"Q. Mach. Intell."},{"key":"4895_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.116583","volume":"195","author":"E Paquet","year":"2022","unstructured":"Paquet, E., Soleymani, F.: Quantum leap: hybrid quantum neural network for financial predictions. Expert Syst. Appl. 195, 116583 (2022)","journal-title":"Expert Syst. Appl."},{"issue":"8","key":"4895_CR18","doi-asserted-by":"publisher","first-page":"35","DOI":"10.3991\/ijim.v16i08.30107","volume":"16","author":"HTS ALRikabi","year":"2022","unstructured":"ALRikabi, H.T.S., Aljazaery, I.A., Qateef, J.S., et al.: Face patterns analysis and recognition system based on Quantum Neural Network QNN. Int. J. Interact. Mob. Tech 16(8), 35\u201348 (2022)","journal-title":"Int. J. Interact. Mob. Tech"},{"issue":"11","key":"4895_CR19","first-page":"14717","volume":"72","author":"B Narottama","year":"2023","unstructured":"Narottama, B., Shin, S.Y.: Federated quantum neural network with quantum teleportation for resource optimization in future wireless communication. IEEE Trans. Veh. Technol. 72(11), 14717\u201314733 (2023)","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"12","key":"4895_CR20","doi-asserted-by":"publisher","first-page":"6999","DOI":"10.1109\/TNNLS.2021.3084827","volume":"33","author":"Z Li","year":"2022","unstructured":"Li, Z., Liu, F., Yang, W., Peng, S., Zhou, J.: A survey of convolutional neural networks: analysis, applications, and prospects. IEEE Trans. Neural Netw. Learn. Syst. 33(12), 6999 (2022)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"3","key":"4895_CR21","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1109\/JPROC.2021.3060483","volume":"109","author":"W Samek","year":"2021","unstructured":"Samek, W., Montavon, G., Lapuschkin, S., Anders, C.J., M\u00fcller, K.-R.: Explaining deep neural networks and beyond: a review of methods and applications. Proc. IEEE 109(3), 247 (2021)","journal-title":"Proc. IEEE"},{"key":"4895_CR22","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1007\/s12065-023-00822-6","volume":"17","author":"B Alhijawi","year":"2024","unstructured":"Alhijawi, B., Awajan, A.: Genetic algorithms: theory, genetic operators, solutions, and applications. Evol. Intel. 17, 1245\u20131256 (2024)","journal-title":"Evol. Intel."},{"issue":"11","key":"4895_CR23","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.3390\/sym12111758","volume":"12","author":"MA Albadr","year":"2020","unstructured":"Albadr, M.A., Tiun, S., Ayob, M., Al-Dhief, F.: Genetic algorithm based on natural selection theory for optimization problems. Symmetry 12(11), 1758 (2020)","journal-title":"Symmetry"},{"key":"4895_CR24","first-page":"17","volume":"2022","author":"SKM Hossain","year":"2022","unstructured":"Hossain, S.K.M., Ema, S.A., Sohn, H.: Rule-based classification based on ant colony optimization: a comprehensive review. Appl. Comput. Intell. Soft Comput. 2022, 17 (2022)","journal-title":"Appl. Comput. Intell. Soft Comput."},{"key":"4895_CR25","doi-asserted-by":"crossref","unstructured":"Ma, X., Li, Y.: An improved quantum ant colony algorithm and its application. In: 2012 International Conference on Furture Computer Supported Education, Vol. 1, pp. 522\u2013527 (2012)","DOI":"10.1016\/j.ieri.2012.06.127"},{"key":"4895_CR26","unstructured":"Niu, Q., Wang, L., Fei, M.: A novel quantum ant colony optimization algorithm. Lecture Notes in Computer Science book series (LNCS), Bio-Inspired Computational Intelligence and Applications, vol. 4688 (2007)"},{"key":"4895_CR27","unstructured":"Song, K., Li, P., Yang, E.: Quantum ant colony optimization with application. In: Sixth International Conference on Natural Computation (2010)"},{"key":"4895_CR28","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/s42484-022-00065-1","volume":"4","author":"M Garcia de Andoin","year":"2022","unstructured":"Garcia de Andoin, M., Echanobe, J.: Implementable hybrid quantum ant colony optimization algorithm. Q. Mach. Intell. 4, 12 (2022)","journal-title":"Q. Mach. Intell."},{"issue":"2023","key":"4895_CR29","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.ins.2022.11.139","volume":"622","author":"AM Ikotun","year":"2023","unstructured":"Ikotun, A.M., Ezugwu, A.E., Abualigah, L., Abuhaia, B., Heming, J.: K-means clustering algorithm: a comprehensive review, variants analysis and advances in the era of big data. Inf. Sci. 622(2023), 178\u2013210 (2023)","journal-title":"Inf. Sci."},{"issue":"4","key":"4895_CR30","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB\u2014a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"issue":"18","key":"4895_CR31","doi-asserted-by":"publisher","first-page":"6180","DOI":"10.3390\/app10186180","volume":"10","author":"M Liu","year":"2020","unstructured":"Liu, M., Li, Y., Huo, Q., Li, A.: A two-way parallel slime mold algorithm by flow and distance for the travelling salesman problem. Appl. Sci. 10(18), 6180 (2020)","journal-title":"Appl. Sci."},{"key":"4895_CR32","doi-asserted-by":"crossref","unstructured":"Gratsos, K., Ougiaroglou, S., Margaris, D.: A web tool For K-means clustering. Novel & Intelligent Digital Systems: Proceedings of the 3rd International Conference (NiDS 2003), 1, pp. 91\u2013101 (2003)","DOI":"10.1007\/978-3-031-44097-7_9"},{"key":"4895_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117927","volume":"207","author":"A Abernathy","year":"2022","unstructured":"Abernathy, A., Celebi, M.E.: The incremental online k-means clustering algorithm and its application to color quantization. Expert Syst. Appl. 207, 117927 (2022)","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"4895_CR34","doi-asserted-by":"publisher","first-page":"24","DOI":"10.35940\/ijeat.D3417.0411422","volume":"11","author":"Jayashree","year":"2022","unstructured":"Jayashree, Shivaprakash, T.: Optimal value for number of clusters in a dataset for clustering algorithm. Int. J. Eng. Adv. Technol. 11(4), 24\u201329 (2022)","journal-title":"Int. J. Eng. Adv. Technol."},{"issue":"9","key":"4895_CR35","doi-asserted-by":"publisher","first-page":"25070","DOI":"10.3934\/math.20241222","volume":"9","author":"AM Abdussamad","year":"2024","unstructured":"Abdussamad, A.M., Inayat, A.: Addressing limitations of the K-means clustering algorithm: outliers, non-spherical data, and optimal cluster selection. AIMS Math. 9(9), 25070\u201325097 (2024)","journal-title":"AIMS Math."},{"key":"4895_CR36","unstructured":"Wu, W., et al. Quantumdarts: differentiable quantum architecture search for variational quantum algorithms. In: International conference on machine learning. PMLR (2023)"},{"issue":"2","key":"4895_CR37","first-page":"242","volume":"23","author":"VV Shende","year":"2004","unstructured":"Shende, V.V., Markov, I.L., Kowalski, M.: Synthesis of quantum logic circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 23(2), 242\u2013257 (2004)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"4895_CR38","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: The advantages of careful seeding. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, New Orleans, LA, USA, January; pp. 1027\u20131035 (2007)"},{"key":"4895_CR39","doi-asserted-by":"crossref","unstructured":"Jinnai, H., Yasuda, K., Ishigame, A.: Similarity measure of proximate optimality principle and multi-point Tabu search. In: 2008 IEEE International Conference on Systems, Man and Cybernetics (2008)","DOI":"10.1541\/ieejeiss.128.515"},{"issue":"5","key":"4895_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/s11433-022-2057-y","volume":"66","author":"HL Huang","year":"2023","unstructured":"Huang, H.L., Xu, X.Y., Guo, C., Tian, G., Wei, S.J., Sun, X., Bao, W.S., Long, G.L.: Near-term quantum computing techniques: variational quantum algorithms, error mitigation, circuit compilation, benchmarking and classical simulation. Sci. China Phys. Mech. Astron. 66(5), 250302 (2023)","journal-title":"Sci. China Phys. Mech. Astron."},{"issue":"9","key":"4895_CR41","doi-asserted-by":"publisher","first-page":"1806","DOI":"10.1109\/TPAMI.2011.21","volume":"33","author":"J Berclaz","year":"2011","unstructured":"Berclaz, J., Fleuret, F., T\u00fcretken, E., Fua, P.: Multiple object tracking using K-shortest paths optimization. IEEE Trans. Pattern Anal. Mach. Intell. 33(9), 1806\u20131819 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"4895_CR42","first-page":"4805035","volume":"1","author":"L Deng","year":"2022","unstructured":"Deng, L., Wan, L., Guo, J.: Research on security anomaly detection for big data platforms based on quantum optimization clustering. Math. Probl. Eng. 1, 4805035 (2022)","journal-title":"Math. Probl. Eng."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04895-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-025-04895-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04895-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T17:40:59Z","timestamp":1760636459000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-025-04895-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,22]]},"references-count":42,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2025,9]]}},"alternative-id":["4895"],"URL":"https:\/\/doi.org\/10.1007\/s11128-025-04895-3","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2025,8,22]]},"assertion":[{"value":"3 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 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 code that supports the findings of this study is available from the corresponding author upon reasonable request.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}],"article-number":"280"}}