{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T23:13:18Z","timestamp":1772147598742,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T00:00:00Z","timestamp":1737676800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T00:00:00Z","timestamp":1737676800000},"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":["61874001, 62004001, 62201005, 62004001, 62304001"],"award-info":[{"award-number":["61874001, 62004001, 62201005, 62004001, 62304001"]}],"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":["61874001, 62004001, 62201005, 62004001, 62304001"],"award-info":[{"award-number":["61874001, 62004001, 62201005, 62004001, 62304001"]}],"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":["61874001, 62004001, 62201005, 62004001, 62304001"],"award-info":[{"award-number":["61874001, 62004001, 62201005, 62004001, 62304001"]}],"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":["61874001, 62004001, 62201005, 62004001, 62304001"],"award-info":[{"award-number":["61874001, 62004001, 62201005, 62004001, 62304001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003995","name":"Anhui Provincial Natural Science Foundation","doi-asserted-by":"crossref","award":["2308085QF213"],"award-info":[{"award-number":["2308085QF213"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Science Research Project of Anhui Educational Committee","award":["2022AH050106, 2023AH050072"],"award-info":[{"award-number":["2022AH050106, 2023AH050072"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-025-04655-3","type":"journal-article","created":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T10:09:48Z","timestamp":1737713388000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Enhancing quantum approximate optimization with CNN-CVaR integration"],"prefix":"10.1007","volume":"24","author":[{"given":"Pengnian","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kang","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanming","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liuhuan","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeyu","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shixian","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunlai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zuheng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuehua","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zuyu","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,24]]},"reference":[{"key":"4655_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3389\/fphy.2014.00005","volume":"2","author":"A Lucas","year":"2014","unstructured":"Lucas, A.: Ising formulations of many np problems. Front. Phys. 2, 5 (2014). https:\/\/doi.org\/10.3389\/fphy.2014.00005","journal-title":"Front. Phys."},{"issue":"3","key":"4655_CR2","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.32604\/cmc.2020.010001","volume":"63","author":"Y Ruan","year":"2020","unstructured":"Ruan, Y., Marsh, S., Xue, X., et al.: The quantum approximate algorithm for solving traveling salesman problem. Comput. Mater. Contin. 63(3), 1237\u20131247 (2020). https:\/\/doi.org\/10.32604\/cmc.2020.010001","journal-title":"Comput. Mater. Contin."},{"key":"4655_CR3","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"Hao G Kochenberger","year":"2014","unstructured":"Kochenberger, Hao G., Glover, J.K., et al.: The unconstrained binary quadratic programming problem: a survey. J. Combin. Optim. 28, 58\u201381 (2014). https:\/\/doi.org\/10.1007\/s10878-014-9734-0","journal-title":"J. Combin. Optim."},{"key":"4655_CR4","unstructured":"Oh, Y.-H., Mohammadbagherpoor, H., et\u00a0al.: Solving multi-coloring combinatorial optimization problems using hybrid quantum algorithms (2019). arXiv arXiv:1911.00595 [quant-ph]"},{"key":"4655_CR5","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm (2014). arXiv arXiv:1411.4028 [quant-ph]"},{"key":"4655_CR6","doi-asserted-by":"publisher","first-page":"256","DOI":"10.22331\/q-2020-04-20-256","volume":"4","author":"KlP Barkoutsos","year":"2020","unstructured":"Barkoutsos, Kl.P., Nannicini, G., et al.: Improving variational quantum optimization using CVaR. Quantum 4, 256 (2020). https:\/\/doi.org\/10.22331\/q-2020-04-20-256","journal-title":"Quantum"},{"key":"4655_CR7","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.95.062317","volume":"95","author":"Z Jiang","year":"2017","unstructured":"Jiang, Z., Rieffel, E.G., Wang, Z.: Near-optimal quantum circuit for Grover\u2019s unstructured search using a transverse field. Phys. Rev. A 95, 062317 (2017). https:\/\/doi.org\/10.1103\/PhysRevA.95.062317","journal-title":"Phys. Rev. A"},{"key":"4655_CR8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevApplied.19.024027","volume":"19","author":"Z Zhou","year":"2023","unstructured":"Zhou, Z., Du, Y., Tian, X., et al.: QAOA-in-QAOA: Solving large-scale MaxCut problems on small quantum machines. Phys. Rev. Appl. 19, 024027 (2023). https:\/\/doi.org\/10.1103\/PhysRevApplied.19.024027","journal-title":"Phys. Rev. Appl."},{"key":"4655_CR9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.4.033029","volume":"4","author":"L Zhu","year":"2022","unstructured":"Zhu, L., Tang, H.L., Barron, G.S., et al.: Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer. Phys. Rev. Res. 4, 033029 (2022). https:\/\/doi.org\/10.1103\/PhysRevResearch.4.033029","journal-title":"Phys. Rev. Res."},{"key":"4655_CR10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.10.021067","volume":"10","author":"L Zhou","year":"2020","unstructured":"Zhou, L., Wang, S.T., Choi, S., et al.: Quantum approximate optimization algorithm: performance, mechanism, and implementation on near-term devices. Phys. Rev. X 10, 021067 (2020). https:\/\/doi.org\/10.1103\/PhysRevX.10.021067","journal-title":"Phys. Rev. X"},{"key":"4655_CR11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.97.022304","volume":"97","author":"Z Wang","year":"2018","unstructured":"Wang, Z., Hadfield, S., Jiang, Z., et al.: Quantum approximate optimization algorithm for maxcut: a fermionic view. Phys. Rev. A 97, 022304 (2018). https:\/\/doi.org\/10.1103\/PhysRevA.97.022304","journal-title":"Phys. Rev. A"},{"key":"4655_CR12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.7.021027","volume":"7","author":"ZC Yang","year":"2017","unstructured":"Yang, Z.C., Rahmani, A., Shabani, A., et al.: Optimizing variational quantum algorithms using Pontryagin\u2019s minimum principle. Phys. Rev. X 7, 021027 (2017). https:\/\/doi.org\/10.1103\/PhysRevX.7.021027","journal-title":"Phys. Rev. X"},{"issue":"41","key":"4655_CR13","doi-asserted-by":"publisher","first-page":"25396","DOI":"10.1073\/pnas.2006373117","volume":"117","author":"G Pagano","year":"2020","unstructured":"Pagano, G., Bapat, A., Becker, P., et al.: Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator. Proc. Natl. Acad. Sci. 117(41), 25396\u201325401 (2020). https:\/\/doi.org\/10.1073\/pnas.2006373117","journal-title":"Proc. Natl. Acad. Sci."},{"key":"4655_CR14","unstructured":"Crooks, G.E.: Performance of the quantum approximate optimization algorithm on the maximum cut problem (2018). arXiv arXiv:1811.08419 [quant-ph]"},{"key":"4655_CR15","doi-asserted-by":"publisher","first-page":"6903","DOI":"10.1038\/s41598-019-43176-9","volume":"9","author":"GG Guerreschi","year":"2019","unstructured":"Guerreschi, G.G., Matsuura, A.Y.: QAOA for max-cut requires hundreds of qubits for quantum speed-up. Sci. Rep. 9, 6903 (2019). https:\/\/doi.org\/10.1038\/s41598-019-43176-9","journal-title":"Sci. Rep."},{"key":"4655_CR16","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s11128-020-02748-9","volume":"19","author":"ME Morales","year":"2020","unstructured":"Morales, M.E., Biamonte, D.J., Zimbor\u00e1s, S., et al.: On the universality of the quantum approximate optimization algorithm. Quantum Inf. Process. 19, 291 (2020). https:\/\/doi.org\/10.1007\/s11128-020-02748-9","journal-title":"Quantum Inf. Process."},{"key":"4655_CR17","unstructured":"Niu, M.Y., Lu, S., Chuang, I.L.: Optimizing QAOA: success probability and runtime dependence on circuit depth (2019). arXiv arXiv:1905.12134 [quant-ph]"},{"key":"4655_CR18","unstructured":"Lloyd, S.: Quantum approximate optimization is computationally universal (2018). arXiv arXiv:1812.11075 [quant-ph]"},{"key":"4655_CR19","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.2.017001","volume":"2","author":"Y Alexeev","year":"2021","unstructured":"Alexeev, Y., Bacon, D., Brown, K.R., et al.: Quantum computer systems for scientific discovery. PRX Quantum 2, 017001 (2021). https:\/\/doi.org\/10.1103\/PRXQuantum.2.017001","journal-title":"PRX Quantum"},{"key":"4655_CR20","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":"4655_CR21","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s11128-021-03001-7","volume":"20","author":"Ostrowski R Herrman","year":"2021","unstructured":"Herrman, Ostrowski R., Humble, J., et al.: Lower bounds on circuit depth of the quantum approximate optimization algorithm. Quantum Inf. Process. 20, 59 (2021). https:\/\/doi.org\/10.1007\/s11128-021-03001-7","journal-title":"Quantum Inf. Process."},{"key":"4655_CR22","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.3.010313","volume":"3","author":"Z Holmes","year":"2022","unstructured":"Holmes, Z., Sharma, K., Cerezo, M., et al.: Connecting ansatz expressibility to gradient magnitudes and barren plateaus. PRX Quantum 3, 010313 (2022). https:\/\/doi.org\/10.1103\/PRXQuantum.3.010313","journal-title":"PRX Quantum"},{"issue":"4","key":"4655_CR23","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ace54a","volume":"8","author":"P Chandarana","year":"2023","unstructured":"Chandarana, P., Vieites, P.S., Hegade, N.N., et al.: Meta-learning digitized-counterdiabatic quantum optimization. Quantum Sci. Technol. 8(4), 045007 (2023). https:\/\/doi.org\/10.1088\/2058-9565\/ace54a","journal-title":"Quantum Sci. Technol."},{"key":"4655_CR24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.2.043246","volume":"2","author":"D Wierichs","year":"2020","unstructured":"Wierichs, D., Gogolin, C., Kastoryano, M.: Avoiding local minima in variational quantum eigensolvers with the natural gradient optimizer. Phys. Rev. Res. 2, 043246 (2020). https:\/\/doi.org\/10.1103\/PhysRevResearch.2.043246","journal-title":"Phys. Rev. Res."},{"key":"4655_CR25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.125.260505","volume":"125","author":"S Bravyi","year":"2020","unstructured":"Bravyi, S., Kliesch, A., Koenig, R., et al.: Obstacles to variational quantum optimization from symmetry protection. Phys. Rev. Lett. 125, 260505 (2020). https:\/\/doi.org\/10.1103\/PhysRevLett.125.260505","journal-title":"Phys. Rev. Lett."},{"key":"4655_CR26","doi-asserted-by":"crossref","unstructured":"Alam, M.A., Ash-Saki, A., Ghosh, S.: Accelerating quantum approximate optimization algorithm using machine learning. In: 2020 Design, Automation and Test in Europe Conference and Exhibition (DATE), pp. 686\u2013689 (2020). https:\/\/api.semanticscholar.org\/CorpusID:211020994","DOI":"10.23919\/DATE48585.2020.9116348"},{"issue":"9","key":"4655_CR27","doi-asserted-by":"publisher","first-page":"2176","DOI":"10.3390\/math11092176","volume":"11","author":"X Lee","year":"2023","unstructured":"Lee, X., Xie, N., Cai, D., et al.: A depth-progressive initialization strategy for quantum approximate optimization algorithm. Mathematics 11(9), 2176 (2023). https:\/\/doi.org\/10.3390\/math11092176","journal-title":"Mathematics"},{"issue":"1","key":"4655_CR28","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/2595\/1\/012001","volume":"2595","author":"N Xie","year":"2023","unstructured":"Xie, N., Lee, X., Cai, D., et al.: Quantum approximate optimization algorithm parameter prediction using a convolutional neural network. J. Phys.: Conf. Ser. 2595(1), 012001 (2023). https:\/\/doi.org\/10.1088\/1742-6596\/2595\/1\/012001","journal-title":"J. Phys.: Conf. Ser."},{"key":"4655_CR29","doi-asserted-by":"publisher","first-page":"491","DOI":"10.22331\/q-2021-07-01-491","volume":"5","author":"SH Sack","year":"2021","unstructured":"Sack, S.H., Serbyn, M.: Quantum annealing initialization of the quantum approximate optimization algorithm. Quantum 5, 491 (2021). https:\/\/doi.org\/10.22331\/q-2021-07-01-491","journal-title":"Quantum"},{"key":"4655_CR30","unstructured":"Verdon, G., Broughton, M., McClean, J.R., et\u00a0al.: Learning to learn with quantum neural networks via classical neural networks (2019). arXiv arXiv:1907.05415. https:\/\/api.semanticscholar.org\/CorpusID:195886305"},{"key":"4655_CR31","unstructured":"Amosy, O., Danzig, T., Porat, E., et\u00a0al.: Iterative-free quantum approximate optimization algorithm using neural networks (2022). arXiv https:\/\/api.semanticscholar.org\/CorpusID:251719266"},{"key":"4655_CR32","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.2.023074","volume":"2","author":"L Li","year":"2020","unstructured":"Li, L., Fan, M., Coram, M., et al.: Quantum optimization with a novel Gibbs objective function and ansatz architecture search. Phys. Rev. Res. 2, 023074 (2020). https:\/\/doi.org\/10.1103\/PhysRevResearch.2.023074","journal-title":"Phys. Rev. Res."},{"key":"4655_CR33","doi-asserted-by":"publisher","unstructured":"Kolotouros, I., Wallden, P.: Evolving objective function for improved variational quantum optimization. Phys. Rev. Res. 4, 023225 (2022). https:\/\/doi.org\/10.1103\/PhysRevResearch.4.023225","DOI":"10.1103\/PhysRevResearch.4.023225"},{"issue":"1","key":"4655_CR34","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/TNN.2008.2005605","volume":"20","author":"F Scarselli","year":"2009","unstructured":"Scarselli, F., Gori, M., Tsoi, A.C., et al.: The graph neural network model. IEEE Trans. Neural Netw. 20(1), 61\u201380 (2009). https:\/\/doi.org\/10.1109\/TNN.2008.2005605","journal-title":"IEEE Trans. Neural Netw."},{"key":"4655_CR35","doi-asserted-by":"publisher","first-page":"861","DOI":"10.22331\/q-2022-11-17-861","volume":"6","author":"N Jain","year":"2022","unstructured":"Jain, N., Coyle, B., Kashefi, E., et al.: Graph neural network initialisation of quantum approximate optimisation. Quantum 6, 861 (2022). https:\/\/doi.org\/10.22331\/q-2022-11-17-861","journal-title":"Quantum"},{"key":"4655_CR36","volume-title":"Quantum Computation and Quantum Information: 10th Anniversary Edition","author":"MA Nielsen","year":"2011","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition, 10th edn. Cambridge University Press, USA (2011)","edition":"10"},{"issue":"6","key":"4655_CR37","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. JACM 42(6), 1115\u20131145 (1995). https:\/\/doi.org\/10.1145\/227683.227684","journal-title":"JACM"},{"key":"4655_CR38","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10479-022-04634-2","volume":"314","author":"F Glover","year":"2022","unstructured":"Glover, F.: Quantum bridge analytics i: a tutorial on formulating and using QUBO models. Ann. Oper. Res. 314, 141\u2013183 (2022). https:\/\/doi.org\/10.1007\/s10479-022-04634-2","journal-title":"Ann. Oper. Res."},{"issue":"6","key":"4655_CR39","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/3065386","volume":"60","author":"A Krizhevsky","year":"2017","unstructured":"Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. Commun. ACM 60(6), 84\u201390 (2017). https:\/\/doi.org\/10.1145\/3065386","journal-title":"Commun. ACM"},{"key":"4655_CR40","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.orl.2011.03.004","volume":"39","author":"AEB Lim","year":"2011","unstructured":"Lim, A.E.B., Shanthikumar, J.G., Vahn, G.Y.: Conditional value-at-risk in portfolio optimization: coherent but fragile. Oper. Res. Lett. 39, 163\u2013171 (2011)","journal-title":"Oper. Res. Lett."},{"key":"4655_CR41","unstructured":"Cross, A.W.: The IBM q experience and QISKIT open-source quantum computing software. Bull. Am. Phys. Soc. L58.003 (2018)"},{"key":"4655_CR42","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs, Cambridge Studies in Advanced Mathematics","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs, Cambridge Studies in Advanced Mathematics, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"4655_CR43","doi-asserted-by":"crossref","unstructured":"Hagberg, A.A., Schult, D.A., Swart, P., et\u00a0al.: Exploring network structure, dynamics, and function using networkx. In: Proceedings of the Python in Science Conference (2008). https:\/\/api.semanticscholar.org\/CorpusID:16050699","DOI":"10.25080\/TCWV9851"},{"key":"4655_CR44","doi-asserted-by":"publisher","first-page":"567","DOI":"10.22331\/q-2021-10-20-567","volume":"5","author":"J Gacon","year":"2021","unstructured":"Gacon, J., Zoufal, C., Carleo, G., et al.: Simultaneous perturbation stochastic approximation of the quantum fisher information. Quantum 5, 567 (2021). https:\/\/doi.org\/10.22331\/q-2021-10-20-567","journal-title":"Quantum"},{"key":"4655_CR45","unstructured":"Agarap, A.F.: Deep learning using rectified linear units (RELU). arXiv arXiv:1803.08375. https:\/\/api.semanticscholar.org\/CorpusID:4090379 (2018)"},{"key":"4655_CR46","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1038\/s42254-022-00440-8","volume":"4","author":"N Mohseni","year":"2022","unstructured":"Mohseni, N., McMahon, P.L., Byrnes, T.: Ising machines as hardware solvers of combinatorial optimization problems. Nat. Rev. Phys. 4, 363\u2013379 (2022)","journal-title":"Nat. Rev. Phys."},{"key":"4655_CR47","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/ac175d","volume":"23","author":"T Korten","year":"2021","unstructured":"Korten, T., Diez, S., Linke, H., et al.: Design of network-based biocomputation circuits for the exact cover problem. New J. Phys. 23, 085004 (2021)","journal-title":"New J. Phys."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04655-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-025-04655-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-04655-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T00:00:25Z","timestamp":1742169625000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-025-04655-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,24]]},"references-count":47,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,2]]}},"alternative-id":["4655"],"URL":"https:\/\/doi.org\/10.1007\/s11128-025-04655-3","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-4460928\/v1","asserted-by":"object"}]},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,24]]},"assertion":[{"value":"22 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"37"}}