{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/exploiting-symmetry-reduces-the-cost-of","title":"Exploiting Symmetry Reduces the Cost of Training QAOA","arxiv_id":"2101.10296","date":"2021-01-25","proceeding":null,"authors":["Ruslan Shaydulin","Stefan M. Wild"],"abstract":"A promising approach to the practical application of the Quantum Approximate Optimization Algorithm (QAOA) is finding QAOA parameters classically in simulation and sampling the solutions from QAOA with optimized parameters on a quantum computer. Doing so requires repeated evaluations of QAOA energy in simulation. We propose a novel approach for accelerating the evaluation of QAOA energy by leveraging the symmetry of the problem. We show a connection between classical symmetries of the objective function and the symmetries of the terms of the cost Hamiltonian with respect to the QAOA energy. We show how by considering only the terms that are not connected by symmetry, we can significantly reduce the cost of evaluating the QAOA energy. Our approach is general and applies to any known subgroup of symmetries and is not limited to graph problems. Our results are directly applicable to nonlocal QAOA generalization RQAOA. We outline how available fast graph automorphism solvers can be leveraged for computing the symmetries of the problem in practice. We implement the proposed approach on the MaxCut problem using a state-of-the-art tensor network simulator and a graph automorphism solver on a benchmark of 48 graphs with up to 10,000 nodes. Our approach provides an improvement for $p=1$ on $71.7\\%$ of the graphs considered, with a median speedup of $4.06$, on a benchmark where $62.5\\%$ of the graphs are known to be hard for automorphism solvers.","url_abs":"https://arxiv.org/abs/2101.10296v1","url_pdf":"https://arxiv.org/pdf/2101.10296v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"exploiting-symmetry-reduces-the-cost-of","repo_url":"https://github.com/rsln-s/Exploiting_Symmetry_Reduces_the_Cost_of_Training_QAOA","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2101.10296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.10296"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/rsln-s/Exploiting_Symmetry_Reduces_the_Cost_of_Training_QAOA","reach":null}],"summary":{"ran_honours":2,"ran_draft_wrong":1,"unverified":1},"by_repo_kind":{"official":{"samples":4,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":4,"samples":[{"code_sha256_prefix":"d951d49b14c106d0","entry":"generator_from_line","repo":"rsln-s/Exploiting_Symmetry_Reduces_the_Cost_of_Training_QAOA","repo_kind":"official","path":"compute_orbits.py","file_url":"https://github.com/rsln-s/Exploiting_Symmetry_Reduces_the_Cost_of_Training_QAOA/blob/HEAD/compute_orbits.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"d951d49b14c106d0"}},{"code_sha256_prefix":"aa6fdbc13275cc58","entry":"import_dimacs","repo":"rsln-s/Exploiting_Symmetry_Reduces_the_Cost_of_Training_QAOA","repo_kind":"official","path":"compute_orbits.py","file_url":"https://github.com/rsln-s/Exploiting_Symmetry_Reduces_the_Cost_of_Training_QAOA/blob/HEAD/compute_orbits.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"aa6fdbc13275cc58"}},{"code_sha256_prefix":"6ba556dbb13273c3","entry":"visit_edges_randomly","repo":"rsln-s/Exploiting_Symmetry_Reduces_the_Cost_of_Training_QAOA","repo_kind":"official","path":"compute_energy_serial.py","file_url":"https://github.com/rsln-s/Exploiting_Symmetry_Reduces_the_Cost_of_Training_QAOA/blob/HEAD/compute_energy_serial.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"6ba556dbb13273c3"}},{"code_sha256_prefix":"20c43ea7161bbb8b","entry":"compute_automorphisms","repo":"rsln-s/Exploiting_Symmetry_Reduces_the_Cost_of_Training_QAOA","repo_kind":"official","path":"compute_orbits.py","file_url":"https://github.com/rsln-s/Exploiting_Symmetry_Reduces_the_Cost_of_Training_QAOA/blob/HEAD/compute_orbits.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"20c43ea7161bbb8b"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}