{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:65EPULUPOSDSJVDSECKM6TPGTG","short_pith_number":"pith:65EPULUP","schema_version":"1.0","canonical_sha256":"f748fa2e8f748724d4722094cf4de69995b6fa05c18504ab8c0fff12a6b506af","source":{"kind":"arxiv","id":"2407.20212","version":2},"attestation_state":"computed","paper":{"title":"Distributed Quantum Approximate Optimization Algorithm on a Quantum-Centric Supercomputing Architecture","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CE","quant-ph"],"primary_cat":"cs.DC","authors_text":"Eungkyu Lee, In-Saeng Suh, Seongmin Kim, Tengfei Luo, Vincent R. Pascuzzi, Zhihao Xu","submitted_at":"2024-07-29T17:42:25Z","abstract_excerpt":"Quantum approximate optimization algorithm (QAOA) has shown promise in solving combinatorial optimization problems by providing quantum speedup on near-term gate-based quantum computing systems. However, QAOA faces challenges for high-dimensional problems due to the large number of qubits required and the complexity of deep circuits, limiting its scalability for real-world applications. In this study, we present a distributed QAOA (DQAOA), which leverages distributed computing strategies to decompose a large computational workload into smaller tasks that require fewer qubits and shallower circ"},"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":"2407.20212","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2024-07-29T17:42:25Z","cross_cats_sorted":["cs.CE","quant-ph"],"title_canon_sha256":"c8c6f3e0a7b5d03af13fd86b4209eb0427577e913f7e98ffb2d58fc3fe195c57","abstract_canon_sha256":"7fb105929f8f394b516f7d0f5a15daa4b9f9f00913bd8e7eaa47525b956d8808"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:36:26.892528Z","signature_b64":"QVWA8wv+UX0osoV7CSXGpLHnvWm7UnkJREBuX9ACYHekdMntOxb6fA1DBol9ZM26As9AoaantiJaKjoP3ZQjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f748fa2e8f748724d4722094cf4de69995b6fa05c18504ab8c0fff12a6b506af","last_reissued_at":"2026-07-05T10:36:26.891585Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:36:26.891585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Quantum Approximate Optimization Algorithm on a Quantum-Centric Supercomputing Architecture","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CE","quant-ph"],"primary_cat":"cs.DC","authors_text":"Eungkyu Lee, In-Saeng Suh, Seongmin Kim, Tengfei Luo, Vincent R. Pascuzzi, Zhihao Xu","submitted_at":"2024-07-29T17:42:25Z","abstract_excerpt":"Quantum approximate optimization algorithm (QAOA) has shown promise in solving combinatorial optimization problems by providing quantum speedup on near-term gate-based quantum computing systems. However, QAOA faces challenges for high-dimensional problems due to the large number of qubits required and the complexity of deep circuits, limiting its scalability for real-world applications. In this study, we present a distributed QAOA (DQAOA), which leverages distributed computing strategies to decompose a large computational workload into smaller tasks that require fewer qubits and shallower circ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.20212","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/2407.20212/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":"2407.20212","created_at":"2026-07-05T10:36:26.891686+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.20212v2","created_at":"2026-07-05T10:36:26.891686+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.20212","created_at":"2026-07-05T10:36:26.891686+00:00"},{"alias_kind":"pith_short_12","alias_value":"65EPULUPOSDS","created_at":"2026-07-05T10:36:26.891686+00:00"},{"alias_kind":"pith_short_16","alias_value":"65EPULUPOSDSJVDS","created_at":"2026-07-05T10:36:26.891686+00:00"},{"alias_kind":"pith_short_8","alias_value":"65EPULUP","created_at":"2026-07-05T10:36:26.891686+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":11,"internal_anchor_count":11,"sample":[{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":41,"is_internal_anchor":true},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":43,"is_internal_anchor":true},{"citing_arxiv_id":"2606.04548","citing_title":"Distributed Variational Quantum Optimisation by Entanglement-Selective Transport","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":43,"is_internal_anchor":true},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":42,"is_internal_anchor":true},{"citing_arxiv_id":"2606.30402","citing_title":"Quantum Computations on Fusion Blanket Molten Salts","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2508.11765","citing_title":"The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute","ref_index":271,"is_internal_anchor":true},{"citing_arxiv_id":"2604.03445","citing_title":"Hybrid Quantum-HPC Middleware Systems for Adaptive Resource, Workload and Task Management","ref_index":61,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27836","citing_title":"Towards High Performance Quantum Computing (HPQ): Parallelisation of the Hamiltonian Auto Decomposition Optimisation Framework (HADOF)","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2605.00241","citing_title":"Exploring the Geometric and Dynamical Properties of Spin Systems and Their Interplay with Quantum Entanglement","ref_index":96,"is_internal_anchor":true},{"citing_arxiv_id":"2604.14955","citing_title":"Three ways to share a QPU: Scheduling strategies for hybrid Quantum-HPC applications","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/65EPULUPOSDSJVDSECKM6TPGTG","json":"https://pith.science/pith/65EPULUPOSDSJVDSECKM6TPGTG.json","graph_json":"https://pith.science/api/pith-number/65EPULUPOSDSJVDSECKM6TPGTG/graph.json","events_json":"https://pith.science/api/pith-number/65EPULUPOSDSJVDSECKM6TPGTG/events.json","paper":"https://pith.science/paper/65EPULUP"},"agent_actions":{"view_html":"https://pith.science/pith/65EPULUPOSDSJVDSECKM6TPGTG","download_json":"https://pith.science/pith/65EPULUPOSDSJVDSECKM6TPGTG.json","view_paper":"https://pith.science/paper/65EPULUP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.20212&json=true","fetch_graph":"https://pith.science/api/pith-number/65EPULUPOSDSJVDSECKM6TPGTG/graph.json","fetch_events":"https://pith.science/api/pith-number/65EPULUPOSDSJVDSECKM6TPGTG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/65EPULUPOSDSJVDSECKM6TPGTG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/65EPULUPOSDSJVDSECKM6TPGTG/action/storage_attestation","attest_author":"https://pith.science/pith/65EPULUPOSDSJVDSECKM6TPGTG/action/author_attestation","sign_citation":"https://pith.science/pith/65EPULUPOSDSJVDSECKM6TPGTG/action/citation_signature","submit_replication":"https://pith.science/pith/65EPULUPOSDSJVDSECKM6TPGTG/action/replication_record"}},"created_at":"2026-07-05T10:36:26.891686+00:00","updated_at":"2026-07-05T10:36:26.891686+00:00"}