{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T14:40:10Z","timestamp":1742222410397,"version":"3.38.0"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,27]],"date-time":"2025-01-27T00:00:00Z","timestamp":1737936000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,27]],"date-time":"2025-01-27T00:00:00Z","timestamp":1737936000000},"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":["61961023"],"award-info":[{"award-number":["61961023"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Guangxi Natural Science Foundation","award":["2021GXNSFAA220046"],"award-info":[{"award-number":["2021GXNSFAA220046"]}]},{"name":"Doctoral Foundation of Guangxi University of Science and Technology","award":["21Z04"],"award-info":[{"award-number":["21Z04"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-025-04648-2","type":"journal-article","created":{"date-parts":[[2025,1,27]],"date-time":"2025-01-27T07:49:19Z","timestamp":1737964159000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Physical synthesis of quantum circuits using Q-learning"],"prefix":"10.1007","volume":"24","author":[{"given":"Dengli","family":"Bu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiyan","family":"Bin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,27]]},"reference":[{"key":"4648_CR1","doi-asserted-by":"publisher","first-page":"20190143","DOI":"10.1098\/rsfs.2019.0143","volume":"10","author":"V Kendon","year":"2020","unstructured":"Kendon, V.: Quantum computing using continuous-time evolution. Interface Focus 10, 20190143 (2020). https:\/\/doi.org\/10.1098\/rsfs.2019.0143","journal-title":"Interface Focus"},{"key":"4648_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1109\/TC.2015.2409842","volume":"65","author":"V Kliuchnikov","year":"2016","unstructured":"Kliuchnikov, V., Maslov, D., Mosca, M.: Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits. IEEE Trans. Comput. 65, 161\u2013172 (2016). https:\/\/doi.org\/10.1109\/TC.2015.2409842","journal-title":"IEEE Trans. Comput."},{"key":"4648_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/MDAT.2019.2907130","volume":"36","author":"TS Humble","year":"2019","unstructured":"Humble, T.S., Thapliyal, H., Mu\u00f1oz-Coreas, E., Mohiyaddin, F.A., Bennink, R.S.: Quantum computing circuits and devices. IEEE Des. Test 36, 69\u201394 (2019). https:\/\/doi.org\/10.1109\/MDAT.2019.2907130","journal-title":"IEEE Des. Test"},{"key":"4648_CR4","doi-asserted-by":"publisher","first-page":"10968","DOI":"10.1038\/s41598-020-67364-0","volume":"10","author":"B Gulbahar","year":"2020","unstructured":"Gulbahar, B.: Theory of quantum path computing with Fourier optics and future applications for quantum supremacy, neural networks and nonlinear Schr\u00f6dinger equations. Sci. Rep. 10, 10968 (2020). https:\/\/doi.org\/10.1038\/s41598-020-67364-0","journal-title":"Sci. Rep."},{"key":"4648_CR5","doi-asserted-by":"crossref","unstructured":"Senekane, M., Maseli, M., Taele, M.B.: Noisy, intermediate-scale quantum computing and industrial revolution 4.0. In: Doorsamy ,W., Paul, B.S., Marwala, T. (eds.) The Disruptive Fourth Industrial Revolution: Technology, Society and Beyond, pp. 205\u2013225, Springer International Publishing, Cham (2020)","DOI":"10.1007\/978-3-030-48230-5_9"},{"key":"4648_CR6","doi-asserted-by":"publisher","first-page":"2823","DOI":"10.1007\/s10773-021-04864-3","volume":"60","author":"SS Gayathri","year":"2021","unstructured":"Gayathri, S.S., Kumar, R., Dhanalakshmi, S., Kaushik, B.K., Haghparast, M.: T-count optimized wallace tree integer multiplier for quantum computing. Int. J. Theor. Phys. 60, 2823\u20132835 (2021). https:\/\/doi.org\/10.1007\/s10773-021-04864-3","journal-title":"Int. J. Theor. Phys."},{"key":"4648_CR7","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/spe.3039","volume":"52","author":"SS Gill","year":"2022","unstructured":"Gill, S.S., Kumar, A., Singh, H., Singh, M., Kaur, K., et al.: Quantum computing: A taxonomy, systematic review and future directions. Softw. Pract. Exp. 52, 66\u2013114 (2022). https:\/\/doi.org\/10.1002\/spe.3039","journal-title":"Softw. Pract. Exp."},{"key":"4648_CR8","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":"4648_CR9","doi-asserted-by":"publisher","unstructured":"Almudever, C.G., Alarcon, E.: Structured optimized architecting of full-stack quantum systems in the NISQ era. In: 2021 Design, Automation and Test in Europe Conference and Exhibition (DATE), pp. 762\u2013767, IEEE, Grenoble, France, (2021). https:\/\/doi.org\/10.23919\/DATE51398.2021.9474197","DOI":"10.23919\/DATE51398.2021.9474197"},{"key":"4648_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.22331\/q-2019-10-07-191","volume":"3","author":"X Yuan","year":"2019","unstructured":"Yuan, X., Endo, S., Zhao, Q., Li, Y., Benjamin, S.C.: Theory of variational quantum simulation. Quantum 3, 191 (2019). https:\/\/doi.org\/10.22331\/q-2019-10-07-191","journal-title":"Quantum"},{"key":"4648_CR11","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1109\/MCAS.2016.2549950","volume":"16","author":"M Pedram","year":"2016","unstructured":"Pedram, M., Shafaei, A.: Layout optimization for quantum circuits with linear nearest neighbor architectures. IEEE Circuits Syst. Mag. 16, 62\u201374 (2016). https:\/\/doi.org\/10.1109\/MCAS.2016.2549950","journal-title":"IEEE Circuits Syst. Mag."},{"key":"4648_CR12","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/abe665","volume":"6","author":"A Paler","year":"2021","unstructured":"Paler, A., Zulehner, A., Wille, R.: NISQ circuit compilation is the travelling salesman problem on a torus. Quantum Sci. Technol. 6, 025016 (2021). https:\/\/doi.org\/10.1088\/2058-9565\/abe665","journal-title":"Quantum Sci. Technol."},{"key":"4648_CR13","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s00354-022-00163-5","volume":"40","author":"L Chhangte","year":"2022","unstructured":"Chhangte, L., Chakrabarty, A.: Mapping quantum circuits in IBM Q devices using progressive qubit assignment for global ordering. N. Gener. Comput. 40, 311\u2013338 (2022). https:\/\/doi.org\/10.1007\/s00354-022-00163-5","journal-title":"N. Gener. Comput."},{"key":"4648_CR14","doi-asserted-by":"publisher","first-page":"237:1","DOI":"10.1007\/s11128-022-03571-0","volume":"21","author":"W Hu","year":"2022","unstructured":"Hu, W., Yang, Y., Xia, W., Pi, J., Huang, E.M., et al.: Performance of superconducting quantum computing chips under different architecture design. Quantum Inf. Process. 21, 237:1-237:14 (2022). https:\/\/doi.org\/10.1007\/s11128-022-03571-0","journal-title":"Quantum Inf. Process."},{"key":"4648_CR15","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.vlsi.2020.12.002","volume":"78","author":"A Bhattacharjee","year":"2021","unstructured":"Bhattacharjee, A., Bandyopadhyay, C., Mukherjee, A., Wille, R., Drechsler, R., et al.: An ant colony based mapping of quantum circuits to nearest neighbor architectures. Integration 78, 11\u201324 (2021). https:\/\/doi.org\/10.1016\/j.vlsi.2020.12.002","journal-title":"Integration"},{"key":"4648_CR16","doi-asserted-by":"publisher","first-page":"1825","DOI":"10.1109\/TCAD.2020.3032072","volume":"40","author":"A Deb","year":"2021","unstructured":"Deb, A., Dueck, G.W., Wille, R.: Exploring the potential benefits of alternative quantum computing architectures. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 40, 1825\u20131835 (2021). https:\/\/doi.org\/10.1109\/TCAD.2020.3032072","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"4648_CR17","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.vlsi.2020.09.003","volume":"76","author":"A Bhattacharjee","year":"2021","unstructured":"Bhattacharjee, A., Bandyopadhyay, C., Niemann, P., Mondal, B., Drechsler, R., et al.: An improved heuristic technique for nearest neighbor realization of quantum circuits in 2D architecture. Integration 76, 40\u201354 (2021). https:\/\/doi.org\/10.1016\/j.vlsi.2020.09.003","journal-title":"Integration"},{"key":"4648_CR18","doi-asserted-by":"publisher","unstructured":"Siraichi, M.Y., Santos, V.F., Collange, C., Pereira, F.M.Q.: Qubit allocation. In: Proceedings of the 2018 international symposium on code generation and optimization, CGO 2018, pp. 113\u2013125 Association for Computing Machinery, New York, NY, USA, (2018). https:\/\/doi.org\/10.1145\/3168822","DOI":"10.1145\/3168822"},{"key":"4648_CR19","doi-asserted-by":"publisher","first-page":"1226","DOI":"10.1109\/TCAD.2018.2846658","volume":"38","author":"A Zulehner","year":"2019","unstructured":"Zulehner, A., Paler, A., Wille, R.: An efficient methodology for mapping quantum circuits to the IBM QX architectures. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 38, 1226\u20131236 (2019). https:\/\/doi.org\/10.1109\/TCAD.2018.2846658","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"4648_CR20","doi-asserted-by":"publisher","first-page":"2375","DOI":"10.1109\/TCAD.2019.2962753","volume":"39","author":"A Kole","year":"2020","unstructured":"Kole, A., Hillmich, S., Datta, K., Wille, R., Sengupta, I.: Improved mapping of quantum circuits to IBM QX architectures. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39, 2375\u20132383 (2020). https:\/\/doi.org\/10.1109\/TCAD.2019.2962753","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"4648_CR21","doi-asserted-by":"publisher","unstructured":"Niemann, P., M\u00fcller, L., Drechsler, R.: Finding optimal implementations of non-native CNOT gates using SAT. In: Reversible Computation, pp. 242\u2013255. Springer International Publishing, Cham, (2021). https:\/\/doi.org\/10.1007\/978-3-030-79837-6_15","DOI":"10.1007\/978-3-030-79837-6_15"},{"key":"4648_CR22","doi-asserted-by":"publisher","first-page":"1777","DOI":"10.1109\/TC.2020.3023247","volume":"70","author":"S Li","year":"2021","unstructured":"Li, S., Zhou, X., Feng, Y.: Qubit mapping based on subgraph isomorphism and filtered depth-limited search. IEEE Trans. Comput. 70, 1777\u20131788 (2021). https:\/\/doi.org\/10.1109\/TC.2020.3023247","journal-title":"IEEE Trans. Comput."},{"key":"4648_CR23","doi-asserted-by":"publisher","unstructured":"Zhou, X, Feng, Y., Li, S.: Quantum circuit transformation: a monte carlo tree search framework. ACM Transactions on Design Automation of Electronic Systems 27, Article 59 (2022). https:\/\/doi.org\/10.1145\/3514239","DOI":"10.1145\/3514239"},{"key":"4648_CR24","doi-asserted-by":"publisher","first-page":"2587","DOI":"10.1109\/TCAD.2021.3112143","volume":"41","author":"P Zhu","year":"2022","unstructured":"Zhu, P., Feng, S., Guan, Z.: An iterated local search methodology for the qubit mapping problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 41, 2587\u20132597 (2022). https:\/\/doi.org\/10.1109\/TCAD.2021.3112143","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"4648_CR25","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1109\/TC.2020.3009140","volume":"70","author":"B Tan","year":"2021","unstructured":"Tan, B., Cong, J.: Optimality study of existing quantum computing layout synthesis tools. IEEE Trans. Comput. 70, 1363\u20131373 (2021). https:\/\/doi.org\/10.1109\/TC.2020.3009140","journal-title":"IEEE Trans. Comput."},{"key":"4648_CR26","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/j.jmsy.2021.02.014","volume":"59","author":"M Neves","year":"2021","unstructured":"Neves, M., Vieira, M., Neto, P.: A study on a Q-learning algorithm application to a manufacturing assembly problem. J. Manuf. Syst. 59, 426\u2013440 (2021). https:\/\/doi.org\/10.1016\/j.jmsy.2021.02.014","journal-title":"J. Manuf. Syst."},{"key":"4648_CR27","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction, 2nd edn. MIT Press, Cambridge (2018)","edition":"2"},{"key":"4648_CR28","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1049\/cim2.12042","volume":"4","author":"Z He","year":"2022","unstructured":"He, Z., Wang, K., Li, H., Song, H., Lin, Z., et al.: Improved Q-learning algorithm for solving permutation flow shop scheduling problems. IET Collab. Intell. Manuf. 4, 35\u201344 (2022). https:\/\/doi.org\/10.1049\/cim2.12042","journal-title":"IET Collab. Intell. Manuf."},{"key":"4648_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105400","volume":"134","author":"N Mazyavkina","year":"2021","unstructured":"Mazyavkina, N., Sviridov, S., Ivanov, S., Burnaev, E.: Reinforcement learning for combinatorial optimization: a survey. Comput. Oper. Res. 134, 105400 (2021). https:\/\/doi.org\/10.1016\/j.cor.2021.105400","journal-title":"Comput. Oper. Res."},{"key":"4648_CR30","doi-asserted-by":"publisher","unstructured":"Li, R., Li, F., Li, X., Wang, Y.: QGrid: Q-learning based routing protocol for vehicular ad hoc networks. In :2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC), pp. 1\u20138 (2014). https:\/\/doi.org\/10.1109\/PCCC.2014.7017079","DOI":"10.1109\/PCCC.2014.7017079"},{"key":"4648_CR31","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.robot.2019.02.013","volume":"115","author":"ES Low","year":"2019","unstructured":"Low, E.S., Ong, P., Cheah, K.C.: Solving the optimal path planning of a mobile robot using improved Q-learning. Robot. Auton. Syst. 115, 143\u2013161 (2019). https:\/\/doi.org\/10.1016\/j.robot.2019.02.013","journal-title":"Robot. Auton. Syst."},{"key":"4648_CR32","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1109\/JIOT.2021.3089759","volume":"9","author":"MY Arafat","year":"2022","unstructured":"Arafat, M.Y., Moh, S.: A Q-learning-based topology-aware routing protocol for flying ad hoc networks. IEEE Internet Things J. 9, 1985\u20132000 (2022). https:\/\/doi.org\/10.1109\/JIOT.2021.3089759","journal-title":"IEEE Internet Things J."},{"key":"4648_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115978","volume":"187","author":"J Lin","year":"2022","unstructured":"Lin, J., Li, Y.Y., Song, H.B.: Semiconductor final testing scheduling using Q-learning based hyper-heuristic. Expert Syst. Appl. 187, 115978 (2022). https:\/\/doi.org\/10.1016\/j.eswa.2021.115978","journal-title":"Expert Syst. Appl."},{"key":"4648_CR34","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/3520434","volume":"3","author":"MG Pozzi","year":"2022","unstructured":"Pozzi, M.G., Herbert, S.J., Sengupta, A., Mullins, R.D.: Using reinforcement learning to perform qubit routing in quantum compilers. ACM Trans. Quantum Comput. 3, 10 (2022). https:\/\/doi.org\/10.1145\/3520434","journal-title":"ACM Trans. Quantum Comput."},{"key":"4648_CR35","doi-asserted-by":"publisher","unstructured":"Kremer, D., Villar, V., Paik, H., Duran, I., Faro, I., et\u00a0al.: Practical and efficient quantum circuit synthesis and transpiling with reinforcement learning (2024). https:\/\/doi.org\/10.48550\/arXiv.2405.13196","DOI":"10.48550\/arXiv.2405.13196"},{"key":"4648_CR36","volume-title":"An Introduction to Quantum Computing","author":"P Kaye","year":"2007","unstructured":"Kaye, P., Laflamme, R., Mosca, M.: An Introduction to Quantum Computing. Oxford University Press, New York (2007)"},{"key":"4648_CR37","volume-title":"Quantum Computing: A Gentle Introduction","author":"E Rieffel","year":"2011","unstructured":"Rieffel, E., Polak, W.: Quantum Computing: A Gentle Introduction. MIT Press, Cambridge (2011)"},{"key":"4648_CR38","doi-asserted-by":"publisher","DOI":"10.1063\/5.0029735","volume":"129","author":"S Kwon","year":"2021","unstructured":"Kwon, S., Tomonaga, A., Lakshmi Bhai, G., Devitt, S.J., Tsai, J.S.: Gate-based superconducting quantum computing. J. Appl. Phys. 129, 041102 (2021). https:\/\/doi.org\/10.1063\/5.0029735","journal-title":"J. Appl. Phys."},{"key":"4648_CR39","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 2nd edn. North Holland, Hungary (2004)","edition":"2"},{"key":"4648_CR40","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1007\/s00500-007-0273-9","volume":"12","author":"S Ding","year":"2008","unstructured":"Ding, S., Jin, Z., Yang, Q.: Evolving quantum circuits at the gate level with a hybrid quantum-inspired evolutionary algorithm. Soft. Comput. 12, 1059\u20131072 (2008). https:\/\/doi.org\/10.1007\/s00500-007-0273-9","journal-title":"Soft. Comput."},{"key":"4648_CR41","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/s11128-017-1762-0","volume":"16","author":"BK Behera","year":"2017","unstructured":"Behera, B.K., Banerjee, A., Panigrahi, P.K.: Experimental realization of quantum cheque using a five-qubit quantum computer. Quantum Inf. Process. 16, 312 (2017). https:\/\/doi.org\/10.1007\/s11128-017-1762-0","journal-title":"Quantum Inf. Process."},{"key":"4648_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113761","volume":"163","author":"JB Chakole","year":"2021","unstructured":"Chakole, J.B., Kolhe, M.S., Mahapurush, G.D., Yadav, A., Kurhekar, M.P.: A Q-learning agent for automated trading in equity stock markets. Expert Syst. Appl. 163, 113761 (2021). https:\/\/doi.org\/10.1016\/j.eswa.2020.113761","journal-title":"Expert Syst. Appl."},{"key":"4648_CR43","first-page":"257","volume":"E18","author":"YCF Reyna","year":"2019","unstructured":"Reyna, Y.C.F., C\u00e1ceres, A.P., Jim\u00e9nez, Y.M., Reyes, Y.T.: An improvement of reinforcement learning approach for permutation of flow-shop scheduling problems. Iber. J. Inf. Syst. Technol. E18, 257\u2013270 (2019)","journal-title":"Iber. J. Inf. Syst. Technol."},{"key":"4648_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2021.108379","volume":"198","author":"LAL da Costa","year":"2021","unstructured":"da Costa, L.A.L., Kunst, R., de Freitas, E.P.: Q-FANET: Improved Q-learning based routing protocol for FANETs. Comput. Netw. 198, 108379 (2021). https:\/\/doi.org\/10.1016\/j.comnet.2021.108379","journal-title":"Comput. Netw."},{"key":"4648_CR45","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.future.2021.09.007","volume":"127","author":"Y Gar\u00ed","year":"2022","unstructured":"Gar\u00ed, Y., Monge, D.A., Mateos, C.: A Q-learning approach for the autoscaling of scientific workflows in the Cloud. Futur. Gener. Comput. Syst. 127, 168\u2013180 (2022). https:\/\/doi.org\/10.1016\/j.future.2021.09.007","journal-title":"Futur. Gener. Comput. Syst."},{"key":"4648_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106796","volume":"97","author":"A Maoudj","year":"2020","unstructured":"Maoudj, A., Hentout, A.: Optimal path planning approach based on Q-learning algorithm for mobile robots. Appl. Soft Comput. 97, 106796 (2020). https:\/\/doi.org\/10.1016\/j.asoc.2020.106796","journal-title":"Appl. Soft Comput."},{"key":"4648_CR47","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF00115009","volume":"3","author":"RS Sutton","year":"1988","unstructured":"Sutton, R.S.: Learning to predict by the methods of temporal differences. Mach. Learn. 3, 9\u201344 (1988). https:\/\/doi.org\/10.1007\/BF00115009","journal-title":"Mach. Learn."},{"key":"4648_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2020.107615","volume":"226","author":"K Watanabe","year":"2020","unstructured":"Watanabe, K., Inada, S.: Search algorithm of the assembly sequence of products by using past learning results. Int. J. Prod. Econ. 226, 107615 (2020). https:\/\/doi.org\/10.1016\/j.ijpe.2020.107615","journal-title":"Int. J. Prod. Econ."},{"key":"4648_CR49","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.future.2019.08.032","volume":"102","author":"WC Chien","year":"2020","unstructured":"Chien, W.C., Weng, H.Y., Lai, C.F.: Q-learning based collaborative cache allocation in mobile edge computing. Futur. Gener. Comput. Syst. 102, 603\u2013610 (2020). https:\/\/doi.org\/10.1016\/j.future.2019.08.032","journal-title":"Futur. Gener. Comput. Syst."},{"key":"4648_CR50","volume-title":"Applied Probability and Stochastic Processes","author":"F Beichelt","year":"2016","unstructured":"Beichelt, F.: Applied Probability and Stochastic Processes. CRC Press, Boca Raton, FL (2016)"},{"key":"4648_CR51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-80328-4","volume-title":"Applied Multivariate Statistics in Geohydrology and Related Sciences","author":"CE Brown","year":"1998","unstructured":"Brown, C.E.: Applied Multivariate Statistics in Geohydrology and Related Sciences. Springer, Berlin Heidelberg (1998)"},{"key":"4648_CR52","doi-asserted-by":"publisher","unstructured":"Soeken, M., Frehse, S., Wille, R., Drechsler, R.: RevKit: an open source toolkit for the design of reversible circuits. In: International Conference on Reversible Computation, pp. 64\u201376. Springer Berlin Heidelberg, (2011). https:\/\/doi.org\/10.1007\/978-3-642-29517-1_6","DOI":"10.1007\/978-3-642-29517-1_6"},{"key":"4648_CR53","doi-asserted-by":"publisher","unstructured":"Wille, R., Gro\u00dfe, D., Teuber, L., Dueck, G.W., Drechsler, R.: RevLib: an online resource for reversible functions and reversible circuits. In: 38th International Symposium on Multiple Valued Logic, pp. 220\u2013225, IEEE, Dallas, TX, USA (2008). https:\/\/doi.org\/10.1109\/ISMVL.2008.43","DOI":"10.1109\/ISMVL.2008.43"},{"key":"4648_CR54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31937-7","volume-title":"Reversible and Quantum Circuits: Optimization and Complexity Analysis","author":"N Abdessaied","year":"2016","unstructured":"Abdessaied, N., Drechsler, R.: Reversible and Quantum Circuits: Optimization and Complexity Analysis. Springer Switzerland, Basel, Switzerland (2016)"},{"key":"4648_CR55","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-19-0957-3","volume-title":"A First Course in Graph Theory and Combinatorics","author":"SM Cioab\u01ce","year":"2022","unstructured":"Cioab\u01ce, S.M., Murty, M.R.: A First Course in Graph Theory and Combinatorics, 2nd edn. Springer, Singapore (2022)","edition":"2"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04648-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-025-04648-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04648-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T13:58:26Z","timestamp":1742219906000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-025-04648-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,27]]},"references-count":55,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,2]]}},"alternative-id":["4648"],"URL":"https:\/\/doi.org\/10.1007\/s11128-025-04648-2","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2025,1,27]]},"assertion":[{"value":"14 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 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 declare that they have no conflict of interest to this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"41"}}