{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:5SEA3ZLIQVYPPPKNCBZZBNTHS2","short_pith_number":"pith:5SEA3ZLI","schema_version":"1.0","canonical_sha256":"ec880de5688570f7bd4d107390b66796839dd5097cdf9c5600e6b318d5a750a8","source":{"kind":"arxiv","id":"2112.10943","version":3},"attestation_state":"computed","paper":{"title":"Shortcuts to Quantum Approximate Optimization Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guo-Ping Guo, Menghan Dou, Yahui Chai, Ye Li, Yong-Jian Han, Yu-Chun Wu","submitted_at":"2021-12-21T02:24:19Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) is a quantum-classical hybrid algorithm intending to find the ground state of a target Hamiltonian. Theoretically, QAOA can obtain the approximate solution if the quantum circuit is deep enough. Actually, the performance of QAOA decreases practically if the quantum circuit is deep since near-term devices are not noise-free and the errors caused by noise accumulate as the quantum circuit increases. In order to reduce the depth of quantum circuits, we propose a new ansatz dubbed as \"Shortcuts to QAOA\" (S-QAOA), S-QAOA provides shortcuts to th"},"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":"2112.10943","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-21T02:24:19Z","cross_cats_sorted":[],"title_canon_sha256":"aad2aab2664a17af11e99ad083049224b81fa34cac6141c15949f5d28c892fc1","abstract_canon_sha256":"5ceaac9543cda86e6dd23b26fe28fc00ab9fb4d4cc93544b90cdcf8855648a27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:17:19.501569Z","signature_b64":"yKGvWIEDMg9ilvtUvDn902/T94j9EXM+NMsHKhUEOeCY7fgDw5QoyQRzSk6jl8P0FmeH8RQYfY2HLKD8AQQjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec880de5688570f7bd4d107390b66796839dd5097cdf9c5600e6b318d5a750a8","last_reissued_at":"2026-07-05T04:17:19.501062Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:17:19.501062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shortcuts to Quantum Approximate Optimization Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guo-Ping Guo, Menghan Dou, Yahui Chai, Ye Li, Yong-Jian Han, Yu-Chun Wu","submitted_at":"2021-12-21T02:24:19Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) is a quantum-classical hybrid algorithm intending to find the ground state of a target Hamiltonian. Theoretically, QAOA can obtain the approximate solution if the quantum circuit is deep enough. Actually, the performance of QAOA decreases practically if the quantum circuit is deep since near-term devices are not noise-free and the errors caused by noise accumulate as the quantum circuit increases. In order to reduce the depth of quantum circuits, we propose a new ansatz dubbed as \"Shortcuts to QAOA\" (S-QAOA), S-QAOA provides shortcuts to th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.10943","kind":"arxiv","version":3},"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/2112.10943/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":"2112.10943","created_at":"2026-07-05T04:17:19.501126+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.10943v3","created_at":"2026-07-05T04:17:19.501126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.10943","created_at":"2026-07-05T04:17:19.501126+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SEA3ZLIQVYP","created_at":"2026-07-05T04:17:19.501126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SEA3ZLIQVYPPPKN","created_at":"2026-07-05T04:17:19.501126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SEA3ZLI","created_at":"2026-07-05T04:17:19.501126+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/5SEA3ZLIQVYPPPKNCBZZBNTHS2","json":"https://pith.science/pith/5SEA3ZLIQVYPPPKNCBZZBNTHS2.json","graph_json":"https://pith.science/api/pith-number/5SEA3ZLIQVYPPPKNCBZZBNTHS2/graph.json","events_json":"https://pith.science/api/pith-number/5SEA3ZLIQVYPPPKNCBZZBNTHS2/events.json","paper":"https://pith.science/paper/5SEA3ZLI"},"agent_actions":{"view_html":"https://pith.science/pith/5SEA3ZLIQVYPPPKNCBZZBNTHS2","download_json":"https://pith.science/pith/5SEA3ZLIQVYPPPKNCBZZBNTHS2.json","view_paper":"https://pith.science/paper/5SEA3ZLI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.10943&json=true","fetch_graph":"https://pith.science/api/pith-number/5SEA3ZLIQVYPPPKNCBZZBNTHS2/graph.json","fetch_events":"https://pith.science/api/pith-number/5SEA3ZLIQVYPPPKNCBZZBNTHS2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SEA3ZLIQVYPPPKNCBZZBNTHS2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SEA3ZLIQVYPPPKNCBZZBNTHS2/action/storage_attestation","attest_author":"https://pith.science/pith/5SEA3ZLIQVYPPPKNCBZZBNTHS2/action/author_attestation","sign_citation":"https://pith.science/pith/5SEA3ZLIQVYPPPKNCBZZBNTHS2/action/citation_signature","submit_replication":"https://pith.science/pith/5SEA3ZLIQVYPPPKNCBZZBNTHS2/action/replication_record"}},"created_at":"2026-07-05T04:17:19.501126+00:00","updated_at":"2026-07-05T04:17:19.501126+00:00"}