{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T05:02:19Z","timestamp":1781672539217,"version":"3.54.5"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T00:00:00Z","timestamp":1714953600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T00:00:00Z","timestamp":1714953600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,5,6]]},"DOI":"10.23919\/ondm61578.2024.10582687","type":"proceedings-article","created":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T17:40:39Z","timestamp":1720719639000},"page":"1-6","source":"Crossref","is-referenced-by-count":9,"title":["Quantum Approximate Optimization Algorithm for Routing Optimization in 6G Optical Networks"],"prefix":"10.23919","author":[{"given":"Oumayma","family":"Bouchmal","sequence":"first","affiliation":[{"name":"Eindhoven University of Technology,Department of Electrical Engineering,Eindhoven,Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bruno","family":"Cimoli","sequence":"additional","affiliation":[{"name":"Eindhoven University of Technology,Department of Electrical Engineering,Eindhoven,Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ripalta","family":"Stabile","sequence":"additional","affiliation":[{"name":"Eindhoven University of Technology,Department of Electrical Engineering,Eindhoven,Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.J","family":"Vegas Olmos","sequence":"additional","affiliation":[{"name":"NVIDIA Corporation,Software Architecture,Yokneam,Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Idelfonso Tafur","family":"Monroy","sequence":"additional","affiliation":[{"name":"Eindhoven University of Technology,Department of Electrical Engineering,Eindhoven,Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MVT.2019.2921208"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.aej.2022.08.017"},{"key":"ref3","first-page":"7","article-title":"Algorithms for routing with multiple constraints","author":"Puri","year":"2002","journal-title":"AIPS-02"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3099092"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.001.1900476"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1088\/0034-4885\/61\/2\/002"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3041719"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.103.032430"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2909490"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3054833"},{"key":"ref11","article-title":"Combinatorial optimization on gate model quantum computers: A survey","author":"Zahedinejad","year":"2017","journal-title":"arXiv preprint"},{"key":"ref12","doi-asserted-by":"crossref","DOI":"10.1007\/11526216","volume-title":"Quantum annealing and related optimization methods","volume":"679","author":"Das","year":"2005"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/47\/50\/505302"},{"key":"ref14","article-title":"Quantum integer programming (quip) 47\u2013779: Lecture notes","author":"Bernal","year":"2020","journal-title":"arXiv preprint"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1038\/s42254-021-00348-9"},{"key":"ref16","article-title":"A quantum approximate optimization algorithm","author":"Farhi","year":"2014","journal-title":"arXiv preprint"},{"key":"ref17","article-title":"Performance of the quantum approximate optimization algorithm on the maximum cut problem","author":"Crooks","year":"2018","journal-title":"arXiv preprint"},{"key":"ref18","author":"Radzihovsky","year":"2019","journal-title":"A qaoa solution to the traveling salesman problem using pyquil"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2022.3172241"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2021.3049230"},{"key":"ref21","article-title":"The quantum approximate optimization algorithm needs to see the whole graph: Worst case examples","author":"Farhi","year":"2020","journal-title":"arXiv preprint"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1080\/00207729408928968"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/net.21751"},{"key":"ref24","article-title":"Quantum supremacy through the quantum approximate optimization algorithm","author":"Farhi","year":"2016","journal-title":"arXiv preprint"}],"event":{"name":"2024 International Conference on Optical Network Design and Modeling (ONDM)","location":"Madrid, Spain","start":{"date-parts":[[2024,5,6]]},"end":{"date-parts":[[2024,5,9]]}},"container-title":["2024 International Conference on Optical Network Design and Modeling (ONDM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10582547\/10582564\/10582687.pdf?arnumber=10582687","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T05:13:38Z","timestamp":1721279618000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10582687\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,6]]},"references-count":24,"URL":"https:\/\/doi.org\/10.23919\/ondm61578.2024.10582687","relation":{},"subject":[],"published":{"date-parts":[[2024,5,6]]}}}