{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T12:38:39Z","timestamp":1768567119306,"version":"3.49.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.23919\/date48585.2020.9116348","type":"proceedings-article","created":{"date-parts":[[2020,6,15]],"date-time":"2020-06-15T19:28:37Z","timestamp":1592249317000},"page":"686-689","source":"Crossref","is-referenced-by-count":36,"title":["Accelerating Quantum Approximate Optimization Algorithm using Machine Learning"],"prefix":"10.23919","author":[{"given":"Mahabubul","family":"Alam","sequence":"first","affiliation":[]},{"given":"Abdullah","family":"Ash-Saki","sequence":"additional","affiliation":[]},{"given":"Swaroop","family":"Ghosh","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Scipy: Open source scientific tools for python, 2001","author":"jones","year":"2016"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cpc.2012.11.019"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"key":"ref13","article-title":"Networkx","year":"2010","journal-title":"networkx lanl gov"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02985802","article-title":"The elements of statistical learning: data mining, inference and prediction","volume":"27","author":"hastie","year":"2005","journal-title":"The Mathematical Intelligencer"},{"key":"ref15","article-title":"Matlab and statistics and machine learning toolbox, release 2017a","author":"mathworks","year":"2017"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-08-06-79"},{"key":"ref3","article-title":"Quantum supremacy through the quantum approximate optimization algorithm","author":"farhi","year":"0"},{"key":"ref6","article-title":"Performance of the quantum approximate optimization algorithm on the maximum cut problem","author":"crooks","year":"2018"},{"key":"ref5","article-title":"Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices","author":"zhou","year":"2018"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.94.022309"},{"key":"ref7","article-title":"Optimizing quantum heuristics with meta-learning","author":"wilson","year":"2019"},{"key":"ref2","article-title":"Quantum algorithms for fixed qubit architectures","author":"farhi","year":"2017"},{"key":"ref9","article-title":"Training the quantum approximate optimization algorithm without access to a quantum processing unit","author":"streif","year":"2019"},{"key":"ref1","article-title":"A quantum approximate optimization algorithm","author":"farhi","year":"2014"}],"event":{"name":"2020 Design, Automation & Test in Europe Conference & Exhibition (DATE)","location":"Grenoble, France","start":{"date-parts":[[2020,3,9]]},"end":{"date-parts":[[2020,3,13]]}},"container-title":["2020 Design, Automation & Test in Europe Conference & Exhibition (DATE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9112295\/9116186\/09116348.pdf?arnumber=9116348","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T18:43:18Z","timestamp":1594665798000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9116348\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":15,"URL":"https:\/\/doi.org\/10.23919\/date48585.2020.9116348","relation":{},"subject":[],"published":{"date-parts":[[2020,3]]}}}