{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T05:17:02Z","timestamp":1730265422060,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"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":[[2019,10]]},"DOI":"10.1109\/igsc48788.2019.8957201","type":"proceedings-article","created":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T01:09:21Z","timestamp":1579050561000},"page":"1-6","source":"Crossref","is-referenced-by-count":38,"title":["Evaluating Quantum Approximate Optimization Algorithm: A Case Study"],"prefix":"10.1109","author":[{"given":"Ruslan","family":"Shaydulin","sequence":"first","affiliation":[]},{"given":"Yuri","family":"Alexeev","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"arXiv preprint arXiv 1906 03008","article-title":"Quantum annealing: a journey through digitalitalization, control, and hybrid quantum variational schemes","year":"2019","author":"mbeng","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.99.013304"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"journal-title":"Séminaire du Group POC LIP6 de Sorbonne Université","article-title":"The Max-Cut problem: Challenges from quantum computing","year":"0","author":"rinaldi","key":"ref13"},{"journal-title":"The BOBYQA algorithm for bound constrained optimization without derivatives","first-page":"26","year":"2009","author":"powell","key":"ref14"},{"journal-title":"The NLopt Nonlinear-optimization Package","year":"2019","author":"johnson","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2019.8916288"},{"key":"ref17","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"erd\u00f6s","year":"1960","journal-title":"Publ Math Inst Hung Acad Sci"},{"journal-title":"Qiskit An open-source framework for quantum computing","year":"2019","author":"aleksandrowicz","key":"ref18"},{"key":"ref19","first-page":"11","article-title":"Exploring network structure, dynamics, and function using NetworkX","author":"hagberg","year":"2008","journal-title":"Proceedings of the 7th Python in Science Conference (SciPy2008)"},{"journal-title":"Proc 3rd Int Workshop on Post Moore’s Era Supercomputing","article-title":"Community detection across emerging quantum architectures","year":"2018","author":"shaydulin","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/qute.201900029"},{"journal-title":"arXiv 1811 08419","article-title":"Performance of the quantum approximate optimization algorithm on the maximum cut problem","year":"2018","author":"crooks","key":"ref6"},{"journal-title":"arXiv preprint arXiv 1907 09977","article-title":"Improving variational quantum optimization using cvar","year":"2019","author":"barkoutsos","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.97.022304"},{"journal-title":"arXiv 1812 01041","article-title":"Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices","year":"2018","author":"zhou","key":"ref7"},{"journal-title":"arXiv 1412 6062","article-title":"A quantum approximate optimization algorithm applied to a bounded occurrence constraint problem","year":"2014","author":"farhi","key":"ref2"},{"journal-title":"arXiv 1411 4028","article-title":"A quantum approximate optimization algorithm","year":"2014","author":"farhi","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"journal-title":"GNU Parallel 2018","year":"2018","author":"tange","key":"ref20"},{"journal-title":"Erd?os-rényi random graph generator – NetworkX","year":"0","key":"ref22"},{"journal-title":"arXiv 1812 04170","article-title":"For ?xed control parameters the quantum approximate optimization algorithm’s objective function value concentrates for typical instances","year":"2018","author":"brandao","key":"ref21"},{"key":"ref24","article-title":"Reinforcement learning for quantum approximate optimization","volume":"19","author":"khairy","year":"2019","journal-title":"Research Poster accepted at Supercomputing"},{"journal-title":"Accepted for Poster Presentation at the Machine Learning and the Physical Sciences workshop at Conference on Neural Information Processing Systems (NeurIPS 2019)","article-title":"Reinforcement-learning-based variational quantum circuits optimization for combinatorial problems","year":"2019","author":"khairy","key":"ref23"}],"event":{"name":"2019 Tenth International Green and Sustainable Computing Conference (IGSC)","start":{"date-parts":[[2019,10,21]]},"location":"Alexandria, VA, USA","end":{"date-parts":[[2019,10,24]]}},"container-title":["2019 Tenth International Green and Sustainable Computing Conference (IGSC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8954738\/8957161\/08957201.pdf?arnumber=8957201","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T21:46:48Z","timestamp":1658094408000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8957201\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":24,"URL":"http:\/\/dx.doi.org\/10.1109\/igsc48788.2019.8957201","relation":{},"subject":[],"published":{"date-parts":[[2019,10]]}}}
