{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T19:49:00Z","timestamp":1776109740536,"version":"3.50.1"},"reference-count":86,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T00:00:00Z","timestamp":1635206400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T00:00:00Z","timestamp":1635206400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100006195","name":"Ames Research Center","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006195","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["IAA 8839"],"award-info":[{"award-number":["IAA 8839"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["Annex 114"],"award-info":[{"award-number":["Annex 114"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NASA Academic Mission Services","award":["Contract NNA16BD14C"],"award-info":[{"award-number":["Contract NNA16BD14C"]}]},{"DOI":"10.13039\/100006224","name":"Argonne National Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006224","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006192","name":"Advanced Scientific Computing Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006192","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s11128-021-03298-4","type":"journal-article","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T08:05:47Z","timestamp":1635235547000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":55,"title":["Classical symmetries and the Quantum Approximate Optimization Algorithm"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8657-2848","authenticated-orcid":false,"given":"Ruslan","family":"Shaydulin","sequence":"first","affiliation":[]},{"given":"Stuart","family":"Hadfield","sequence":"additional","affiliation":[]},{"given":"Tad","family":"Hogg","sequence":"additional","affiliation":[]},{"given":"Ilya","family":"Safro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,26]]},"reference":[{"issue":"1","key":"3298_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/jcss.1998.1605","volume":"58","author":"S Arora","year":"1999","unstructured":"Arora, S., Karger, D., Karpinski, M.: Polynomial time approximation schemes for dense instances of NP-hard problems. J. Comput. Syst. Sci. 58(1), 193\u2013210 (1999)","journal-title":"J. Comput. Syst. Sci."},{"issue":"7779","key":"3298_CR2","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","volume":"574","author":"F Arute","year":"2019","unstructured":"Arute, F., et al.: Quantum supremacy using a programmable superconducting processor. Nature 574(7779), 505\u2013510 (2019)","journal-title":"Nature"},{"key":"3298_CR3","unstructured":"Arute, F. et\u00a0al.: Quantum approximate optimization of non-planar graph problems on a planar superconducting processor. arXiv:2004.04197 (2020)"},{"key":"3298_CR4","unstructured":"Arving, V.: Lecture notes (2007). www.cmi.ac.in\/~ramprasad\/lecturenotes\/algcomp\/tillnow.pdf. [Online.]"},{"key":"3298_CR5","doi-asserted-by":"crossref","unstructured":"Babai, L\u00e1szl\u00f3: Graph isomorphism in quasipolynomial time. arXiv:1512.03547 (2015)","DOI":"10.1145\/2897518.2897542"},{"issue":"5","key":"3298_CR6","first-page":"1146","volume":"34","author":"K Balasubramanian","year":"1994","unstructured":"Balasubramanian, K.: Computer generation of automorphism groups of weighted graphs. J. Chem. Inf. Model. 34(5), 1146\u20131150 (1994)","journal-title":"J. Chem. Inf. Model."},{"issue":"1","key":"3298_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.3390\/sym10010029","volume":"10","author":"F Ball","year":"2018","unstructured":"Ball, F., Geyer-Schulz, A.: How symmetric are real-world graphs? A large-scale study. Symmetry 10(1), 29 (2018)","journal-title":"Symmetry"},{"issue":"5\u20136","key":"3298_CR8","first-page":"424","volume":"19","author":"A Bapat","year":"2019","unstructured":"Bapat, A., Jordan, S.: Bang-bang control as a design principle for classical and quantum optimization algorithms. Quantum Inf. Comput. 19(5\u20136), 424\u2013446 (2019)","journal-title":"Quantum Inf. Comput."},{"key":"3298_CR9","doi-asserted-by":"publisher","first-page":"256","DOI":"10.22331\/q-2020-04-20-256","volume":"4","author":"PK Barkoutsos","year":"2020","unstructured":"Barkoutsos, P.K., Nannicini, G., Robert, A., Tavernelli, I., Woerner, S.: Improving variational quantum optimization using cvar. Quantum 4, 256 (2020)","journal-title":"Quantum"},{"issue":"3","key":"3298_CR10","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: column generation for solving huge integer programs. Oper. Res. 46(3), 316\u2013329 (1998)","journal-title":"Oper. Res."},{"key":"3298_CR11","doi-asserted-by":"crossref","unstructured":"Ben-David, S., Childs, A.M., Gilyen, A., Kretschmer, W., Podder, S., Wang, D.: Symmetries, graph properties, and quantum speedups. arXiv:2006.12760 (2020)","DOI":"10.1109\/FOCS46700.2020.00066"},{"key":"3298_CR12","doi-asserted-by":"crossref","unstructured":"Berman, P., Karpinski, M.: On some tighter inapproximability results (extended abstract). In: Automata. Languages and Programming, pp. 200\u2013209. Springer, Berlin Heidelberg (1999)","DOI":"10.1007\/3-540-48523-6_17"},{"key":"3298_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608704","volume-title":"Algebraic Graph Theory","author":"N Biggs","year":"1974","unstructured":"Biggs, N.: Algebraic Graph Theory. Cambridge University Press, Cambridge (1974)"},{"issue":"4","key":"3298_CR14","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1016\/0196-6774(90)90013-5","volume":"11","author":"HL Bodlaender","year":"1990","unstructured":"Bodlaender, H.L.: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. J. Algorithms 11(4), 631\u2013643 (1990)","journal-title":"J. Algorithms"},{"key":"3298_CR15","doi-asserted-by":"crossref","unstructured":"Bravyi, S., Kliesch, A., Koenig, R., Tang, E.: Obstacles to state preparation and variational optimization from symmetry protection. arXiv:1910.08980 (2019)","DOI":"10.1103\/PhysRevLett.125.260505"},{"key":"3298_CR16","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.125.170504","author":"J Bringewatt","year":"2020","unstructured":"Bringewatt, J., Jarret, M.: Effective gaps are not effective: quasipolynomial classical simulation of obstructed stoquastic hamiltonians. Phys. Rev. Lett. (2020). https:\/\/doi.org\/10.1103\/physrevlett.125.170504","journal-title":"Phys. Rev. Lett."},{"key":"3298_CR17","doi-asserted-by":"crossref","unstructured":"B\u00e4rtschi, A., Eidenbenz, S.: Grover mixers for QAOA: shifting complexity from mixer design to state preparation. arXiv:2006.00354 (2020)","DOI":"10.1109\/QCE49297.2020.00020"},{"issue":"3","key":"3298_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"C-C Chang","year":"2011","unstructured":"Chang, C.-C., Lin, C.-J.: LIBSVM. ACM Trans. Intell. Syst. Technol. 2(3), 1\u201327 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"issue":"3","key":"3298_CR19","doi-asserted-by":"publisher","first-page":"035005","DOI":"10.1103\/RevModPhys.88.035005","volume":"88","author":"C-K Chiu","year":"2016","unstructured":"Chiu, C.-K., Teo, J.C.Y., Schnyder, A.P., Ryu, S.: Classification of topological quantum matter with symmetries. Rev. Mod. Phys. 88(3), 035005 (2016)","journal-title":"Rev. Mod. Phys."},{"key":"3298_CR20","unstructured":"Crooks, G.E.: Performance of the quantum approximate optimization algorithm on the maximum cut problem. arXiv:1811.08419 (2018)"},{"issue":"1","key":"3298_CR21","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1002\/jgt.20602","volume":"70","author":"P Dankelmann","year":"2012","unstructured":"Dankelmann, P., Erwin, D., Mukwembi, S., Rodrigues, B.G., Mwambene, E., Sabidussi, G.: Automorphism group and diameter of a graph. J. Graph Theory 70(1), 80\u201391 (2012)","journal-title":"J. Graph Theory"},{"key":"3298_CR22","doi-asserted-by":"crossref","unstructured":"Darga, P.T., Liffiton, M.H., Sakallah, K.A., Markov, I.L.: Exploiting structure in symmetry detection for CNF. In: Proceedings of the 41st Annual Design Automation Conference (2004)","DOI":"10.1145\/996566.996712"},{"key":"3298_CR23","unstructured":"Drucker, H., Burges, C.J.C., Kaufman, L., Smola, A.J., Vapnik, V.: Support vector regression machines. In: Advances in Neural Information Processing Systems, pp. 155\u2013161 (1997)"},{"key":"3298_CR24","doi-asserted-by":"crossref","unstructured":"Eldar, L., Harrow, A.W.: Local Hamiltonians whose ground states are hard to approximate. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). IEEE (2017)","DOI":"10.1109\/FOCS.2017.46"},{"issue":"3\u20134","key":"3298_CR25","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01895716","volume":"14","author":"P Erd\u0151s","year":"1963","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: Asymmetric graphs. Acta Mathematica Academiae Scientiarum Hungarica 14(3\u20134), 295\u2013315 (1963)","journal-title":"Acta Mathematica Academiae Scientiarum Hungarica"},{"key":"3298_CR26","unstructured":"Farhi, E., Harrow, A.W.: Quantum supremacy through the quantum approximate optimization algorithm. arXiv:1602.07674 (2016)"},{"key":"3298_CR27","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm. arXiv:1411.4028 (2014a)"},{"key":"3298_CR28","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm applied to a bounded occurrence constraint problem. arXiv:1412.6062 (2014b)"},{"key":"3298_CR29","unstructured":"Farhi, E., Gamarnik, D., Gutmann, S.: The quantum approximate optimization algorithm needs to see the whole graph: a typical case. arXiv:2004.09002 (2020)"},{"key":"3298_CR30","doi-asserted-by":"crossref","unstructured":"Filotti, I.S., Mayer, J.N.: A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus. In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing (1980)","DOI":"10.1145\/800141.804671"},{"issue":"6","key":"3298_CR31","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM (JACM) 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM (JACM)"},{"issue":"5","key":"3298_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2371656.2371662","volume":"59","author":"M Grohe","year":"2012","unstructured":"Grohe, M.: Fixed-point definability and polynomial time on graphs with excluded minors. J. ACM (JACM) 59(5), 1\u201364 (2012a)","journal-title":"J. ACM (JACM)"},{"key":"3298_CR33","doi-asserted-by":"crossref","unstructured":"Grohe, M.: Structural and logical approaches to the graph isomorphism problem. In: SODA, p. 188 (2012b)","DOI":"10.1137\/1.9781611973099.16"},{"key":"3298_CR34","doi-asserted-by":"crossref","unstructured":"Guerreschi, G.G., Matsuura, A.Y.: QAOA for max-cut requires hundreds of qubits for quantum speed-up. Sci. Rep. 9(1) (2019)","DOI":"10.1038\/s41598-019-43176-9"},{"key":"3298_CR35","unstructured":"Hadfield, S.: Quantum algorithms for scientific computing and approximate optimization. Columbia university Ph.D. dissertation. arXiv:1805.03265 (2018a)"},{"key":"3298_CR36","unstructured":"Hadfield, S.: On the representation of Boolean and real functions as Hamiltonians for quantum computing. arXiv:1804.09130 (2018b)"},{"key":"3298_CR37","doi-asserted-by":"crossref","unstructured":"Hadfield, S., Wang, Z., O\u2019Gorman, B., Rieffel, E., Venturelli, D., Biswas, R.: From the Quantum approximate optimization algorithm to a quantum alternating operator ansatz. Algorithms 12(2), 34 (2019)","DOI":"10.3390\/a12020034"},{"key":"3298_CR38","doi-asserted-by":"crossref","unstructured":"Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring network structure, dynamics, and function using NetworkX. In: Ga\u00ebl Varoquaux, T.V., Millman, J. (Eds.), In: Proceedings of the 7th Python in Science Conference (SciPy 2008), pp, 11\u201315, Pasadena, CA USA (2008)","DOI":"10.25080\/TCWV9851"},{"issue":"4","key":"3298_CR39","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. J. ACM 48(4), 798\u2013859 (2001)","journal-title":"J. ACM"},{"issue":"5\u20136","key":"3298_CR40","first-page":"393","volume":"13","author":"MB Hastings","year":"2013","unstructured":"Hastings, M.B.: Trivial low energy states for commuting Hamiltonians, and the quantum PCP conjecture. Quantum Inf. Comput. 13(5\u20136), 393\u2013429 (2013)","journal-title":"Quantum Inf. Comput."},{"key":"3298_CR41","doi-asserted-by":"crossref","unstructured":"Hastings, M.B.: Classical and quantum bounded depth approximation algorithms. arXiv:1905.07047 (2019)","DOI":"10.26421\/QIC19.13-14-3"},{"key":"3298_CR42","unstructured":"Huang, C., Szegedy, M., Zhang, F., Gao, X., Chen, J., Yaoyun, S.: Applications to quantum algorithm design, Alibaba cloud quantum development platform (2019)"},{"key":"3298_CR43","unstructured":"Hudson, S., Larson, J., Wild, S.M., Bindel, D.: libEnsemble users manual, 2019. https:\/\/buildmedia.readthedocs.org\/media\/pdf\/libensemble\/latest\/libensemble.pdf"},{"key":"3298_CR44","unstructured":"https:\/\/github.com\/rsln-s\/Classical-symmetries-and-QAOA. [Online.]"},{"key":"3298_CR45","unstructured":"https:\/\/www.dropbox.com\/s\/cftspvdoovnzi4l\/allresults.p.zip?dl=0. [Online.]"},{"key":"3298_CR46","doi-asserted-by":"crossref","unstructured":"Jiang, Z., Rieffel, E.G., Wang, Z.: Near-optimal quantum circuit for Grover\u2019s unstructured search using a transverse field. Phys. Rev. A 95(6) (2017)","DOI":"10.1103\/PhysRevA.95.062317"},{"key":"3298_CR47","unstructured":"Jones, E., Oliphant, T., Peterson, P. et\u00a0al.: SciPy: Open source scientific tools for Python, 2001. http:\/\/www.scipy.org\/"},{"key":"3298_CR48","doi-asserted-by":"crossref","unstructured":"Junttila, T., Kaski, P.: Engineering an efficient canonical labeling tool for large and sparse graphs. In: 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 135-149 (2007)","DOI":"10.1137\/1.9781611972870.13"},{"key":"3298_CR49","doi-asserted-by":"crossref","unstructured":"Khairy, S., Shaydulin, R., Cincio, L., Alexeev, Y., Balaprakash, P.: Learning to optimize variational quantum circuits to solve combinatorial problems. In: Proceedings of the Thirty-Forth AAAI Conference on Artificial Intelligence (AAAI-20) (2019)","DOI":"10.1609\/aaai.v34i03.5616"},{"key":"3298_CR50","doi-asserted-by":"crossref","unstructured":"Khot, S., Kindler, G., Mossel, E., O\u2019Donnell, R.: Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM J. Comput. 37(1), 319\u2013357 (2007)","DOI":"10.1137\/S0097539705447372"},{"issue":"3\u20134","key":"3298_CR51","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/rsa.10054","volume":"21","author":"JH Kim","year":"2002","unstructured":"Kim, J.H., Sudakov, B., Vu, V.H.: On the asymmetry of random regular graphs and random graphs. Random Struct. Algorithms 21(3\u20134), 216\u2013224 (2002)","journal-title":"Random Struct. Algorithms"},{"key":"3298_CR52","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/S0012-365X(02)00393-X","volume":"256","author":"I Krasikov","year":"2002","unstructured":"Krasikov, I., Lev, A., Thatte, B.D.: Upper bounds on the automorphism group of a graph. Discrete Math. 256, 489\u2013493 (2002)","journal-title":"Discrete Math."},{"issue":"1","key":"3298_CR53","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s11081-015-9289-7","volume":"17","author":"J Larson","year":"2016","unstructured":"Larson, J., Wild, S.M.: A batch, derivative-free algorithm for finding multiple local minima. Optim. Eng. 17(1), 205\u2013228 (2016)","journal-title":"Optim. Eng."},{"issue":"3","key":"3298_CR54","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s12532-017-0131-4","volume":"10","author":"J Larson","year":"2018","unstructured":"Larson, J., Wild, S.M.: Asynchronously parallel optimization solver for finding multiple minima. Math. Program. Comput. 10(3), 303\u2013332 (2018)","journal-title":"Math. Program. Comput."},{"key":"3298_CR55","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Presa, J.L., Chiroque, L.F., Anta, A.F.: Novel techniques to speed up the computation of the automorphism group of a graph. J. Appl. Math. 2014 (2014)","DOI":"10.1155\/2014\/934637"},{"issue":"1","key":"3298_CR56","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"EM Luks","year":"1982","unstructured":"Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci. 25(1), 42\u201365 (1982)","journal-title":"J. Comput. Syst. Sci."},{"key":"3298_CR57","unstructured":"Lykov, D., Schutski, R., Galda, A., Vinokur, V., Alexeev, Y.: Tensor network quantum simulator with step-dependent parallelization. arXiv:2012.02430 (2020)"},{"issue":"18","key":"3298_CR58","doi-asserted-by":"publisher","first-page":"3525","DOI":"10.1016\/j.dam.2008.04.008","volume":"156","author":"BD MacArthur","year":"2008","unstructured":"MacArthur, B.D., S\u00e1nchez-Garc\u00eda, R.J., Anderson, J.W.: Symmetry in complex networks. Discrete Appl. Math. 156(18), 3525\u20133531 (2008)","journal-title":"Discrete Appl. Math."},{"key":"3298_CR59","unstructured":"Mbeng, G.B., Fazio, R., Santoro, G.: Quantum annealing: a journey through digitalization, control, and hybrid quantum variational schemes. arXiv:1906.08948 (2019)"},{"key":"3298_CR60","doi-asserted-by":"crossref","unstructured":"McKay, B.D.: Computing automorphisms and canonical labellings of graphs. In: Combinatorial mathematics, pp. 223\u2013232. Springer (1978)","DOI":"10.1007\/BFb0062536"},{"key":"3298_CR61","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism, II. J. Symb. Comput. 60, 94\u2013112 (2014)","journal-title":"J. Symb. Comput."},{"key":"3298_CR62","first-page":"45","volume":"30","author":"BD McKay","year":"1981","unstructured":"McKay, B.D., et al.: Practical graph isomorphism. Congr. Numer. 30, 45\u201387 (1981)","journal-title":"Congr. Numer."},{"key":"3298_CR63","doi-asserted-by":"crossref","unstructured":"Miller, G.: Isomorphism testing for graphs of bounded genus. In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, pp. 225-235 (1980)","DOI":"10.1145\/800141.804670"},{"issue":"1","key":"3298_CR64","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF02476948","volume":"30","author":"A Mowshowitz","year":"1968","unstructured":"Mowshowitz, A.: Entropy and the complexity of graphs: I. An index of the relative complexity of a graph. Bull. Math. Biophys. 30(1), 175\u2013204 (1968)","journal-title":"Bull. Math. Biophys."},{"key":"3298_CR65","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/BF02476673","volume":"30","author":"A Mowshowitz","year":"2010","unstructured":"Mowshowitz, A., Dehmer, M.: A symmetry index for graphs. J. Math. Biophys 30, 533\u2013546 (2010)","journal-title":"J. Math. Biophys"},{"issue":"1","key":"3298_CR66","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10107-009-0273-x","volume":"126","author":"J Ostrowski","year":"2011","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. Math. Program. 126(1), 147\u2013178 (2011)","journal-title":"Math. Program."},{"issue":"3","key":"3298_CR67","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43(3), 425\u2013440 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"3298_CR68","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., Duchesnay, E.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"5","key":"3298_CR69","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1109\/TCYB.2013.2266336","volume":"44","author":"M Perez-Ortiz","year":"2014","unstructured":"Perez-Ortiz, M., Gutierrez, P.A., Hervas-Martinez, C.: Projection-based ensemble learning for ordinal regression. IEEE Trans. Cybern. 44(5), 681\u2013694 (2014)","journal-title":"IEEE Trans. Cybern."},{"key":"3298_CR70","doi-asserted-by":"crossref","unstructured":"Powell, M.J.D.: A direct search optimization method that models the objective and constraint functions by linear interpolation. In: Advances in Optimization and Numerical Analysis, pp. 51\u201367. Springer, Netherlands (1994)","DOI":"10.1007\/978-94-015-8330-5_4"},{"key":"3298_CR71","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S0962492900002841","volume":"7","author":"MJD Powell","year":"1998","unstructured":"Powell, M.J.D.: Direct search algorithms for optimization calculations. Acta Numer. 7, 287\u2013336 (1998)","journal-title":"Acta Numer."},{"key":"3298_CR72","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3450703","volume":"26","author":"Z Qiu","year":"2021","unstructured":"Qiu, Z., Shaydulin, R., Liu, X., Alexeev, Y., Henry, C.S., Safro, I.: Elruna: elimination rule-based network alignment. J. Exp. Algorithmics (JEA) 26, 1\u201332 (2021)","journal-title":"J. Exp. Algorithmics (JEA)"},{"key":"3298_CR73","doi-asserted-by":"crossref","unstructured":"Rotman, J.J.: Advanced modern algebra, volume 165. American Mathematical Society (2015)","DOI":"10.1090\/gsm\/165"},{"issue":"11","key":"3298_CR74","doi-asserted-by":"publisher","first-page":"1879","DOI":"10.1007\/s10994-019-05800-7","volume":"108","author":"E Sadrfaridpour","year":"2019","unstructured":"Sadrfaridpour, E., Razzaghi, T., Safro, I.: Engineering fast multilevel support vector machines. Mach. Learn. 108(11), 1879\u20131917 (2019)","journal-title":"Mach. Learn."},{"key":"3298_CR75","doi-asserted-by":"crossref","unstructured":"Shaydulin, R., Alexeev, Y.: Evaluating quantum approximate optimization algorithm: a case study. In: 2019 Tenth International Green and Sustainable Computing Conference (IGSC). IEEE, (2019)","DOI":"10.1109\/IGSC48788.2019.8957201"},{"key":"3298_CR76","doi-asserted-by":"crossref","unstructured":"Shaydulin, R., Safro, I., Larson, Je.: Multistart methods for quantum approximate optimization. In: 2019 IEEE High Performance Extreme Computing Conference (HPEC) (2019)","DOI":"10.1109\/HPEC.2019.8916288"},{"key":"3298_CR77","first-page":"399","volume":"20","author":"G Simonyi","year":"1995","unstructured":"Simonyi, G.: Graph entropy: a survey. Combin. Optim. 20, 399\u2013441 (1995)","journal-title":"Combin. Optim."},{"key":"3298_CR78","unstructured":"Szegedy, M.: What do QAOA energies reveal about graphs? arXiv:1912.12277 (2019)"},{"issue":"1","key":"3298_CR79","first-page":"42","volume":"36","author":"O Tange","year":"2018","unstructured":"Tange, O.: Gnu parallel-the command-line power tool. The USENIX Mag. 36(1), 42\u201347 (2018)","journal-title":"The USENIX Mag."},{"key":"3298_CR80","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2013","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2013)"},{"key":"3298_CR81","unstructured":"Verdon, G., Broughton, M., McClean, J.R., Sung, K.J., Babbush, R., Jiang, Z., Neven, H., Mohseni, M.: Learning to learn with quantum neural networks via classical neural networks. arXiv:1907.05415 (2019)"},{"issue":"1","key":"3298_CR82","first-page":"47","volume":"3","author":"W Waegeman","year":"2009","unstructured":"Waegeman, W., Boullart, L.: An ensemble of weighted support vector machines for ordinal regression. Int. J. Comput. Syst. Sci. Eng. 3(1), 47\u201351 (2009)","journal-title":"Int. J. Comput. Syst. Sci. Eng."},{"key":"3298_CR83","doi-asserted-by":"crossref","unstructured":"Wang, Z., Hadfield, S., Jiang, Z., Rieffel, E.G.: Quantum approximate optimization algorithm for MaxCut: a fermionic view. Phys. Rev. A 97(2), (2018)","DOI":"10.1103\/PhysRevA.97.022304"},{"key":"3298_CR84","unstructured":"Wilson, M., Stromswold, S., Wudarski, F., Hadfield, S., Tubman, N.M., Rieffel, E.: Optimizing quantum heuristics with meta-learning. arXiv:1908.03185 (2019)"},{"key":"3298_CR85","unstructured":"Wurtz, J., Love, P.J.: Bounds on MaxCut QAOA performance for p$$>$$1. arXiv:2010.11209 (2020)"},{"key":"3298_CR86","unstructured":"Zhou, L., Wang, S.-T., Choi, S., Pichler, H., Lukin, M.D.: Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices. arXiv:1812.01041 (2018)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-021-03298-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-021-03298-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-021-03298-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T20:36:31Z","timestamp":1726000591000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-021-03298-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,26]]},"references-count":86,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["3298"],"URL":"https:\/\/doi.org\/10.1007\/s11128-021-03298-4","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,26]]},"assertion":[{"value":"11 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"359"}}