{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:C4N5ULWRII2SNJTLKQJJG4O5SW","short_pith_number":"pith:C4N5ULWR","schema_version":"1.0","canonical_sha256":"171bda2ed1423526a66b54129371dd9593c1c6f0d1ad79bc9f9e3d1ac4f914cd","source":{"kind":"arxiv","id":"2306.06986","version":4},"attestation_state":"computed","paper":{"title":"Multilevel leapfrogging initialization for quantum approximate optimization algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bin-Bin Cai, Fei Gao, Hai-Ling Liu, Qiao-Yan Wen, Su-Juan Qin, Xiao-Hui Ni","submitted_at":"2023-06-12T09:32:57Z","abstract_excerpt":"Recently, Zhou et al. have proposed a novel Interpolation-based (INTERP) strategy to generate the initial parameters for the Parameterized Quantum Circuit (PQC) in Quantum Approximate Optimization Algorithm (QAOA). INTERP produces the guess of the initial parameters at level $i+1$ by applying linear interpolation to the optimized parameters at level $i$, achieving better performance than random initialization (RI). Nevertheless, INTERP consumes extensive running costs for deep QAOA because it necessitates optimization at each level of the PQC. To address this problem, a Multilevel Leapfrogging"},"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":"2306.06986","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-06-12T09:32:57Z","cross_cats_sorted":[],"title_canon_sha256":"9a0642a8ff91cf4536fb9cd0854be6be10207fea5776734c998a3b1c802e8cad","abstract_canon_sha256":"dcae0568fa5f23042b0bf3e6d63af1db0dd5118ae72c803911de282fac91b74f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:54:49.273072Z","signature_b64":"9EWGOcju3lJxDLRWG26fPjjT0xPHEoXP+u969ysAx0AZzG1JSwmbpgMcy5rgBMigvdPdWh0pQ88kHGye6lhGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"171bda2ed1423526a66b54129371dd9593c1c6f0d1ad79bc9f9e3d1ac4f914cd","last_reissued_at":"2026-07-05T07:54:49.272523Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:54:49.272523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multilevel leapfrogging initialization for quantum approximate optimization algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bin-Bin Cai, Fei Gao, Hai-Ling Liu, Qiao-Yan Wen, Su-Juan Qin, Xiao-Hui Ni","submitted_at":"2023-06-12T09:32:57Z","abstract_excerpt":"Recently, Zhou et al. have proposed a novel Interpolation-based (INTERP) strategy to generate the initial parameters for the Parameterized Quantum Circuit (PQC) in Quantum Approximate Optimization Algorithm (QAOA). INTERP produces the guess of the initial parameters at level $i+1$ by applying linear interpolation to the optimized parameters at level $i$, achieving better performance than random initialization (RI). Nevertheless, INTERP consumes extensive running costs for deep QAOA because it necessitates optimization at each level of the PQC. To address this problem, a Multilevel Leapfrogging"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.06986","kind":"arxiv","version":4},"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/2306.06986/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":"2306.06986","created_at":"2026-07-05T07:54:49.272580+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.06986v4","created_at":"2026-07-05T07:54:49.272580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.06986","created_at":"2026-07-05T07:54:49.272580+00:00"},{"alias_kind":"pith_short_12","alias_value":"C4N5ULWRII2S","created_at":"2026-07-05T07:54:49.272580+00:00"},{"alias_kind":"pith_short_16","alias_value":"C4N5ULWRII2SNJTL","created_at":"2026-07-05T07:54:49.272580+00:00"},{"alias_kind":"pith_short_8","alias_value":"C4N5ULWR","created_at":"2026-07-05T07:54:49.272580+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.17841","citing_title":"Reducing QUBO Density by Factoring Out Semi-Symmetries","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C4N5ULWRII2SNJTLKQJJG4O5SW","json":"https://pith.science/pith/C4N5ULWRII2SNJTLKQJJG4O5SW.json","graph_json":"https://pith.science/api/pith-number/C4N5ULWRII2SNJTLKQJJG4O5SW/graph.json","events_json":"https://pith.science/api/pith-number/C4N5ULWRII2SNJTLKQJJG4O5SW/events.json","paper":"https://pith.science/paper/C4N5ULWR"},"agent_actions":{"view_html":"https://pith.science/pith/C4N5ULWRII2SNJTLKQJJG4O5SW","download_json":"https://pith.science/pith/C4N5ULWRII2SNJTLKQJJG4O5SW.json","view_paper":"https://pith.science/paper/C4N5ULWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.06986&json=true","fetch_graph":"https://pith.science/api/pith-number/C4N5ULWRII2SNJTLKQJJG4O5SW/graph.json","fetch_events":"https://pith.science/api/pith-number/C4N5ULWRII2SNJTLKQJJG4O5SW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C4N5ULWRII2SNJTLKQJJG4O5SW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C4N5ULWRII2SNJTLKQJJG4O5SW/action/storage_attestation","attest_author":"https://pith.science/pith/C4N5ULWRII2SNJTLKQJJG4O5SW/action/author_attestation","sign_citation":"https://pith.science/pith/C4N5ULWRII2SNJTLKQJJG4O5SW/action/citation_signature","submit_replication":"https://pith.science/pith/C4N5ULWRII2SNJTLKQJJG4O5SW/action/replication_record"}},"created_at":"2026-07-05T07:54:49.272580+00:00","updated_at":"2026-07-05T07:54:49.272580+00:00"}