{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UPZU7JTANDE74D3NE2PGMB4J6N","short_pith_number":"pith:UPZU7JTA","schema_version":"1.0","canonical_sha256":"a3f34fa66068c9fe0f6d269e660789f354930b68cb0d1ff6958795fe1c61c778","source":{"kind":"arxiv","id":"2301.00520","version":2},"attestation_state":"computed","paper":{"title":"Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.ET","math.CO"],"primary_cat":"quant-ph","authors_text":"Andreas B\\\"artschi, Elijah Pelofske, Stephan Eidenbenz","submitted_at":"2023-01-02T04:19:46Z","abstract_excerpt":"Quantum annealing (QA) and Quantum Alternating Operator Ansatz (QAOA) are both heuristic quantum algorithms intended for sampling optimal solutions of combinatorial optimization problems. In this article we implement a rigorous direct comparison between QA on D-Wave hardware and QAOA on IBMQ hardware. These two quantum algorithms are also compared against classical simulated annealing. The studied problems are instances of a class of Ising models, with variable assignments of $+1$ or $-1$, that contain cubic $ZZZ$ interactions (higher order terms) and match both the native connectivity of the "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2301.00520","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-01-02T04:19:46Z","cross_cats_sorted":["cs.DS","cs.ET","math.CO"],"title_canon_sha256":"11a9db273b5eed6f185f9b94dd281bed9fe39aef2b7fc9e15715f21af4e61382","abstract_canon_sha256":"395af5d64f7501011f30026d09dbbc5ebf710bfade75b5fb316bd9f23feb8494"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:46:00.137083Z","signature_b64":"s7GMiTkXirWFskt/OYNuIX4rD205YepJSsQ8D8OrksJTRhqXaDTmXAtGPINt+nvDOVr8j3eGcp3yvZe9BRfPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3f34fa66068c9fe0f6d269e660789f354930b68cb0d1ff6958795fe1c61c778","last_reissued_at":"2026-07-05T06:46:00.136545Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:46:00.136545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.ET","math.CO"],"primary_cat":"quant-ph","authors_text":"Andreas B\\\"artschi, Elijah Pelofske, Stephan Eidenbenz","submitted_at":"2023-01-02T04:19:46Z","abstract_excerpt":"Quantum annealing (QA) and Quantum Alternating Operator Ansatz (QAOA) are both heuristic quantum algorithms intended for sampling optimal solutions of combinatorial optimization problems. In this article we implement a rigorous direct comparison between QA on D-Wave hardware and QAOA on IBMQ hardware. These two quantum algorithms are also compared against classical simulated annealing. The studied problems are instances of a class of Ising models, with variable assignments of $+1$ or $-1$, that contain cubic $ZZZ$ interactions (higher order terms) and match both the native connectivity of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.00520","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.00520/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2301.00520","created_at":"2026-07-05T06:46:00.136613+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.00520v2","created_at":"2026-07-05T06:46:00.136613+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.00520","created_at":"2026-07-05T06:46:00.136613+00:00"},{"alias_kind":"pith_short_12","alias_value":"UPZU7JTANDE7","created_at":"2026-07-05T06:46:00.136613+00:00"},{"alias_kind":"pith_short_16","alias_value":"UPZU7JTANDE74D3N","created_at":"2026-07-05T06:46:00.136613+00:00"},{"alias_kind":"pith_short_8","alias_value":"UPZU7JTA","created_at":"2026-07-05T06:46:00.136613+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.13528","citing_title":"Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UPZU7JTANDE74D3NE2PGMB4J6N","json":"https://pith.science/pith/UPZU7JTANDE74D3NE2PGMB4J6N.json","graph_json":"https://pith.science/api/pith-number/UPZU7JTANDE74D3NE2PGMB4J6N/graph.json","events_json":"https://pith.science/api/pith-number/UPZU7JTANDE74D3NE2PGMB4J6N/events.json","paper":"https://pith.science/paper/UPZU7JTA"},"agent_actions":{"view_html":"https://pith.science/pith/UPZU7JTANDE74D3NE2PGMB4J6N","download_json":"https://pith.science/pith/UPZU7JTANDE74D3NE2PGMB4J6N.json","view_paper":"https://pith.science/paper/UPZU7JTA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.00520&json=true","fetch_graph":"https://pith.science/api/pith-number/UPZU7JTANDE74D3NE2PGMB4J6N/graph.json","fetch_events":"https://pith.science/api/pith-number/UPZU7JTANDE74D3NE2PGMB4J6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UPZU7JTANDE74D3NE2PGMB4J6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UPZU7JTANDE74D3NE2PGMB4J6N/action/storage_attestation","attest_author":"https://pith.science/pith/UPZU7JTANDE74D3NE2PGMB4J6N/action/author_attestation","sign_citation":"https://pith.science/pith/UPZU7JTANDE74D3NE2PGMB4J6N/action/citation_signature","submit_replication":"https://pith.science/pith/UPZU7JTANDE74D3NE2PGMB4J6N/action/replication_record"}},"created_at":"2026-07-05T06:46:00.136613+00:00","updated_at":"2026-07-05T06:46:00.136613+00:00"}