{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:18:44Z","timestamp":1770970724580,"version":"3.50.1"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T00:00:00Z","timestamp":1768867200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T00:00:00Z","timestamp":1768867200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"crossref","award":["DE-SC0024290"],"award-info":[{"award-number":["DE-SC0024290"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    In this work, we consider a novel heuristic decomposition algorithm for\n                    <jats:italic>n<\/jats:italic>\n                    -qubit gates that implement specified amplitude permutations on sparse states with\n                    <jats:italic>m<\/jats:italic>\n                    non-zero amplitudes. These gates can be useful as an algorithmic primitive for higher-order algorithms. We demonstrate this by showing how it can be used as a building block for a novel sparse state preparation algorithm, Cluster Swaps, which is able to significantly reduce CX gate count compared to alternative methods of state preparation considered in this paper when the target states are clustered, i.e., such that there are many pairs of non-zero amplitude basis states whose Hamming distance is 1. Cluster Swaps can be useful for amplitude encoding of sparse data vectors in quantum machine learning applications.\n                  <\/jats:p>","DOI":"10.1007\/s11128-026-05050-2","type":"journal-article","created":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T06:43:57Z","timestamp":1768891437000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Decomposition of sparse amplitude permutation gates with application to preparation of sparse clustered quantum states"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3950-3356","authenticated-orcid":false,"given":"Igor","family":"Gaidai","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6944-4206","authenticated-orcid":false,"given":"Rebekah","family":"Herrman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,20]]},"reference":[{"key":"5050_CR1","unstructured":"O\u2019Gorman, B., Huggins, W.J., Rieffel, E.G., Whaley, K.B.: Generalized swap networks for near-term quantum computing. arXiv preprint arXiv:1905.05118 (2019)"},{"key":"5050_CR2","unstructured":"Liu, J., Ren, Y., Cao, Y., Sun, H., Chen, L.: Realization of permutation groups by quantum circuit. arXiv preprint arXiv:2406.01350 (2024)"},{"key":"5050_CR3","unstructured":"Childs, A.M., Schoute, E., Unsal, C.M.: Circuit transformations for quantum architectures. arXiv preprint arXiv:1902.09102 (2019)"},{"key":"5050_CR4","doi-asserted-by":"crossref","unstructured":"Liu, J., Younis, E., Weiden, M., Hovland, P., Kubiatowicz, J., Iancu, C.: Tackling the qubit mapping problem with permutation-aware synthesis. In: 2023 IEEE International Conference on Quantum Computing and Engineering (QCE), vol. 1, pp. 745\u2013756. IEEE (2023)","DOI":"10.1109\/QCE57702.2023.00090"},{"key":"5050_CR5","doi-asserted-by":"crossref","unstructured":"De\u00a0Almeida, A.A.A., Dueck, G.W., Da\u00a0Silva, A.C.R.: Finding optimal qubit permutations for ibm\u2019s quantum computer architectures. In: Proceedings of the 32nd Symposium on Integrated Circuits and Systems Design, pp. 1\u20136 (2019)","DOI":"10.1145\/3338852.3339829"},{"issue":"1","key":"5050_CR6","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1140\/epjqt\/s40507-022-00145-y","volume":"9","author":"R Kuang","year":"2022","unstructured":"Kuang, R., Perepechaenko, M.: Quantum encryption with quantum permutation pad in ibmq systems. EPJ Quant. Technol. 9(1), 26 (2022)","journal-title":"EPJ Quant. Technol."},{"key":"5050_CR7","unstructured":"Atmoko, R.A., Kartiko, E., Setyadi, A.T.: Encryption of qubit states using combination of unitary matrix and permutation. J. Teknol. Inf. Terapan (J-TIT), 11(2), (2024)"},{"issue":"25","key":"5050_CR8","doi-asserted-by":"publisher","first-page":"5452","DOI":"10.1103\/PhysRevLett.85.5452","volume":"85","author":"LMK Vandersypen","year":"2000","unstructured":"Vandersypen, L.M.K., Steffen, M., Breyta, G., Yannoni, C.S., Cleve, R., Chuang, I.L.: Experimental realization of an order-finding algorithm with an nmr quantum computer. Phys. Rev. Lett. 85(25), 5452 (2000)","journal-title":"Phys. Rev. Lett."},{"issue":"6","key":"5050_CR9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.96.062339","volume":"96","author":"\u0130 Yal\u00e7\u0131nkaya","year":"2017","unstructured":"Yal\u00e7\u0131nkaya, \u0130, Gedik, Z.: Optimization and experimental realization of the quantum permutation algorithm. Phys. Rev. A 96(6), 062339 (2017)","journal-title":"Phys. Rev. A"},{"key":"5050_CR10","doi-asserted-by":"crossref","unstructured":"Metwalli, S.A., Van\u00a0Meter, R.: Testing and debugging quantum circuits. IEEE Trans. Quant. Eng. (2024)","DOI":"10.1109\/TQE.2024.3374879"},{"issue":"2","key":"5050_CR11","doi-asserted-by":"publisher","first-page":"34","DOI":"10.3390\/a12020034","volume":"12","author":"S Hadfield","year":"2019","unstructured":"Hadfield, S., Wang, Z., O\u2019gorman, B., Rieffel, E.G., Venturelli, D., Biswas, R.: From the quantum approximate optimization algorithm to a quantum alternating operator ansatz. Algorithms 12(2), 34 (2019)","journal-title":"Algorithms"},{"key":"5050_CR12","doi-asserted-by":"crossref","unstructured":"Palackal, L., Richter, L., Hess, M.: Graph-controlled permutation mixers in qaoa for the flexible job-shop problem. arXiv preprint arXiv:2311.04100 (2023)","DOI":"10.24251\/HICSS.2023.916"},{"key":"5050_CR13","unstructured":"Tsvelikhovskiy, B., Safro, I., Alexeev, Y.: Equivariant qaoa and the duel of the mixers. arXiv preprint arXiv:2405.07211 (2024)"},{"key":"5050_CR14","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028 (2014)"},{"key":"5050_CR15","unstructured":"Bak\u00f3, B., Glos, A., Salehi, \u00d6., Zimbor\u00e1s, Z.: Prog-qaoa: framework for resource-efficient quantum optimization through classical programs. arXiv preprint arXiv:2209.03386 (2022)"},{"issue":"2","key":"5050_CR16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.110.022441","volume":"110","author":"A Wilkie","year":"2024","unstructured":"Wilkie, A., Gaidai, I., Ostrowski, J., Herrman, R.: Quantum approximate optimization algorithm with random and subgraph phase operators. Phys. Rev. A 110(2), 022441 (2024)","journal-title":"Phys. Rev. A"},{"key":"5050_CR17","doi-asserted-by":"crossref","unstructured":"Li, T., Su, Y., Yang, Z., Zhang, S: Quantum approximate optimization algorithms for maxmimum cut on low-girth graphs. arXiv preprint arXiv:2410.04409 (2024)","DOI":"10.21203\/rs.3.rs-5986621\/v1"},{"issue":"4","key":"5050_CR18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevApplied.22.044074","volume":"22","author":"FB Maciejewski","year":"2024","unstructured":"Maciejewski, F.B., Hadfield, S., Hall, B., Hodson, M., Dupont, M., Evert, B., Sud, J., Alam, M.S., Wang, Z., Jeffrey, S., et al.: Design and execution of quantum circuits using tens of superconducting qubits and thousands of gates for dense ising optimization problems. Phys. Rev. Appl. 22(4), 044074 (2024)","journal-title":"Phys. Rev. Appl."},{"key":"5050_CR19","unstructured":"Ng, T.Y., Koh, J.M., Koh, D.E.: Analytical expressions for the quantum approximate optimization algorithm and its variants. arXiv preprint arXiv:2411.09745 (2024)"},{"issue":"2","key":"5050_CR20","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.111.022418","volume":"111","author":"I Lyngfelt","year":"2025","unstructured":"Lyngfelt, I., Garc\u00eda-\u00c1lvarez, L.: Symmetry-informed transferability of optimal parameters in the quantum approximate optimization algorithm. Phys. Rev. A 111(2), 022418 (2025)","journal-title":"Phys. Rev. A"},{"issue":"1","key":"5050_CR21","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1287\/ijoc.2024.0564","volume":"37","author":"V Katial","year":"2025","unstructured":"Katial, V., Smith-Miles, K., Hill, C., Hollenberg, L.: On the instance dependence of parameter initialization for the quantum approximate optimization algorithm: Insights via instance space analysis. INFORMS J. Comput. 37(1), 146\u2013171 (2025)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"5050_CR22","doi-asserted-by":"publisher","first-page":"6781","DOI":"10.1038\/s41598-022-10555-8","volume":"12","author":"R Herrman","year":"2022","unstructured":"Herrman, R., Lotshaw, P.C., Ostrowski, J., Humble, T.S., Siopsis, G.: Multi-angle quantum approximate optimization algorithm. Sci. Rep. 12(1), 6781 (2022)","journal-title":"Sci. Rep."},{"issue":"1","key":"5050_CR23","doi-asserted-by":"publisher","first-page":"18911","DOI":"10.1038\/s41598-024-69643-6","volume":"14","author":"I Gaidai","year":"2024","unstructured":"Gaidai, I., Herrman, R.: Performance analysis of multi-angle qaoa for p$$>$$ 1. Sci. Rep. 14(1), 18911 (2024)","journal-title":"Sci. Rep."},{"key":"5050_CR24","unstructured":"M\u00f6tt\u00f6nen, M., Vartiainen, J.J.: Decompositions of general quantum gates. Trends in quantum computing research, 149 (2006)"},{"key":"5050_CR25","unstructured":"Rakyta, P., Zimbor\u00e1s, Z.: Efficient quantum gate decomposition via adaptive circuit compression. arXiv preprint arXiv:2203.04426 (2022)"},{"key":"5050_CR26","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.22331\/q-2024-10-04-1493","volume":"8","author":"T Tomesh","year":"2024","unstructured":"Tomesh, T., Allen, N., Dilley, D., Saleem, Z.: Quantum-classical tradeoffs and multi-controlled quantum gate decompositions in variational algorithms. Quantum 8, 1493 (2024)","journal-title":"Quantum"},{"key":"5050_CR27","doi-asserted-by":"publisher","first-page":"1659","DOI":"10.22331\/q-2025-03-12-1659","volume":"9","author":"ECR Rosa","year":"2025","unstructured":"Rosa, E.C.R., Duzzioni, E.I., de Santiago, R.: Optimizing gate decomposition for high-level quantum programming. Quantum 9, 1659 (2025)","journal-title":"Quantum"},{"key":"5050_CR28","doi-asserted-by":"crossref","unstructured":"Liu, J., Bowman, M., Gokhale, P., Dangwal, S., Larson, J., Chong, F.T., Hovland, P.D.: Qcontext: context-aware decomposition for quantum gates. In 2023 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 1\u20135. IEEE (2023)","DOI":"10.1109\/ISCAS46773.2023.10181370"},{"key":"5050_CR29","unstructured":"Vale, R., Azevedo, T.M.D., Ara\u00fajo, I., Araujo, I.F., da\u00a0Silva, A.J.: Decomposition of multi-controlled special unitary single-qubit gates. arXiv preprint arXiv:2302.06377 (2023)"},{"issue":"6","key":"5050_CR30","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1109\/TCAD.2003.811448","volume":"22","author":"VV Shende","year":"2003","unstructured":"Shende, V.V., Prasad, A.K., Markov, I.L., Hayes, J.P.: Synthesis of reversible logic circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(6), 710\u2013722 (2003)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"5050_CR31","doi-asserted-by":"crossref","unstructured":"Soeken, M., Mozafari, F., Schmitt, B., De\u00a0Micheli, G.: Compiling permutations for superconducting qpus. In: 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE), pp. 1349\u20131354. IEEE (2019)","DOI":"10.23919\/DATE.2019.8715275"},{"issue":"9","key":"5050_CR32","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/s11128-024-04508-5","volume":"23","author":"A Khandelwal","year":"2024","unstructured":"Khandelwal, A., Kurniawan, H., Aangiras, S., Salehi, \u00d6., Glos, A.: Classification and transformations of quantum circuit decompositions for permutation operations. Quant. Inf. Process. 23(9), 322 (2024)","journal-title":"Quant. Inf. Process."},{"key":"5050_CR33","doi-asserted-by":"crossref","unstructured":"Gonzales, A., Herrman, R., Campbell, C., Gaidai, I., Liu, J., Tomesh, T., Saleem, Z.H.: Arbitrary state preparation via quantum walks. In: 2024 IEEE International Conference on Quantum Computing and Engineering (QCE), vol. 2, pp. 616\u2013617. IEEE (2024)","DOI":"10.1109\/QCE60285.2024.10432"},{"key":"5050_CR34","doi-asserted-by":"crossref","unstructured":"Gleinig, N., Hoefler, T.: An efficient algorithm for sparse quantum state preparation. In: 2021 58th ACM\/IEEE Design Automation Conference (DAC), pp. 433\u2013438. IEEE (2021)","DOI":"10.1109\/DAC18074.2021.9586240"},{"key":"5050_CR35","unstructured":"Luo, J., Li, L: Circuit complexity of sparse quantum state preparation. arXiv preprint arXiv:2406.16142 (2024)"},{"issue":"6","key":"5050_CR36","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/s11128-022-03549-y","volume":"21","author":"TML de Veras","year":"2022","unstructured":"de Veras, T.M.L., da Silva, L.D., da Silva, A.J.: Double sparse quantum state preparation. Quant. Inf. Process. 21(6), 204 (2022)","journal-title":"Quant. Inf. Process."},{"issue":"11","key":"5050_CR37","doi-asserted-by":"publisher","first-page":"3197","DOI":"10.1021\/acs.jpclett.3c03159","volume":"15","author":"C Feniou","year":"2024","unstructured":"Feniou, C., Adjoua, O., Claudon, B., Zylberman, J., Giner, E., Piquemal, J.-P.: Sparse quantum state preparation for strongly correlated systems. J. Phys. Chem. Lett. 15(11), 3197\u20133205 (2024)","journal-title":"J. Phys. Chem. Lett."},{"issue":"3","key":"5050_CR38","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.110.032609","volume":"110","author":"D Ramacciotti","year":"2024","unstructured":"Ramacciotti, D., Lefterovici, A.I., Rotundo, A.F.: Simple quantum algorithm to efficiently prepare sparse states. Phys. Rev. A 110(3), 032609 (2024)","journal-title":"Phys. Rev. A"},{"issue":"3","key":"5050_CR39","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.110.032439","volume":"110","author":"R Mao","year":"2024","unstructured":"Mao, R., Tian, G., Sun, X.: Toward optimal circuit size for sparse quantum state preparation. Phys. Rev. A 110(3), 032439 (2024)","journal-title":"Phys. Rev. A"},{"key":"5050_CR40","doi-asserted-by":"crossref","unstructured":"Rofougaran, Rod, Wang, Ralph, Ajagekar, Akshay, You, Fengqi: Encoding proteins as quantum states with approximate quantum state preparation by iterated sparse state preparation. Quant. Sci. Technol. (2025)","DOI":"10.1088\/2058-9565\/adb3c7"},{"issue":"2","key":"5050_CR41","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.106.022617","volume":"106","author":"F Mozafari","year":"2022","unstructured":"Mozafari, F., De Micheli, G., Yang, Y.: Efficient deterministic preparation of quantum states using decision diagrams. Phys. Rev. A 106(2), 022617 (2022)","journal-title":"Phys. Rev. A"},{"key":"5050_CR42","unstructured":"Javadi-Abhari, A., Treinish, M., Krsulich, K., Wood, C.J., Lishman, J., Gacon, J., Martiel, S., Nation, P.D., Bishop, L.S., Cross, A.W. et\u00a0al.: Quantum computing with qiskit. arXiv preprint arXiv:2405.08810 (2024)"},{"key":"5050_CR43","volume-title":"Quantum computation and quantum information","author":"MA Nielsen","year":"2010","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum computation and quantum information. Cambridge University Press (2010)"},{"key":"5050_CR44","unstructured":"Javadi-Abhari, A., Treinish, M., Krsulich, K., Wood, C.J., Lishman, J., Gacon, J., Martiel, S., Nation, P.D., Bishop, L.S., Cross, A.W., Johnson, B.R., Gambetta, J.M.: Quantum computing with Qiskit (2024)"},{"key":"5050_CR45","doi-asserted-by":"crossref","unstructured":"Mozafari, F., Soeken, M., Riener, H., De\u00a0Micheli, G.: Automatic uniform quantum state preparation using decision diagrams. In: 2020 IEEE 50th International Symposium on Multiple-Valued Logic (ISMVL), pp. 170\u2013175. IEEE (2020)","DOI":"10.1109\/ISMVL49045.2020.00-10"},{"key":"5050_CR46","unstructured":"Tanaka, Y., Yamasaki, H., Murao, M.: Quantum state preparation via free binary decision diagram. arXiv preprint arXiv:2407.01671 (2024)"},{"key":"5050_CR47","doi-asserted-by":"crossref","unstructured":"Hong, X., Dai, A., Li, C., Li, S., Ying, S., Ying, M.: Advancing quantum state preparation using decision diagram with local invertible maps. arXiv preprint arXiv:2507.17170 (2025)","DOI":"10.1109\/ICCAD66269.2025.11240656"},{"key":"5050_CR48","unstructured":"Abohashima, Z., Elhosen, M., Houssein, E.H., Mohamed, W.M.: Classification with quantum machine learning: a survey. arXiv preprint arXiv:2006.12270 (2020)"},{"issue":"21","key":"5050_CR49","doi-asserted-by":"publisher","first-page":"3318","DOI":"10.3390\/math12213318","volume":"12","author":"D Ranga","year":"2024","unstructured":"Ranga, D., Rana, A., Prajapat, S., Kumar, P., Kumar, K., Vasilakos, A.V.: Quantum machine learning: Exploring the role of data encoding techniques, challenges, and future directions. Mathematics 12(21), 3318 (2024)","journal-title":"Mathematics"},{"key":"5050_CR50","doi-asserted-by":"crossref","unstructured":"Pande, M.B.: A comprehensive review of data encoding techniques for quantum machine learning problems. In: 2024 Second International Conference on Emerging Trends in Information Technology and Engineering (ICETITE), pp. 1\u20137. IEEE (2024)","DOI":"10.1109\/ic-ETITE58242.2024.10493306"},{"issue":"1","key":"5050_CR51","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.7.013177","volume":"7","author":"W Sixuan","year":"2025","unstructured":"Sixuan, W., Zhang, Y., Li, J.: Quantum data parallelism in quantum neural networks. Phys. Rev. Res. 7(1), 013177 (2025)","journal-title":"Phys. Rev. Res."},{"key":"5050_CR52","first-page":"1871","volume":"9","author":"R-E Fan","year":"2008","unstructured":"Fan, R.-E., Chang, K.-W., Hsieh, C.-J., Wang, X.-R., Lin, C.-J.: Liblinear: a library for large linear classification. J. Mach. Learn. Res. 9, 1871\u20131874 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"5050_CR53","doi-asserted-by":"crossref","unstructured":"Araki, T: Accelerating machine learning on sparse datasets with a distributed memory vector architecture. In: 2017 16th International Symposium on Parallel and Distributed Computing (ISPDC), pp. 112\u2013121. IEEE (2017)","DOI":"10.1109\/ISPDC.2017.21"},{"issue":"1","key":"5050_CR54","doi-asserted-by":"publisher","first-page":"236","DOI":"10.3390\/math11010236","volume":"11","author":"K Poulinakis","year":"2023","unstructured":"Poulinakis, K., Drikakis, D., Kokkinakis, I.W., Spottswood, S.M.: Machine-learning methods on noisy and sparse data. Mathematics 11(1), 236 (2023)","journal-title":"Mathematics"},{"key":"5050_CR55","doi-asserted-by":"crossref","unstructured":"Agarwal, B., Mittal, N.: Text classification using machine learning methods-a survey. In: Proceedings of the Second International Conference on Soft Computing for Problem Solving (SocProS 2012), December 28-30, 2012, pp. 701\u2013709. Springer (2014)","DOI":"10.1007\/978-81-322-1602-5_75"},{"issue":"3","key":"5050_CR56","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/sam.11187","volume":"6","author":"L El Ghaoui","year":"2013","unstructured":"El Ghaoui, L., Pham, V., Li, G.-C., Duong, V.-A., Srivastava, A., Bhaduri, K.: Understanding large text corpora via sparse machine learning. Stat. Anal. Data Min. ASA Data Sci. J. 6(3), 221\u2013242 (2013)","journal-title":"Stat. Anal. Data Min. ASA Data Sci. J."},{"key":"5050_CR57","doi-asserted-by":"crossref","unstructured":"Cheng, H.-T., Koc, L., Harmsen, J., Shaked, T., Chandra, T., Aradhye, H., Anderson, G., Corrado,G., Chai, W., Ispir, M., et\u00a0al.: Wide & deep learning for recommender systems. In: Proceedings of the 1st Workshop on Deep Learning for Recommender Systems, pp. 7\u201310 (2016)","DOI":"10.1145\/2988450.2988454"},{"key":"5050_CR58","doi-asserted-by":"crossref","unstructured":"Alskeini, N.H., K.N. Thanh, Chandran, V., Boles, W.: Face recognition: sparse representation vs. deep learning. In: Proceedings of the 2nd International Conference on Graphics and Signal Processing, pp. 31\u201337 (2018)","DOI":"10.1145\/3282286.3282291"},{"key":"5050_CR59","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.cmpb.2018.10.004","volume":"166","author":"Y Xiao","year":"2018","unstructured":"Xiao, Y., Jun, W., Lin, Z., Zhao, X.: A semi-supervised deep learning method based on stacked sparse auto-encoder for cancer prediction using rna-seq data. Comput. Methods Programs Biomed. 166, 99\u2013105 (2018)","journal-title":"Comput. Methods Programs Biomed."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-026-05050-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-026-05050-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-026-05050-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T07:25:54Z","timestamp":1770967554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-026-05050-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,20]]},"references-count":59,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1]]}},"alternative-id":["5050"],"URL":"https:\/\/doi.org\/10.1007\/s11128-026-05050-2","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,20]]},"assertion":[{"value":"29 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2026","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 declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"31"}}