{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HM6JHKWOEJZ5UIYB6K5O7GIV3Z","short_pith_number":"pith:HM6JHKWO","schema_version":"1.0","canonical_sha256":"3b3c93aace2273da2301f2baef9915de7dad5bb63169ad365da08cd41850a08b","source":{"kind":"arxiv","id":"2407.14490","version":2},"attestation_state":"computed","paper":{"title":"Red-QAOA: Efficient Variational Optimization through Circuit Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ang Li, Bo Fang, Meng Wang, Prashant Nair","submitted_at":"2024-07-19T17:44:29Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) addresses combinatorial optimization challenges by converting inputs to graphs. However, the optimal parameter searching process of QAOA is greatly affected by noise. Larger problems yield bigger graphs, requiring more qubits and making their outcomes highly noise-sensitive. This paper introduces Red-QAOA, leveraging energy landscape concentration via a simulated annealing-based graph reduction.\n  Red-QAOA creates a smaller (distilled) graph with nearly identical parameters to the original graph. The distilled graph produces a smaller quant"},"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.14490","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-07-19T17:44:29Z","cross_cats_sorted":[],"title_canon_sha256":"d8c790a61cde88aab1339ef16ffc52f7be30dbc340c22555487ef78cbbec57c4","abstract_canon_sha256":"dfd52b9ea0783cae284fbf2641cf1d3f2c861f52ce83c7baaa256410de8976e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:46:28.573303Z","signature_b64":"qrhvOTcLgiaAelBTinipW8z7nMLWmJS1o9kHW47Q1149yBa+IW5YwONLGSgWNm4B5dpB/SX7L/VyLC2Su95TCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b3c93aace2273da2301f2baef9915de7dad5bb63169ad365da08cd41850a08b","last_reissued_at":"2026-07-05T08:46:28.572902Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:46:28.572902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Red-QAOA: Efficient Variational Optimization through Circuit Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ang Li, Bo Fang, Meng Wang, Prashant Nair","submitted_at":"2024-07-19T17:44:29Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) addresses combinatorial optimization challenges by converting inputs to graphs. However, the optimal parameter searching process of QAOA is greatly affected by noise. Larger problems yield bigger graphs, requiring more qubits and making their outcomes highly noise-sensitive. This paper introduces Red-QAOA, leveraging energy landscape concentration via a simulated annealing-based graph reduction.\n  Red-QAOA creates a smaller (distilled) graph with nearly identical parameters to the original graph. The distilled graph produces a smaller quant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.14490","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.14490/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.14490","created_at":"2026-07-05T08:46:28.572957+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.14490v2","created_at":"2026-07-05T08:46:28.572957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.14490","created_at":"2026-07-05T08:46:28.572957+00:00"},{"alias_kind":"pith_short_12","alias_value":"HM6JHKWOEJZ5","created_at":"2026-07-05T08:46:28.572957+00:00"},{"alias_kind":"pith_short_16","alias_value":"HM6JHKWOEJZ5UIYB","created_at":"2026-07-05T08:46:28.572957+00:00"},{"alias_kind":"pith_short_8","alias_value":"HM6JHKWO","created_at":"2026-07-05T08:46:28.572957+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HM6JHKWOEJZ5UIYB6K5O7GIV3Z","json":"https://pith.science/pith/HM6JHKWOEJZ5UIYB6K5O7GIV3Z.json","graph_json":"https://pith.science/api/pith-number/HM6JHKWOEJZ5UIYB6K5O7GIV3Z/graph.json","events_json":"https://pith.science/api/pith-number/HM6JHKWOEJZ5UIYB6K5O7GIV3Z/events.json","paper":"https://pith.science/paper/HM6JHKWO"},"agent_actions":{"view_html":"https://pith.science/pith/HM6JHKWOEJZ5UIYB6K5O7GIV3Z","download_json":"https://pith.science/pith/HM6JHKWOEJZ5UIYB6K5O7GIV3Z.json","view_paper":"https://pith.science/paper/HM6JHKWO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.14490&json=true","fetch_graph":"https://pith.science/api/pith-number/HM6JHKWOEJZ5UIYB6K5O7GIV3Z/graph.json","fetch_events":"https://pith.science/api/pith-number/HM6JHKWOEJZ5UIYB6K5O7GIV3Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HM6JHKWOEJZ5UIYB6K5O7GIV3Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HM6JHKWOEJZ5UIYB6K5O7GIV3Z/action/storage_attestation","attest_author":"https://pith.science/pith/HM6JHKWOEJZ5UIYB6K5O7GIV3Z/action/author_attestation","sign_citation":"https://pith.science/pith/HM6JHKWOEJZ5UIYB6K5O7GIV3Z/action/citation_signature","submit_replication":"https://pith.science/pith/HM6JHKWOEJZ5UIYB6K5O7GIV3Z/action/replication_record"}},"created_at":"2026-07-05T08:46:28.572957+00:00","updated_at":"2026-07-05T08:46:28.572957+00:00"}