{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OTZ6IFBTGFKJ4TG56AQQR6YPGV","short_pith_number":"pith:OTZ6IFBT","schema_version":"1.0","canonical_sha256":"74f3e4143331549e4cddf02108fb0f3572182cedb770e4210582b4cf360cbbce","source":{"kind":"arxiv","id":"2507.22550","version":1},"attestation_state":"computed","paper":{"title":"Hamiltonian Expressibility for Ansatz Selection in Variational Quantum Algorithms","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Filippo Brozzi, Filippo Caruso, Gloria Turati, Maurizio Ferrari Dacrema, Paolo Cremonesi","submitted_at":"2025-07-30T10:23:54Z","abstract_excerpt":"In the context of Variational Quantum Algorithms (VQAs), selecting an appropriate ansatz is crucial for efficient problem-solving. Hamiltonian expressibility has been introduced as a metric to quantify a circuit's ability to uniformly explore the energy landscape associated with a Hamiltonian ground state search problem. However, its influence on solution quality remains largely unexplored. In this work, we estimate the Hamiltonian expressibility of a well-defined set of circuits applied to various Hamiltonians using a Monte Carlo-based approach. We analyze how ansatz depth influences expressi"},"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":"2507.22550","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-30T10:23:54Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"9a9399b328d75c670d982d790696e9ca49a7d097caf33e2440717b237da8d87f","abstract_canon_sha256":"456810b1eb6b3d39d44addfd2a85a4520ba77524c6b934b298e48b9b31894cc8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:45:44.426086Z","signature_b64":"9wZ2ssp2VNKwMWZsAz6tzElCSS2mpcgIEayqontz/KheqUBPFFbkR8jRJjr/3/DaZBGYmmPyfkKKxV/9IVqWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74f3e4143331549e4cddf02108fb0f3572182cedb770e4210582b4cf360cbbce","last_reissued_at":"2026-07-05T11:45:44.425608Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:45:44.425608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamiltonian Expressibility for Ansatz Selection in Variational Quantum Algorithms","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Filippo Brozzi, Filippo Caruso, Gloria Turati, Maurizio Ferrari Dacrema, Paolo Cremonesi","submitted_at":"2025-07-30T10:23:54Z","abstract_excerpt":"In the context of Variational Quantum Algorithms (VQAs), selecting an appropriate ansatz is crucial for efficient problem-solving. Hamiltonian expressibility has been introduced as a metric to quantify a circuit's ability to uniformly explore the energy landscape associated with a Hamiltonian ground state search problem. However, its influence on solution quality remains largely unexplored. In this work, we estimate the Hamiltonian expressibility of a well-defined set of circuits applied to various Hamiltonians using a Monte Carlo-based approach. We analyze how ansatz depth influences expressi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.22550","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/2507.22550/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":"2507.22550","created_at":"2026-07-05T11:45:44.425673+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.22550v1","created_at":"2026-07-05T11:45:44.425673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.22550","created_at":"2026-07-05T11:45:44.425673+00:00"},{"alias_kind":"pith_short_12","alias_value":"OTZ6IFBTGFKJ","created_at":"2026-07-05T11:45:44.425673+00:00"},{"alias_kind":"pith_short_16","alias_value":"OTZ6IFBTGFKJ4TG5","created_at":"2026-07-05T11:45:44.425673+00:00"},{"alias_kind":"pith_short_8","alias_value":"OTZ6IFBT","created_at":"2026-07-05T11:45:44.425673+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.04955","citing_title":"Expressibility, Noise, and Error Mitigation in VQE Ansatz Selection","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OTZ6IFBTGFKJ4TG56AQQR6YPGV","json":"https://pith.science/pith/OTZ6IFBTGFKJ4TG56AQQR6YPGV.json","graph_json":"https://pith.science/api/pith-number/OTZ6IFBTGFKJ4TG56AQQR6YPGV/graph.json","events_json":"https://pith.science/api/pith-number/OTZ6IFBTGFKJ4TG56AQQR6YPGV/events.json","paper":"https://pith.science/paper/OTZ6IFBT"},"agent_actions":{"view_html":"https://pith.science/pith/OTZ6IFBTGFKJ4TG56AQQR6YPGV","download_json":"https://pith.science/pith/OTZ6IFBTGFKJ4TG56AQQR6YPGV.json","view_paper":"https://pith.science/paper/OTZ6IFBT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.22550&json=true","fetch_graph":"https://pith.science/api/pith-number/OTZ6IFBTGFKJ4TG56AQQR6YPGV/graph.json","fetch_events":"https://pith.science/api/pith-number/OTZ6IFBTGFKJ4TG56AQQR6YPGV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OTZ6IFBTGFKJ4TG56AQQR6YPGV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OTZ6IFBTGFKJ4TG56AQQR6YPGV/action/storage_attestation","attest_author":"https://pith.science/pith/OTZ6IFBTGFKJ4TG56AQQR6YPGV/action/author_attestation","sign_citation":"https://pith.science/pith/OTZ6IFBTGFKJ4TG56AQQR6YPGV/action/citation_signature","submit_replication":"https://pith.science/pith/OTZ6IFBTGFKJ4TG56AQQR6YPGV/action/replication_record"}},"created_at":"2026-07-05T11:45:44.425673+00:00","updated_at":"2026-07-05T11:45:44.425673+00:00"}