{"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/quantum-approximate-optimization-of-non","title":"Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor","arxiv_id":"2004.04197","date":"2020-04-08","proceeding":null,"authors":["Matthew P. Harrigan","Kevin J. Sung","Matthew Neeley","Kevin J. Satzinger","Frank Arute","Kunal Arya","Juan Atalaya","Joseph C. Bardin","Rami Barends","Sergio Boixo","Michael Broughton","Bob B. Buckley","David A. Buell","Brian Burkett","Nicholas Bushnell","Yu Chen","Zijun Chen","Ben Chiaro","Roberto Collins","William Courtney","Sean Demura","Andrew Dunsworth","Daniel Eppens","Austin Fowler","Brooks Foxen","Craig Gidney","Marissa Giustina","Rob Graff","Steve Habegger","Alan Ho","Sabrina Hong","Trent Huang","L. B. Ioffe","Sergei V. Isakov","Evan Jeffrey","Zhang Jiang","Cody Jones","Dvir Kafri","Kostyantyn Kechedzhi","Julian Kelly","Seon Kim","Paul V. Klimov","Alexander N. Korotkov","Fedor Kostritsa","David Landhuis","Pavel Laptev","Mike Lindmark","Martin Leib","Orion Martin","John M. Martinis","Jarrod R. McClean","Matt McEwen","Anthony Megrant","Xiao Mi","Masoud Mohseni","Wojciech Mruczkiewicz","Josh Mutus","Ofer Naaman","Charles Neill","Florian Neukart","Murphy Yuezhen Niu","Thomas E. O'Brien","Bryan O'Gorman","Eric Ostby","Andre Petukhov","Harald Putterman","Chris Quintana","Pedram Roushan","Nicholas C. Rubin","Daniel Sank","Andrea Skolik","Vadim Smelyanskiy","Doug Strain","Michael Streif","Marco Szalay","Amit Vainsencher","Theodore White","Z. Jamie Yao","Ping Yeh","Adam Zalcman","Leo Zhou","Hartmut Neven","Dave Bacon","Erik Lucero","Edward Farhi","Ryan Babbush"],"abstract":"We demonstrate the application of the Google Sycamore superconducting qubit quantum processor to combinatorial optimization problems with the quantum approximate optimization algorithm (QAOA). Like past QAOA experiments, we study performance for problems defined on the (planar) connectivity graph of our hardware; however, we also apply the QAOA to the Sherrington-Kirkpatrick model and MaxCut, both high dimensional graph problems for which the QAOA requires significant compilation. Experimental scans of the QAOA energy landscape show good agreement with theory across even the largest instances studied (23 qubits) and we are able to perform variational optimization successfully. For problems defined on our hardware graph we obtain an approximation ratio that is independent of problem size and observe, for the first time, that performance increases with circuit depth. For problems requiring compilation, performance decreases with problem size but still provides an advantage over random guessing for circuits involving several thousand gates. This behavior highlights the challenge of using near-term quantum computers to optimize problems on graphs differing from hardware connectivity. As these graphs are more representative of real world instances, our results advocate for more emphasis on such problems in the developing tradition of using the QAOA as a holistic, device-level benchmark of quantum processors.","url_abs":"https://arxiv.org/abs/2004.04197v2","url_pdf":"https://arxiv.org/pdf/2004.04197v2.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":"quantum-approximate-optimization-of-non","repo_url":"https://github.com/CDL-Quantum/Hackathon2020","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2004.04197","atlas_url":"https://app.syntology.ai/?focus=2004.04197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.04197"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+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/CDL-Quantum/Hackathon2020","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":8},"by_repo_kind":{"listed":{"samples":8,"ran":8,"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":0,"samples":[{"code_sha256_prefix":"707500ea9d026c5c","entry":"costfunc","repo":"CDL-Quantum/Hackathon2020","repo_kind":"listed","path":"QBC/quantum_aware_optims.py","file_url":"https://github.com/CDL-Quantum/Hackathon2020/blob/HEAD/QBC/quantum_aware_optims.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"707500ea9d026c5c"}},{"code_sha256_prefix":"c77b4bca9d49ce87","entry":"evaluate_circuits","repo":"CDL-Quantum/Hackathon2020","repo_kind":"listed","path":"QBC/quantum_aware_optims.py","file_url":"https://github.com/CDL-Quantum/Hackathon2020/blob/HEAD/QBC/quantum_aware_optims.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c77b4bca9d49ce87"}},{"code_sha256_prefix":"bcf05906fb3ac7a7","entry":"get_dic_from_matrix","repo":"CDL-Quantum/Hackathon2020","repo_kind":"listed","path":"Bridge42/drafts/dwave-test.py","file_url":"https://github.com/CDL-Quantum/Hackathon2020/blob/HEAD/Bridge42/drafts/dwave-test.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"bcf05906fb3ac7a7"}},{"code_sha256_prefix":"bcb2a85323de4b3a","entry":"kronecker","repo":"CDL-Quantum/Hackathon2020","repo_kind":"listed","path":"QBC/quantum_aware_optims.py","file_url":"https://github.com/CDL-Quantum/Hackathon2020/blob/HEAD/QBC/quantum_aware_optims.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"bcb2a85323de4b3a"}},{"code_sha256_prefix":"d638c9719e5c6e17","entry":"number_of_photons","repo":"CDL-Quantum/Hackathon2020","repo_kind":"listed","path":"Pasqathon/functions.py","file_url":"https://github.com/CDL-Quantum/Hackathon2020/blob/HEAD/Pasqathon/functions.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"d638c9719e5c6e17"}},{"code_sha256_prefix":"181aa869e064f824","entry":"rvs","repo":"CDL-Quantum/Hackathon2020","repo_kind":"listed","path":"Pasqathon/functions.py","file_url":"https://github.com/CDL-Quantum/Hackathon2020/blob/HEAD/Pasqathon/functions.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"181aa869e064f824"}},{"code_sha256_prefix":"0359bb7e76347dab","entry":"squared_dist_sum","repo":"CDL-Quantum/Hackathon2020","repo_kind":"listed","path":"AB/binary_cluster.py","file_url":"https://github.com/CDL-Quantum/Hackathon2020/blob/HEAD/AB/binary_cluster.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"0359bb7e76347dab"}},{"code_sha256_prefix":"4b16c2f379176fdd","entry":"truncate_samples","repo":"CDL-Quantum/Hackathon2020","repo_kind":"listed","path":"Pasqathon/functions.py","file_url":"https://github.com/CDL-Quantum/Hackathon2020/blob/HEAD/Pasqathon/functions.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"4b16c2f379176fdd"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}