{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JRBGWTYDJ5DTXEWWAP4LV7WQOM","short_pith_number":"pith:JRBGWTYD","schema_version":"1.0","canonical_sha256":"4c426b4f034f473b92d603f8bafed07335be257ff12ac35e32f61ad3af444c4b","source":{"kind":"arxiv","id":"2212.09205","version":1},"attestation_state":"computed","paper":{"title":"Quantum algorithms for generator coordinate methods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ang Li, Bo Peng, Karol Kowalski, Muqing Zheng, Nathan Wiebe, Xiu Yang","submitted_at":"2022-12-19T01:22:19Z","abstract_excerpt":"This paper discusses quantum algorithms for the generator coordinate method (GCM) that can be used to benchmark molecular systems. The GCM formalism defined by exponential operators with exponents defined through generators of the Fermionic U(N) Lie algebra (Thouless theorem) offers a possibility of probing large sub-spaces using low-depth quantum circuits. In the present studies, we illustrate the performance of the quantum algorithm for constructing a discretized form of the Hill-Wheeler equation for ground and excited state energies. We also generalize the standard GCM formulation to multi-"},"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":"2212.09205","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-12-19T01:22:19Z","cross_cats_sorted":[],"title_canon_sha256":"ed10960889b60f87d4c2efb96ca63e5b8e842929cfa2552f5300008ab23dc880","abstract_canon_sha256":"70387ae5caa21991d4f3b059eb6ecd8a018d010eab389ad1df79914b18405220"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:44:16.148265Z","signature_b64":"HsHWNn1AL6/Q4IWawGlNVDR9EmMS7/KIEpv8E1TAYKP5OQY0HJRO8VCgIFoCRqC+TSHzfJahIW/Kvj/7dzv4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c426b4f034f473b92d603f8bafed07335be257ff12ac35e32f61ad3af444c4b","last_reissued_at":"2026-07-05T07:44:16.147778Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:44:16.147778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum algorithms for generator coordinate methods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ang Li, Bo Peng, Karol Kowalski, Muqing Zheng, Nathan Wiebe, Xiu Yang","submitted_at":"2022-12-19T01:22:19Z","abstract_excerpt":"This paper discusses quantum algorithms for the generator coordinate method (GCM) that can be used to benchmark molecular systems. The GCM formalism defined by exponential operators with exponents defined through generators of the Fermionic U(N) Lie algebra (Thouless theorem) offers a possibility of probing large sub-spaces using low-depth quantum circuits. In the present studies, we illustrate the performance of the quantum algorithm for constructing a discretized form of the Hill-Wheeler equation for ground and excited state energies. We also generalize the standard GCM formulation to multi-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.09205","kind":"arxiv","version":1},"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/2212.09205/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":"2212.09205","created_at":"2026-07-05T07:44:16.147829+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.09205v1","created_at":"2026-07-05T07:44:16.147829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.09205","created_at":"2026-07-05T07:44:16.147829+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRBGWTYDJ5DT","created_at":"2026-07-05T07:44:16.147829+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRBGWTYDJ5DTXEWW","created_at":"2026-07-05T07:44:16.147829+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRBGWTYD","created_at":"2026-07-05T07:44:16.147829+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.18594","citing_title":"Systematic improvement of the quantum approximate optimisation ansatz for combinatorial optimisation using quantum subspace expansion","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JRBGWTYDJ5DTXEWWAP4LV7WQOM","json":"https://pith.science/pith/JRBGWTYDJ5DTXEWWAP4LV7WQOM.json","graph_json":"https://pith.science/api/pith-number/JRBGWTYDJ5DTXEWWAP4LV7WQOM/graph.json","events_json":"https://pith.science/api/pith-number/JRBGWTYDJ5DTXEWWAP4LV7WQOM/events.json","paper":"https://pith.science/paper/JRBGWTYD"},"agent_actions":{"view_html":"https://pith.science/pith/JRBGWTYDJ5DTXEWWAP4LV7WQOM","download_json":"https://pith.science/pith/JRBGWTYDJ5DTXEWWAP4LV7WQOM.json","view_paper":"https://pith.science/paper/JRBGWTYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.09205&json=true","fetch_graph":"https://pith.science/api/pith-number/JRBGWTYDJ5DTXEWWAP4LV7WQOM/graph.json","fetch_events":"https://pith.science/api/pith-number/JRBGWTYDJ5DTXEWWAP4LV7WQOM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRBGWTYDJ5DTXEWWAP4LV7WQOM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRBGWTYDJ5DTXEWWAP4LV7WQOM/action/storage_attestation","attest_author":"https://pith.science/pith/JRBGWTYDJ5DTXEWWAP4LV7WQOM/action/author_attestation","sign_citation":"https://pith.science/pith/JRBGWTYDJ5DTXEWWAP4LV7WQOM/action/citation_signature","submit_replication":"https://pith.science/pith/JRBGWTYDJ5DTXEWWAP4LV7WQOM/action/replication_record"}},"created_at":"2026-07-05T07:44:16.147829+00:00","updated_at":"2026-07-05T07:44:16.147829+00:00"}