{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T17:52:03Z","timestamp":1774374723224,"version":"3.50.1"},"reference-count":19,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100009534","name":"Universit\u00e4t Stuttgart","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100009534","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Comput. Sci."],"abstract":"<jats:p>Resource allocation of wide-area internet networks is inherently a combinatorial optimization problem that if solved quickly, could provide near real-time adaptive control of internet-protocol traffic ensuring increased network efficacy and robustness, while minimizing energy requirements coming from power-hungry transceivers. In recent works we demonstrated how such a problem could be cast as a quadratic unconstrained binary optimization (QUBO) problem that can be embedded onto the D-Wave Advantage\u2122 quantum annealer system, demonstrating proof of principle. Our initial studies left open the possibility for improvement of D-Wave solutions via judicious choices of system run parameters. Here we report on our investigations for optimizing these system parameters, and how we incorporate machine learning (ML) techniques to further improve on the quality of solutions. In particular, we use the Hamming distance to investigate correlations between various system-run parameters and solution vectors. We then apply a decision tree neural network (NN) to learn these correlations, with the goal of using the neural network to provide further guesses to solution vectors. We successfully implement this NN in a simple integer linear programming (ILP) example, demonstrating how the NN can fully map out the solution space that was not captured by D-Wave. We find, however, for the 3-node network problem the NN is not able to enhance the quality of space of solutions.<\/jats:p>","DOI":"10.3389\/fcomp.2024.1356983","type":"journal-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T17:17:38Z","timestamp":1718126258000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["ILP-based resource optimization realized by quantum annealing for optical wide-area communication networks\u2014A framework for solving combinatorial problems of a real-world application by quantum annealing"],"prefix":"10.3389","volume":"6","author":[{"given":"Arthur","family":"Witt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jangho","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"K\u00f6rber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Luu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1965","published-online":{"date-parts":[[2024,6,10]]},"reference":[{"key":"B1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-319-07557-0_2","article-title":"\u201cOn simplex pivoting rules and complexity theory,\u201d","author":"Adler","year":"2014","journal-title":"Integer Programming and Combinatorial Optimization"},{"key":"B2","volume-title":"Classification and Regression Trees","author":"Breiman","year":"1984"},{"key":"B3","volume-title":"Integer Programming from Quantum Annealing and Open Quantum Systems","author":"Chang","year":"2020"},{"key":"B4","first-page":"1","article-title":"\u201cEnergy-aware backbone networks: a case study,\u201d","volume-title":"2009 IEEE International Conference on Communications Workshops","author":"Chiaraviglio","year":"2009"},{"key":"B5","doi-asserted-by":"publisher","first-page":"2920","DOI":"10.1038\/ncomms2920","article-title":"Thermally assisted quantum annealing of a 16-qubit problem","volume":"4","author":"Dickson","year":"2013","journal-title":"Nat. Commun"},{"key":"B6","first-page":"20","article-title":"\u201cDelay-differentiated routing in meshed backbone networks,\u201d","volume-title":"Photonic Networks; 21th ITG-Symposium","author":"Enderle","year":"2020"},{"key":"B7","article-title":"\u201cAn optimization-heuristic approach to dynamic optical bypassing,\u201d","volume-title":"13th ITG Fachtagung on Photonic Networks","author":"Feller","year":"2012"},{"key":"B8","volume-title":"Recommendation ITU-T G.694.1, SERIES G: Transmission Systems and Media, Digital Systems and Networks Transmission Media and Optical Systems Characteristics\u2014Characteristics of Optical Systems; Spectral Grids for WDM Applications: DWDM Frequency Grid","year":"2020"},{"key":"B9","first-page":"85","volume-title":"Reducibility among Combinatorial Problems","author":"Karp","year":"1972"},{"key":"B10","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","article-title":"Integer programming with a fixed number of variables","volume":"8","author":"Lenstra","year":"1983","journal-title":"Math. Operat. Res"},{"key":"B11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/5992.814654","article-title":"The (Dantzig) simplex method for linear programming","volume":"2","author":"Nash","year":"2000","journal-title":"Comp. Sci. Eng"},{"key":"B12","first-page":"18","article-title":"\u201cThe computational complexity of integer programming with alternations,\u201d","volume":"6","author":"Nguyen","year":"2017","journal-title":"32nd Computational Complexity Conference (CCC 2017), number 6"},{"key":"B13","doi-asserted-by":"publisher","first-page":"2825","DOI":"10.48550\/arXiv.1201.0490","article-title":"Scikit-learn: machine learning in python","volume":"12","author":"Pedregosa","year":"2011","journal-title":"J. Mach. Learn. Res"},{"key":"B14","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2023.3319586","article-title":"Initial state encoding via reverse quantum annealing and h-gain features","author":"Pelofske","year":"2023","journal-title":"IEEE Transact. Quant. Eng"},{"key":"B15","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1109\/QCE53715.2022.00030","article-title":"\u201cFastHare: fast hamiltonian reduction for large-scale quantum annealing,\u201d","volume-title":"2022 IEEE International Conference on Quantum Computing and Engineering (QCE)","author":"Thai","year":"2022"},{"key":"B16","first-page":"1813","article-title":"\u201cWDM network optimization by ILP based on source formulation,\u201d","volume-title":"Proceedings. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, Volume 3","author":"Tornatore","year":"2002"},{"key":"B17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-022-03476-y","article-title":"Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems","volume":"21","author":"Willsch","year":"2022","journal-title":"Quant. Inf. Process"},{"key":"B18","doi-asserted-by":"crossref","DOI":"10.1109\/HPSR62440.2024.10636008","article-title":"\u201cQueue-aware network control algorithm with a high quantum computing readiness-evaluated in discrete-time flow simulator for fat-pipe networks,\u201d","volume-title":"IEEE 25th International Conference on High Performance Switching and Routing (HPSR) 2024","author":"Witt","year":"2024"},{"key":"B19","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1109\/QCE57702.2023.00082","article-title":"\u201cTactile network resource allocation enabled by quantum annealing based on ILP modeling,\u201d","volume-title":"2023 IEEE International Conference on Quantum Computing and Engineering (QCE)","author":"Witt","year":"2023"}],"container-title":["Frontiers in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fcomp.2024.1356983\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T16:21:12Z","timestamp":1732206072000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fcomp.2024.1356983\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":19,"alternative-id":["10.3389\/fcomp.2024.1356983"],"URL":"https:\/\/doi.org\/10.3389\/fcomp.2024.1356983","relation":{},"ISSN":["2624-9898"],"issn-type":[{"value":"2624-9898","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,10]]},"article-number":"1356983"}}