{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XFADQN2O7VN26CBPUSHTMIW5LB","short_pith_number":"pith:XFADQN2O","schema_version":"1.0","canonical_sha256":"b94038374efd5baf082fa48f3622dd585ea966bb25c08662e936ca9ca88cdd8f","source":{"kind":"arxiv","id":"2310.05062","version":2},"attestation_state":"computed","paper":{"title":"Local to Global: A Distributed Quantum Approximate Optimization Algorithm for Pseudo-Boolean Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bo Yue, Daoyi Dong, Min Jiang, Shibei Xue, Yu Pan","submitted_at":"2023-10-08T08:07:11Z","abstract_excerpt":"With the rapid advancement of quantum computing, Quantum Approximate Optimization Algorithm (QAOA) is considered as a promising candidate to demonstrate quantum supremacy, which exponentially solves a class of Quadratic Unconstrained Binary Optimization (QUBO) problems. However, limited qubit availability and restricted coherence time challenge QAOA to solve large-scale pseudo-Boolean problems on currently available Near-term Intermediate Scale Quantum (NISQ) devices. In this paper, we propose a distributed QAOA which can solve a general pseudo-Boolean problem by converting it to a simplified "},"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":"2310.05062","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-10-08T08:07:11Z","cross_cats_sorted":[],"title_canon_sha256":"723bcce31bc87898829b280f4566f8ba28f1275578bd0e291b3ae9ba33d87066","abstract_canon_sha256":"d0bbf472d9b9c039202ad795366cc5eeea391f9a29ebbfac687021713f3e9ec3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:59:01.172687Z","signature_b64":"h11H8obLZc0867Y7ZmMXfAry7OpNh26jwJqgbJNvPfZLDeTZLghLrOhuPAK35PizL8SI2jBDdvy1pILhd/XIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b94038374efd5baf082fa48f3622dd585ea966bb25c08662e936ca9ca88cdd8f","last_reissued_at":"2026-07-05T06:59:01.172223Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:59:01.172223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local to Global: A Distributed Quantum Approximate Optimization Algorithm for Pseudo-Boolean Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bo Yue, Daoyi Dong, Min Jiang, Shibei Xue, Yu Pan","submitted_at":"2023-10-08T08:07:11Z","abstract_excerpt":"With the rapid advancement of quantum computing, Quantum Approximate Optimization Algorithm (QAOA) is considered as a promising candidate to demonstrate quantum supremacy, which exponentially solves a class of Quadratic Unconstrained Binary Optimization (QUBO) problems. However, limited qubit availability and restricted coherence time challenge QAOA to solve large-scale pseudo-Boolean problems on currently available Near-term Intermediate Scale Quantum (NISQ) devices. In this paper, we propose a distributed QAOA which can solve a general pseudo-Boolean problem by converting it to a simplified "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.05062","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/2310.05062/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":"2310.05062","created_at":"2026-07-05T06:59:01.172280+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.05062v2","created_at":"2026-07-05T06:59:01.172280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.05062","created_at":"2026-07-05T06:59:01.172280+00:00"},{"alias_kind":"pith_short_12","alias_value":"XFADQN2O7VN2","created_at":"2026-07-05T06:59:01.172280+00:00"},{"alias_kind":"pith_short_16","alias_value":"XFADQN2O7VN26CBP","created_at":"2026-07-05T06:59:01.172280+00:00"},{"alias_kind":"pith_short_8","alias_value":"XFADQN2O","created_at":"2026-07-05T06:59:01.172280+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XFADQN2O7VN26CBPUSHTMIW5LB","json":"https://pith.science/pith/XFADQN2O7VN26CBPUSHTMIW5LB.json","graph_json":"https://pith.science/api/pith-number/XFADQN2O7VN26CBPUSHTMIW5LB/graph.json","events_json":"https://pith.science/api/pith-number/XFADQN2O7VN26CBPUSHTMIW5LB/events.json","paper":"https://pith.science/paper/XFADQN2O"},"agent_actions":{"view_html":"https://pith.science/pith/XFADQN2O7VN26CBPUSHTMIW5LB","download_json":"https://pith.science/pith/XFADQN2O7VN26CBPUSHTMIW5LB.json","view_paper":"https://pith.science/paper/XFADQN2O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.05062&json=true","fetch_graph":"https://pith.science/api/pith-number/XFADQN2O7VN26CBPUSHTMIW5LB/graph.json","fetch_events":"https://pith.science/api/pith-number/XFADQN2O7VN26CBPUSHTMIW5LB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XFADQN2O7VN26CBPUSHTMIW5LB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XFADQN2O7VN26CBPUSHTMIW5LB/action/storage_attestation","attest_author":"https://pith.science/pith/XFADQN2O7VN26CBPUSHTMIW5LB/action/author_attestation","sign_citation":"https://pith.science/pith/XFADQN2O7VN26CBPUSHTMIW5LB/action/citation_signature","submit_replication":"https://pith.science/pith/XFADQN2O7VN26CBPUSHTMIW5LB/action/replication_record"}},"created_at":"2026-07-05T06:59:01.172280+00:00","updated_at":"2026-07-05T06:59:01.172280+00:00"}