{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T02:05:35Z","timestamp":1779501935053,"version":"3.53.1"},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100008902","name":"Los Alamos National Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008902","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006502","name":"Defense Advanced Research Projects Agency Defense Sciences Office","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006502","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.orl.2026.107466","type":"journal-article","created":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T14:42:29Z","timestamp":1779028949000},"page":"107466","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Comparison of hyperplane rounding for max-cut and quantum approximate optimization algorithm over certain regular graph families"],"prefix":"10.1016","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9170-8906","authenticated-orcid":false,"given":"Reuben","family":"Tate","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9566-3856","authenticated-orcid":false,"given":"Swati","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2026.107466_bib0001","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","article-title":"Quantum supremacy using a programmable superconducting processor","volume":"574","author":"Arute","year":"2019","journal-title":"Nature"},{"key":"10.1016\/j.orl.2026.107466_bib0002","series-title":"Proceedings 35th Annual Symposium on Foundations of Computer Science","first-page":"124","article-title":"Algorithms for quantum computation: discrete logarithms and factoring","author":"Shor","year":"1994"},{"issue":"9","key":"10.1016\/j.orl.2026.107466_bib0003","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11128-021-03232-8","article-title":"Impact of graph structures for QAOA on MaxCut","volume":"20","author":"Herrman","year":"2021","journal-title":"Quantum Inf. Process."},{"issue":"2","key":"10.1016\/j.orl.2026.107466_bib0004","article-title":"Quantum approximate optimization algorithm: performance, mechanism, and implementation on near-term devices","volume":"10","author":"Zhou","year":"2020","journal-title":"Phys. Rev. X"},{"issue":"1","key":"10.1016\/j.orl.2026.107466_bib0005","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1140\/epjqt\/s40507-021-00114-x","article-title":"Industry quantum computing applications","volume":"8","author":"Bayerstadler","year":"2021","journal-title":"EPJ Quantum Technol."},{"key":"10.1016\/j.orl.2026.107466_bib0006","series-title":"2022 IEEE 19th International Conference on Software Architecture Companion (ICSA-C)","first-page":"141","article-title":"QAOA of the highest order","author":"Campbell","year":"2022"},{"key":"10.1016\/j.orl.2026.107466_bib0007","unstructured":"E. Farhi, A.W. Harrow, Quantum supremacy through the quantum approximate optimization algorithm, (2016). arXiv preprint arXiv: 1602.07674."},{"key":"10.1016\/j.orl.2026.107466_bib0008","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11128-021-03298-4","article-title":"Classical symmetries and the quantum approximate optimization algorithm","volume":"20","author":"Shaydulin","year":"2021","journal-title":"Quantum Inf. Process."},{"key":"10.1016\/j.orl.2026.107466_bib0009","unstructured":"E. Farhi, J. Goldstone, S. Gutmann, A quantum approximate optimization algorithm, (2014). arXiv preprint arXiv: 1411.4028."},{"issue":"3","key":"10.1016\/j.orl.2026.107466_bib0010","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1287\/ijoc.2017.0798","article-title":"What works best when? A systematic evaluation of heuristics for Max-Cut and QUBO","volume":"30","author":"Dunning","year":"2018","journal-title":"INFORMS J. Comput."},{"issue":"6","key":"10.1016\/j.orl.2026.107466_bib0011","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","article-title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming","volume":"42","author":"Goemans","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/j.orl.2026.107466_bib0012","doi-asserted-by":"crossref","first-page":"1769","DOI":"10.1137\/090773714","article-title":"Max cut and the smallest eigenvalue","volume":"41","author":"Trevisan","year":"2012","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.orl.2026.107466_bib0013","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1137\/14099098X","article-title":"Improved analysis of a max-cut algorithm based on spectral partitioning","volume":"29","author":"Soto","year":"2015","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"10.1016\/j.orl.2026.107466_bib0014","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","article-title":"Global optimization with polynomials and the problem of moments","volume":"11","author":"Lasserre","year":"2001","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.orl.2026.107466_bib0015","series-title":"Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization","author":"Parrilo","year":"2000"},{"key":"10.1016\/j.orl.2026.107466_bib0016","series-title":"Proceedings of the Thiry-fourth Annual ACM Symposium on Theory of Computing","first-page":"767","article-title":"On the power of unique 2-prover 1-round games","author":"Khot","year":"2002"},{"key":"10.1016\/j.orl.2026.107466_bib0017","series-title":"46th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201905)","first-page":"21","article-title":"Noise stability of functions with low influences: invariance and optimality","author":"Mossel","year":"2005"},{"issue":"1","key":"10.1016\/j.orl.2026.107466_bib0018","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1137\/S0097539705447372","article-title":"Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?","volume":"37","author":"Khot","year":"2007","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.orl.2026.107466_bib0019","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1137\/S0097539797321481","article-title":"How good is the Goemans\u2013Williamson MAX-CUT algorithm?","volume":"29","author":"Karloff","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.orl.2026.107466_bib0020","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.jctb.2018.04.005","article-title":"The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters","volume":"133","author":"Brouwer","year":"2018","journal-title":"J. Comb. Theory B"},{"issue":"21","key":"10.1016\/j.orl.2026.107466_bib0021","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevLett.112.210502","article-title":"Global symmetry is unnecessary for fast quantum search","volume":"112","author":"Janmark","year":"2014","journal-title":"Phys. Rev. Lett."},{"key":"10.1016\/j.orl.2026.107466_bib0022","article-title":"Bridging classical and quantum with SDP initialized warm-starts for QAOA","author":"Tate","year":"2022","journal-title":"ACM Trans. Quantum Comput."},{"key":"10.1016\/j.orl.2026.107466_bib0023","unstructured":"R. Tate, J. Moondra, B. Gard, G. Mohler, S. Gupta, Warm-started QAOA with custom mixers provably converges and computationally beats Goemans-Williamson\u2019s max-cut at low circuit depths, (2021). arXiv preprint arXiv: 2112.11354."},{"key":"10.1016\/j.orl.2026.107466_bib0024","doi-asserted-by":"crossref","first-page":"479","DOI":"10.22331\/q-2021-06-17-479","article-title":"Warm-starting quantum optimization","volume":"5","author":"Egger","year":"2021","journal-title":"Quantum"},{"key":"10.1016\/j.orl.2026.107466_bib0025","unstructured":"B. Augustino, M. Cain, E. Farhi, S. Gupta, S. Gutmann, D. Ranard, E. Tang, K. Van Kirk, Strategies for running the QAOA at hundreds of qubits, (2024). arXiv preprint arXiv: 2410.03015."},{"key":"10.1016\/j.orl.2026.107466_bib0026","first-page":"157","article-title":"Strongly regular graphs","volume":"38","author":"Seidel","year":"1979","journal-title":"Surv. Comb."},{"key":"10.1016\/j.orl.2026.107466_bib0027","doi-asserted-by":"crossref","first-page":"389","DOI":"10.2140\/pjm.1963.13.389","article-title":"Strongly regular graphs, partial geometries and partially balanced designs","volume":"13","author":"Bose","year":"1963","journal-title":"Pac. J. Math."},{"key":"10.1016\/j.orl.2026.107466_bib0028","series-title":"Convex Optimization","author":"Boyd","year":"2004"},{"issue":"6","key":"10.1016\/j.orl.2026.107466_bib0029","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1006\/eujc.2001.0507","article-title":"The pseudo-geometric graphs for generalized quadrangles of order (3, t)","volume":"22","author":"Haemers","year":"2001","journal-title":"Eur. J. Comb."},{"issue":"3","key":"10.1016\/j.orl.2026.107466_bib0030","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1021\/ed022p145","article-title":"Valence angle of the tetrahedral carbon atom","volume":"22","author":"Brittin","year":"1945","journal-title":"J. Chem. Educ."},{"key":"10.1016\/j.orl.2026.107466_bib0031","unstructured":"R. Tate, S. Gupta, CI-QuBe, GitHub repository (2021). https:\/\/github.com\/swati1729\/CI-QuBe."},{"issue":"2","key":"10.1016\/j.orl.2026.107466_bib0032","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevA.97.022304","article-title":"Quantum approximate optimization algorithm for MaxCut: a fermionic view","volume":"97","author":"Wang","year":"2018","journal-title":"Phys. Rev. A"},{"key":"10.1016\/j.orl.2026.107466_bib0033","unstructured":"B. Barak, K. Marwaha, Classical algorithms and quantum limitations for maximum cut on high-girth graphs, (2021). arXiv preprint arXiv: 2106.05900."},{"key":"10.1016\/j.orl.2026.107466_bib0034","unstructured":"E. Farhi, D. Gamarnik, S. Gutmann, The quantum approximate optimization algorithm needs to see the whole graph: worst case examples, (2020a). arXiv preprint arXiv: 2004.09002."},{"key":"10.1016\/j.orl.2026.107466_bib0035","unstructured":"E. Farhi, D. Gamarnik, S. Gutmann, The quantum approximate optimization algorithm needs to see the whole graph: a typical case, (2020b). arXiv preprint arXiv: 2004.09002."},{"issue":"4","key":"10.1016\/j.orl.2026.107466_bib0036","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3005345","article-title":"BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems","volume":"43","author":"Krislock","year":"2017","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637726000635?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637726000635?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T01:36:27Z","timestamp":1779500187000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637726000635"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":36,"alternative-id":["S0167637726000635"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2026.107466","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Comparison of hyperplane rounding for max-cut and quantum approximate optimization algorithm over certain regular graph families","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.orl.2026.107466","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107466"}}