{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T23:17:48Z","timestamp":1761175068126,"version":"build-2065373602"},"reference-count":22,"publisher":"Polish Information Processing Society","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.15439\/2025f5496","type":"proceedings-article","created":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T07:44:23Z","timestamp":1761119063000},"page":"635-639","source":"Crossref","is-referenced-by-count":0,"title":["Adiabatic Quantum Computing for the Subset Sum Problem: Preliminary Studies"],"prefix":"10.15439","volume":"43","author":[{"given":"Cesar Freitas","family":"Bernardes","sequence":"first","affiliation":[{"name":"UFSC, Florianopolis"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Castellucci","sequence":"additional","affiliation":[{"name":"UFSC, Florianopolis"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas","family":"Gon\u00e7alves","sequence":"additional","affiliation":[{"name":"UFSC, Florianopolis"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Duzzioni","sequence":"additional","affiliation":[{"name":"UFSC, Florianopolis"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Mucherino","sequence":"additional","affiliation":[{"name":"IRISA, University of Rennes 1"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"6175","published-online":{"date-parts":[[2025,10,15]]},"reference":[{"key":"ref1","doi-asserted-by":"crossref","unstructured":"T. Albash, D.A. Lidar, Adiabatic Quantum Computation, Reviews of\nModern Physics 90(1), 015002, 2018.","DOI":"10.1103\/RevModPhys.90.015002"},{"key":"ref2","unstructured":"J. Allcock, Y. Hamoudi, A. Joux, F. Klingelh\u00f6fer, M. Santha, Classical\nand Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming, 30th Annual European Symposium on Algorithms (ESA22),\nSchloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, 28 pages, 2022."},{"key":"ref3","unstructured":"P. Austrin, P. Kaski, M. Koivisto, J. Nederlof, Dense Subset Sum\nMay Be the Hardest, Leibniz International Proceedings in Informatics,\n33rd Symposium on Theoretical Aspects of Computer Science, Article\nNo. 13, 13:1\u201313:14, 2016."},{"key":"ref4","doi-asserted-by":"crossref","unstructured":"D.J. Bernstein, S. Jeffery, T. Lange, A. Meurer, Quantum Algorithms for\nthe Subset Sum Problem. In: Post-Quantum Cryptography, Proceedings\n5, 16\u201333, 5th International Workshop PQCrypto 2013.","DOI":"10.1007\/978-3-642-38616-9_2"},{"key":"ref5","doi-asserted-by":"crossref","unstructured":"X. Bonnetain, R. Bricout, A. Schrottenloher, Y. Shen, Improved Classical and Quantum Algorithms for Subset-Sum, International Conference\non the Theory and Application of Cryptology and Information Security,\nSpringer International Publishing, 633\u2013666, 2020.","DOI":"10.1007\/978-3-030-64834-3_22"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"M.J. Coster, A. Joux, B.A. LaMacchia, A.M. Odlyzko, C.P. Schnorr,\nJ. Stern, Improved Low-density Subset Sum Algorithms, Computational\nComplexity 2, 111\u2013128, 1992.","DOI":"10.1007\/BF01201999"},{"key":"ref7","unstructured":"M.G. Damaceno, A. Mucherino, R. Medeiros de Ara\u00fajo, P.H. Souto\nRibeiro, N. Rubiano da Silva, Experimental Investigation of Optical Processing With Spatial Light Modulation, arXiv preprint https:\/\/arxiv.org\/abs\/2507.03821,\n2025."},{"key":"ref8","unstructured":"F. Glover, G. Kochenberger, Y. Du, A Tutorial on Formulating and Using\nQUBO Models, arXiv preprint https:\/\/arxiv.org\/abs\/1811.11538, 2018."},{"key":"ref9","doi-asserted-by":"crossref","unstructured":"A. Helm, A. May, The Power of few Qubits and Collisions\u2013Subset Sum\nbelow Grover\u2019s Bound, Springer International Publishing, International\nConference on Post-Quantum Cryptography, 445\u2013460. 2020.","DOI":"10.1007\/978-3-030-44223-1_24"},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"S.B. Hengeveld, N. Rubiano da Silva, D.S. Gon\u00e7alves, P.H. Souto\nRibeiro, A. Mucherino, An Optical Processor for Matrix-by-Vector\nMultiplication: an Application to the Distance Geometry Problem in\n1D, Journal of Optics 24(1), 015701, 2022.","DOI":"10.1088\/2040-8986\/ac3a9e"},{"key":"ref11","doi-asserted-by":"crossref","unstructured":"E. Horowitz, S. Sahni, Computing Partitions with Applications to the\nKnapsack Problem, Journal of the ACM (JACM) 21(2), 277\u2013292, 1974.","DOI":"10.1145\/321812.321823"},{"key":"ref12","doi-asserted-by":"crossref","unstructured":"R.M. Karp, Reducibility Among Combinatorial Problems. In:\nR.E. Miller, J.W. Thatcher, J.D. Bohlinger (Eds.), \u201cComplexity of\nComputer Computations\u201d. New York: Plenum. 85\u2013103, 1972.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref13","doi-asserted-by":"crossref","unstructured":"T. Kadowaki, H. Nishimori, Quantum Annealing in the Transverse Ising\nModel, Physical Review E, 58(5), 5355, 1998.","DOI":"10.1103\/PhysRevE.58.5355"},{"key":"ref14","doi-asserted-by":"crossref","unstructured":"S. Kirkpatrick, C.D. Gelatt, M.P Vecchi, Optimization by Simulated\nAnnealing, Science 220, 671\u2013680, 1983.","DOI":"10.1126\/science.220.4598.671"},{"key":"ref15","doi-asserted-by":"crossref","unstructured":"L. Liberti, C. Lavor, N. Maculan, A Branch-and-Prune Algorithm for\nthe Molecular Distance Geometry Problem, International Transactions\nin Operational Research 15, 1\u201317, 2008.","DOI":"10.1111\/j.1475-3995.2007.00622.x"},{"key":"ref16","doi-asserted-by":"crossref","unstructured":"L. Liberti, C. Lavor, N. Maculan, A. Mucherino, Euclidean Distance\nGeometry and Applications, SIAM Review 56(1), 3\u201369, 2014.","DOI":"10.1137\/120875909"},{"key":"ref17","doi-asserted-by":"crossref","unstructured":"A. Mucherino, C. Lavor, L. Liberti, The Discretizable Distance Geometry Problem, Optimization Letters 6(8), 1671\u20131686, 2012.","DOI":"10.1007\/s11590-011-0358-3"},{"key":"ref18","unstructured":"J. Salas, Beyond Worst-Case Subset Sum: An Adaptive, Structure-Aware\nSolver with Sub-2n\/2 Enumeration, arXiv preprint https:\/\/arxiv.org\/abs\/2503.20162,\n2025."},{"key":"ref19","unstructured":"C.P. Schnorr, T. Shevchenko, Solving Subset Sum Problems of Density\nclose to 1 by Randomized BKZ-Reduction, Cryptology ePrint Archive,\n5 pages, 2012."},{"key":"ref20","doi-asserted-by":"crossref","unstructured":"Q. Zheng, Y. Miaomiao, Z. Pingyu, W. Yan, L. Weihong, X. Ping,\nSolving the Subset Sum Problem by the Quantum Ising Model with\nVariational Quantum Optimization based on Conditional Values at Risk,\nScience China Physics, Mechanics & Astronomy 67(8), 280311, 2024.","DOI":"10.1007\/s11433-024-2385-7"},{"key":"ref21","unstructured":"D-Wave Systems Inc., Technical Description of the D-Wave Quantum\nProcessing Unit, https:\/\/docs.dwavesys.com, 2021."},{"key":"ref22","unstructured":"Gurobi Optimization, LLC, Gurobi Optimizer Reference Manual,\nhttps:\/\/www.gurobi.com, 2024."}],"event":{"name":"20th Conference on Computer Science and Intelligence Systems (FedCSIS)","theme":"Computer Science and Intelligence Systems","location":"Krak\u00f3w, Poland","acronym":"FedCSIS","number":"20","start":{"date-parts":[[2025,9,14]]},"end":{"date-parts":[[2025,9,17]]}},"container-title":["Annals of Computer Science and Information Systems","Proceedings of the 20th Conference on Computer Science and Intelligence Systems (FedCSIS)"],"original-title":[],"deposited":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T07:50:26Z","timestamp":1761119426000},"score":1,"resource":{"primary":{"URL":"https:\/\/annals-csis.org\/Volume_43\/drp\/5496.html"}},"subtitle":[],"proceedings-subject":"Computer Science and Information Systems","short-title":[],"issued":{"date-parts":[[2025,10,15]]},"references-count":22,"URL":"https:\/\/doi.org\/10.15439\/2025f5496","relation":{},"ISSN":["2300-5963"],"issn-type":[{"value":"2300-5963","type":"print"}],"subject":[],"published":{"date-parts":[[2025,10,15]]}}}