{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T10:14:15Z","timestamp":1774520055621,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T00:00:00Z","timestamp":1774483200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T00:00:00Z","timestamp":1774483200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Spanish Ministry of Economic Affairs and Digital Transformation; and to the Spanish National Cybersecurity Institute (INCIBE).","award":["PID 2021-123461 NB-C22 and by Grant MRR-MAETD-24-INCIBE-01"],"award-info":[{"award-number":["PID 2021-123461 NB-C22 and by Grant MRR-MAETD-24-INCIBE-01"]}]},{"DOI":"10.13039\/501100006382","name":"Universidad de Oviedo","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006382","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>We apply a standard encoding technique to reformulate Diophantine equations as polynomial unconstrained binary optimization (PUBO) problems and study their solvability using the quantum approximate optimization algorithm (QAOA).<\/jats:p>","DOI":"10.1007\/s11128-026-05143-y","type":"journal-article","created":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T08:55:15Z","timestamp":1774515315000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On finding PUBO problems on Diophantine equations"],"prefix":"10.1007","volume":"25","author":[{"given":"J. M.","family":"Hern\u00e1ndez C\u00e1ceres","sequence":"first","affiliation":[]},{"given":"I. F.","family":"R\u00faa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,26]]},"reference":[{"key":"5143_CR1","unstructured":"Matiyasevich, Y.V.: Enumerable sets are Diophantine, Doklady AN SSSR, 191:2 (1970), 279\u2013282 translated in: Soviet Math. Doklady, 11 (1970), 354-358"},{"key":"#cr-split#-5143_CR2.1","doi-asserted-by":"crossref","unstructured":"Matiyasevich, Y.V.: Diophantine representation of enumerable predicates, Izvestiya AN SSSR. Seriya Matematicheskaya, 35:1 (1971), 3-30. Translated in: Mathematics of the USSR. Izvestiya, 15","DOI":"10.1070\/IM1971v005n01ABEH001004"},{"key":"#cr-split#-5143_CR2.2","unstructured":"(1) (1971), 1-28. Adiabatic quantum computation is equivalent to standard quantum computation, Proceedings of the 45th Annual ACM Symposium on Theory of Computing, 2004, pp. 42-51"},{"key":"5143_CR3","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm (2014)"},{"issue":"5\u20136","key":"5143_CR4","first-page":"343","volume":"219","author":"E Farhi","year":"1994","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Quantum computation by adiabatic evolution. Chem. Phys. Lett. 219(5\u20136), 343\u2013348 (1994)","journal-title":"Chem. Phys. Lett."},{"key":"5143_CR5","unstructured":"Combarro, E. F., Gonz\u00e1lez-Castillo, S.: A Practical Guide to Quantum Machine Learning and Quantum Optimization: Hands-on Approach to Modern Quantum Algorithms, Packt Publishing (2023)"},{"key":"5143_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2024.03.002","volume":"1068","author":"K Blekos","year":"2024","unstructured":"Blekos, K., Brand, D., Ceschini, A., Chou, C.-H., Li, R.-H., Pandya, K., Summer, A.: A review on quantum approximate optimization algorithm and its variants. Phys. Rep. 1068, 1\u201366 (2024). https:\/\/doi.org\/10.1016\/j.physrep.2024.03.002","journal-title":"Phys. Rep."},{"key":"5143_CR7","unstructured":"Davenport, H.: Multiplicative Number Theory, Springer, Berlin (2000)"},{"key":"5143_CR8","unstructured":"Apostol, T.M.: Introduction to Analytic Number Theory, Springer, Berlin"},{"key":"5143_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/9781108178266","volume-title":"Equivalents of the Riemann Hypothesis. Arithmetic Equivalents","author":"K Broughan","year":"2017","unstructured":"Broughan, K.: Equivalents of the Riemann Hypothesis. Arithmetic Equivalents, vol. 1. Cambridge University Press, Cambridge (2017)"},{"key":"5143_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/9781108178266","volume-title":"Equivalents of the Riemann Hypothesis. Analytic Equivalents","author":"K Broughan","year":"2017","unstructured":"Broughan, K.: Equivalents of the Riemann Hypothesis. Analytic Equivalents, vol. 2. Cambridge University Press, Cambridge (2017). https:\/\/doi.org\/10.1017\/9781108178266"},{"key":"5143_CR11","doi-asserted-by":"crossref","unstructured":"Davis, M., Matiyasevich, Y.V., Robinson, J.: Hilbert\u2019s tenth problem. Diophantine equations: positive aspects of a negative solution. In: Proceedings of Symposia in Pure Maths, vol. 28, pp. 323\u2013378 (1976)","DOI":"10.1090\/pspum\/028.2\/0432534"},{"key":"5143_CR12","doi-asserted-by":"crossref","unstructured":"Davis, M.: Hilbert\u2019s Tenth Problem is Unsolvable, The American Mathematical Monthly, Vol 80, No 3, pp. 233\u2013269 (1973). Available at http:\/\/www.jstor.org\/stable\/2318447","DOI":"10.1080\/00029890.1973.11993265"},{"key":"5143_CR13","doi-asserted-by":"publisher","first-page":"337","DOI":"10.2307\/2005976","volume":"30","author":"L Schoenfield","year":"1976","unstructured":"Schoenfield, L.: Sharper bounds for the Chebyshev function $$\\psi (x)$$ and $$\\vartheta (x)$$. Math. Comput. 30, 337\u2013360 (1976)","journal-title":"Math. Comput."},{"key":"5143_CR14","unstructured":"Hern\u00e1ndez C\u00e1ceres, J.M.: The Riemann Hypothesis and Diophantine Equations, Master\u2019s Thesis Mathematics, Mathematical Institute, University of Bonn (2018)"},{"key":"5143_CR15","unstructured":"Moroz, B. Z.: The Riemann hypothesis and the Diophantine equations, Preprint no. 2018-03 (St. Petersburg Math. Soc., St. Petersburg, 2018) [in Russian]"},{"issue":"Suppl 2","key":"5143_CR16","doi-asserted-by":"publisher","first-page":"S256","DOI":"10.1134\/S1064562422700247","volume":"106","author":"YV Matiyasevich","year":"2022","unstructured":"Matiyasevich, Y.V.: The Riemann hypothesis as the parity of special binomial coefficients. Dokl. Math. 106(Suppl 2), S256\u2013S261 (2022). https:\/\/doi.org\/10.1134\/S1064562422700247","journal-title":"Dokl. Math."},{"issue":"3","key":"5143_CR17","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1134\/S0001434620090047","volume":"108","author":"BZ Moroz","year":"2020","unstructured":"Moroz, B.Z., Norkin, A.A.: On a theorem of Matiyasevich. Math. Notes 108(3), 344\u2013355 (2020)","journal-title":"Math. Notes"},{"key":"5143_CR18","doi-asserted-by":"publisher","first-page":"428","DOI":"10.22331\/q-2021-04-08-428","volume":"5","author":"A Gilliam","year":"2021","unstructured":"Gilliam, A., Woerner, S., Gonciulea, C.: Grover adaptive search for constrained polynomial binary optimization. Quantum 5, 428 (2021)","journal-title":"Quantum"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-026-05143-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-026-05143-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-026-05143-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T08:55:21Z","timestamp":1774515321000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-026-05143-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,26]]},"references-count":19,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2026,4]]}},"alternative-id":["5143"],"URL":"https:\/\/doi.org\/10.1007\/s11128-026-05143-y","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,26]]},"assertion":[{"value":"19 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 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":"113"}}