{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:32:26Z","timestamp":1758274346403,"version":"3.37.3"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T00:00:00Z","timestamp":1600732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T00:00:00Z","timestamp":1600732800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T00:00:00Z","timestamp":1600732800000},"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":[[2020,9,22]]},"DOI":"10.1109\/hpec43674.2020.9286230","type":"proceedings-article","created":{"date-parts":[[2020,12,22]],"date-time":"2020-12-22T21:07:15Z","timestamp":1608671235000},"page":"1-6","source":"Crossref","is-referenced-by-count":7,"title":["Constrained-optimization Approach Delivers Superior Classical Performance for Graph Partitioning via Quantum-ready Method"],"prefix":"10.1109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1311-3827","authenticated-orcid":false,"given":"Uchenna","family":"Chukwu","sequence":"first","affiliation":[]},{"given":"Raouf","family":"Dridi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4741-2427","authenticated-orcid":false,"given":"Jesse","family":"Berwald","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Booth","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7665-5749","authenticated-orcid":false,"given":"John","family":"Dawson","sequence":"additional","affiliation":[]},{"given":"DeYung","family":"Le","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Wainger","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4355-6693","authenticated-orcid":false,"given":"Steven P.","family":"Reinhardt","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/18\/2\/023023"},{"journal-title":"Auto-encoding variational bayes","year":"2013","author":"kingma","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/9.119632"},{"journal-title":"Partitioning optimization problems forhybrid classical\/quantum execution","year":"2017","author":"michael","key":"ref13"},{"journal-title":"QCI Qbsolv Delivers Strong Classical Performance for Quantum-Ready Formulation","year":"2020","author":"booth","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/net.21751"},{"journal-title":"node2vec Scalable feature learning for networks","year":"2016","author":"grover","key":"ref16"},{"journal-title":"Minimizing polynomial functions on quantum computers","year":"2019","author":"dridi","key":"ref17"},{"journal-title":"Next-Generation Topology of D- Wave Quantum Processors","year":"2020","author":"boothby","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3310273.3321562"},{"key":"ref4","article-title":"A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices","author":"karypis","year":"1998","journal-title":"Technical report Minneapolis MN University of Minnesota Department of Computer Science and Engineering Army HPC Research Center"},{"journal-title":"Detecting multiple communities using quantum annealing on the D-Wave system","year":"2019","author":"negre","key":"ref3"},{"journal-title":"Multilevel combinatorial optimization across quantum architectures","year":"2017","author":"ushijima-mwesigwa","key":"ref6"},{"journal-title":"KaHIP v2 OO-Karlsruhe High Quality Partitioning User Guide","year":"2013","author":"sanders","key":"ref5"},{"journal-title":"The Graph Partitioning Archive","year":"0","author":"walshaw","key":"ref8"},{"key":"ref7","article-title":"Exploring network structure, dynamics, and function using NetworkX","author":"hagberg","year":"2008","journal-title":"Technical Report"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3149526.3149531"},{"journal-title":"A Quantum Approximate Optimization Algorithm","year":"2014","author":"farhi","key":"ref9"},{"key":"ref1","article-title":"Graph partitioning using the D-Wave for electronic structure problems","author":"mniszewski","year":"2016","journal-title":"Technical Report"},{"key":"ref20","doi-asserted-by":"crossref","DOI":"10.3390\/a12020034","article-title":"From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz","volume":"12","author":"hadfield","year":"2019","journal-title":"Algorithms"},{"key":"ref21","article-title":"X-29: Longitudinal instability at high angle-of-attack","volume":"953","author":"walchli","year":"1993","journal-title":"AD-A266412"}],"event":{"name":"2020 IEEE High Performance Extreme Computing Conference (HPEC)","start":{"date-parts":[[2020,9,22]]},"location":"Waltham, MA, USA","end":{"date-parts":[[2020,9,24]]}},"container-title":["2020 IEEE High Performance Extreme Computing Conference (HPEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9285977\/9286137\/09286230.pdf?arnumber=9286230","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T15:54:02Z","timestamp":1656345242000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9286230\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,22]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/hpec43674.2020.9286230","relation":{},"subject":[],"published":{"date-parts":[[2020,9,22]]}}}