{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XCFZDCZEU3MYYYN6KPNU4XG54Y","short_pith_number":"pith:XCFZDCZE","schema_version":"1.0","canonical_sha256":"b88b918b24a6d98c61be53db4e5cdde613475a98a2244fb2c495adfc3e732d09","source":{"kind":"arxiv","id":"2312.17146","version":2},"attestation_state":"computed","paper":{"title":"Hamiltonian-based graph-state ansatz for variational quantum algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["physics.chem-ph"],"primary_cat":"quant-ph","authors_text":"Abhinav Anand, Kenneth R. Brown","submitted_at":"2023-12-28T17:28:23Z","abstract_excerpt":"One promising application of near-term quantum devices is to prepare trial wavefunctions using short circuits for solving different problems via variational algorithms. For this purpose, we introduce a new circuit design that combines graph-based diagonalization circuits with arbitrary single-qubit rotation gates to get Hamiltonian-based graph states ans\\\"atze (H-GSA). We test the accuracy of the proposed ansatz in estimating ground state energies of various molecules of size up to 12-qubits. Additionally, we compare the gate count and parameter number complexity of the proposed ansatz against"},"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":"2312.17146","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-12-28T17:28:23Z","cross_cats_sorted":["physics.chem-ph"],"title_canon_sha256":"4725d711a7d18a4d1d5a1717ac24ab8ac19107bd268af11f3843e11f567cab59","abstract_canon_sha256":"f1c722504fb451ec1e388ffaf3a4536e4378affb1f77d9c6583e27495e61530c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:04:11.167563Z","signature_b64":"OGVPC2HB6K7yuhOHFcomrPpb+LN3iveFKuL01h4gbjZe9AYqYH5OwKraym15iczCeF/VwcXaJob0vkygNamgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b88b918b24a6d98c61be53db4e5cdde613475a98a2244fb2c495adfc3e732d09","last_reissued_at":"2026-07-05T10:04:11.167128Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:04:11.167128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamiltonian-based graph-state ansatz for variational quantum algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["physics.chem-ph"],"primary_cat":"quant-ph","authors_text":"Abhinav Anand, Kenneth R. Brown","submitted_at":"2023-12-28T17:28:23Z","abstract_excerpt":"One promising application of near-term quantum devices is to prepare trial wavefunctions using short circuits for solving different problems via variational algorithms. For this purpose, we introduce a new circuit design that combines graph-based diagonalization circuits with arbitrary single-qubit rotation gates to get Hamiltonian-based graph states ans\\\"atze (H-GSA). We test the accuracy of the proposed ansatz in estimating ground state energies of various molecules of size up to 12-qubits. Additionally, we compare the gate count and parameter number complexity of the proposed ansatz against"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.17146","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/2312.17146/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":"2312.17146","created_at":"2026-07-05T10:04:11.167187+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.17146v2","created_at":"2026-07-05T10:04:11.167187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.17146","created_at":"2026-07-05T10:04:11.167187+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCFZDCZEU3MY","created_at":"2026-07-05T10:04:11.167187+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCFZDCZEU3MYYYN6","created_at":"2026-07-05T10:04:11.167187+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCFZDCZE","created_at":"2026-07-05T10:04:11.167187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.09173","citing_title":"Correction of circuit faults in a stacked quantum memory using rank-metric codes","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XCFZDCZEU3MYYYN6KPNU4XG54Y","json":"https://pith.science/pith/XCFZDCZEU3MYYYN6KPNU4XG54Y.json","graph_json":"https://pith.science/api/pith-number/XCFZDCZEU3MYYYN6KPNU4XG54Y/graph.json","events_json":"https://pith.science/api/pith-number/XCFZDCZEU3MYYYN6KPNU4XG54Y/events.json","paper":"https://pith.science/paper/XCFZDCZE"},"agent_actions":{"view_html":"https://pith.science/pith/XCFZDCZEU3MYYYN6KPNU4XG54Y","download_json":"https://pith.science/pith/XCFZDCZEU3MYYYN6KPNU4XG54Y.json","view_paper":"https://pith.science/paper/XCFZDCZE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.17146&json=true","fetch_graph":"https://pith.science/api/pith-number/XCFZDCZEU3MYYYN6KPNU4XG54Y/graph.json","fetch_events":"https://pith.science/api/pith-number/XCFZDCZEU3MYYYN6KPNU4XG54Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCFZDCZEU3MYYYN6KPNU4XG54Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCFZDCZEU3MYYYN6KPNU4XG54Y/action/storage_attestation","attest_author":"https://pith.science/pith/XCFZDCZEU3MYYYN6KPNU4XG54Y/action/author_attestation","sign_citation":"https://pith.science/pith/XCFZDCZEU3MYYYN6KPNU4XG54Y/action/citation_signature","submit_replication":"https://pith.science/pith/XCFZDCZEU3MYYYN6KPNU4XG54Y/action/replication_record"}},"created_at":"2026-07-05T10:04:11.167187+00:00","updated_at":"2026-07-05T10:04:11.167187+00:00"}