{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:30:25Z","timestamp":1740101425051,"version":"3.37.3"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,11,26]],"date-time":"2022-11-26T00:00:00Z","timestamp":1669420800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,26]],"date-time":"2022-11-26T00:00:00Z","timestamp":1669420800000},"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":[[2022,11,26]]},"DOI":"10.1109\/iscmi56532.2022.10068445","type":"proceedings-article","created":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T19:49:06Z","timestamp":1679428146000},"page":"86-90","source":"Crossref","is-referenced-by-count":0,"title":["Evaluating the performance of the Quantum Approximate Optimisation Algorithm to solve the Quadratic Assignment Problem"],"prefix":"10.1109","author":[{"given":"M. T.","family":"Khumalo","sequence":"first","affiliation":[{"name":"School of Computer Science and Applied Mathematics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Prag","sequence":"additional","affiliation":[{"name":"School of Computer Science and Applied Mathematics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5391-8147","authenticated-orcid":false,"given":"K. J.","family":"Nixon","sequence":"additional","affiliation":[{"name":"School of Electrical and Information Engineering, University of the Witwatersrand,Johannesburg,South Africa"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"A quantum approximate optimization algorithm","author":"Farhi","year":"2014","journal-title":"arXiv preprint"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms5213"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISCMI51676.2020.9311605"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-022-07438-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304023"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321975"},{"issue":"1","key":"ref7","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","article-title":"Assignment problems and the location of economic activities","volume":"25","author":"Koopmans","year":"1957","journal-title":"Econometrica"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.energy.2019.04.186"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0303-9_27"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1038\/npjqi.2015.23"},{"key":"ref11","article-title":"Quantum algorithms for fixed qubit architectures","author":"Farhi","year":"2017","journal-title":"arXiv preprint"},{"key":"ref12","article-title":"Performance of the quantum approximate optimization algorithm on the maximum cut problem","author":"Crooks","year":"2018","journal-title":"arXiv preprint"},{"key":"ref13","article-title":"Max-cut clustering utilizing warm-start QAOA and IBM runtime","author":"Beaulieu","year":"2021","journal-title":"arXiv preprint"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1063\/1.5141458"},{"key":"ref15","article-title":"The quantum approximate optimization algorithm needs to see the whole graph: a typical case","author":"Farhi","year":"2020","journal-title":"arXiv preprint"},{"volume-title":"Learn quantum computation using qiskit","year":"2020","author":"Asfaw","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2014.00005"},{"issue":"6","key":"ref18","first-page":"1","article-title":"The Ising model is NP-complete","volume":"33","author":"Cipra","year":"2000","journal-title":"SIAM News"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.10.021067"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.1987.4789489"},{"issue":"1","key":"ref21","first-page":"1936","article-title":"AM Turing. On computable numbers, with an application to the Entscheidungs problem","volume-title":"Proceedings of the London Mathematical Society, 2 s","volume":"42","author":"Church","year":"1937"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300921"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27737-5_428-3"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1985.0070"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.79.325"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1126\/science.1252319"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598347011"},{"volume-title":"Qiskit: An open-source framework for quantum computing","year":"2021","author":"A","key":"ref28"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.100.032328"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-021-00464-5"},{"volume-title":"Gleipnir: Toward practical error analysis for quantum programs (extended version)","year":"2021","author":"Tao","key":"ref31"}],"event":{"name":"2022 9th International Conference on Soft Computing & Machine Intelligence (ISCMI)","start":{"date-parts":[[2022,11,26]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2022,11,27]]}},"container-title":["2022 9th International Conference on Soft Computing & Machine Intelligence (ISCMI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10068346\/10068435\/10068445.pdf?arnumber=10068445","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T13:30:11Z","timestamp":1707831011000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10068445\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,26]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/iscmi56532.2022.10068445","relation":{},"subject":[],"published":{"date-parts":[[2022,11,26]]}}}