{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RQ66EB52AWIACIMD5HWSMEWZFG","short_pith_number":"pith:RQ66EB52","schema_version":"1.0","canonical_sha256":"8c3de207ba0590012183e9ed2612d929ab7d6fe69664cada8e6f81581f4dc952","source":{"kind":"arxiv","id":"2211.08737","version":3},"attestation_state":"computed","paper":{"title":"Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"quant-ph","authors_text":"Chu Guo, Gui-Lu Long, Guojing Tian, He-Liang Huang, Shi-Jie Wei, Wan-Su Bao, Xiaoming Sun, Xiao-Yue Xu","submitted_at":"2022-11-16T07:53:15Z","abstract_excerpt":"Quantum computing is a game-changing technology for global academia, research centers and industries including computational science, mathematics, finance, pharmaceutical, materials science, chemistry and cryptography. Although it has seen a major boost in the last decade, we are still a long way from reaching the maturity of a full-fledged quantum computer. That said, we will be in the Noisy-Intermediate Scale Quantum (NISQ) era for a long time, working on dozens or even thousands of qubits quantum computing systems. An outstanding challenge, then, is to come up with an application that can r"},"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":"2211.08737","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-11-16T07:53:15Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"0e6d117a346f653e5b30031c7a65f50377594774118c0380c53f3cf748b1d8c5","abstract_canon_sha256":"93dc1481843961e95a66c21236cd7f4b5a9dc9e2df999cbfe42b1517436c3d9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:48:03.535489Z","signature_b64":"VXw0G1MIklZajTppOf3E1gPjvHQ911fMZvW91HcrTpLvhopH2JRbmaBcDlIOnlUSi/ctkTfHVxKmW754AirrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c3de207ba0590012183e9ed2612d929ab7d6fe69664cada8e6f81581f4dc952","last_reissued_at":"2026-07-05T05:48:03.535041Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:48:03.535041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"quant-ph","authors_text":"Chu Guo, Gui-Lu Long, Guojing Tian, He-Liang Huang, Shi-Jie Wei, Wan-Su Bao, Xiaoming Sun, Xiao-Yue Xu","submitted_at":"2022-11-16T07:53:15Z","abstract_excerpt":"Quantum computing is a game-changing technology for global academia, research centers and industries including computational science, mathematics, finance, pharmaceutical, materials science, chemistry and cryptography. Although it has seen a major boost in the last decade, we are still a long way from reaching the maturity of a full-fledged quantum computer. That said, we will be in the Noisy-Intermediate Scale Quantum (NISQ) era for a long time, working on dozens or even thousands of qubits quantum computing systems. An outstanding challenge, then, is to come up with an application that can r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.08737","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/2211.08737/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":"2211.08737","created_at":"2026-07-05T05:48:03.535099+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.08737v3","created_at":"2026-07-05T05:48:03.535099+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.08737","created_at":"2026-07-05T05:48:03.535099+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQ66EB52AWIA","created_at":"2026-07-05T05:48:03.535099+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQ66EB52AWIACIMD","created_at":"2026-07-05T05:48:03.535099+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQ66EB52","created_at":"2026-07-05T05:48:03.535099+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.17614","citing_title":"Comparing performance of variational quantum algorithm simulations on HPC systems","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RQ66EB52AWIACIMD5HWSMEWZFG","json":"https://pith.science/pith/RQ66EB52AWIACIMD5HWSMEWZFG.json","graph_json":"https://pith.science/api/pith-number/RQ66EB52AWIACIMD5HWSMEWZFG/graph.json","events_json":"https://pith.science/api/pith-number/RQ66EB52AWIACIMD5HWSMEWZFG/events.json","paper":"https://pith.science/paper/RQ66EB52"},"agent_actions":{"view_html":"https://pith.science/pith/RQ66EB52AWIACIMD5HWSMEWZFG","download_json":"https://pith.science/pith/RQ66EB52AWIACIMD5HWSMEWZFG.json","view_paper":"https://pith.science/paper/RQ66EB52","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.08737&json=true","fetch_graph":"https://pith.science/api/pith-number/RQ66EB52AWIACIMD5HWSMEWZFG/graph.json","fetch_events":"https://pith.science/api/pith-number/RQ66EB52AWIACIMD5HWSMEWZFG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQ66EB52AWIACIMD5HWSMEWZFG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQ66EB52AWIACIMD5HWSMEWZFG/action/storage_attestation","attest_author":"https://pith.science/pith/RQ66EB52AWIACIMD5HWSMEWZFG/action/author_attestation","sign_citation":"https://pith.science/pith/RQ66EB52AWIACIMD5HWSMEWZFG/action/citation_signature","submit_replication":"https://pith.science/pith/RQ66EB52AWIACIMD5HWSMEWZFG/action/replication_record"}},"created_at":"2026-07-05T05:48:03.535099+00:00","updated_at":"2026-07-05T05:48:03.535099+00:00"}