{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SVERUCA4DADN62UA7Q2P5VGJBH","short_pith_number":"pith:SVERUCA4","schema_version":"1.0","canonical_sha256":"95491a081c1806df6a80fc34fed4c909f876c1d109ed4a2fc8ccfe34335ffd15","source":{"kind":"arxiv","id":"2603.13160","version":2},"attestation_state":"computed","paper":{"title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["physics.chem-ph"],"primary_cat":"quant-ph","authors_text":"Konstantinos Georgopoulos, Manqoba Q. Hlatshwayo, Theodoros Kapourniotis, Vincent Graves","submitted_at":"2026-03-13T16:51:19Z","abstract_excerpt":"Quantum algorithms for selecting a subspace of Hamiltonians to diagonalize have emerged as a promising alternative to variational algorithms in the NISQ era. So far, such algorithms, which include the quantum selected configuration interaction (QSCI) and sample-based quantum diagonalization (SQD), have been formulated within second-quantization in Fock space, which leads to inefficient usage of qubit resources. We introduce the first QSCI algorithm developed in the CI-matrix (CIM) framework, which is known to have optimal qubit scaling of exactly $\\lceil \\log_2 (N) \\rceil$ where $N$ is the siz"},"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":"2603.13160","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-03-13T16:51:19Z","cross_cats_sorted":["physics.chem-ph"],"title_canon_sha256":"a40416805bb73a05507ba2c807a5bb071144f4907cd50ff26c3da6bdb779a5f6","abstract_canon_sha256":"f5c91be8bd118c76f78b31f6b5bcf4c3e63ca3493ff2586a8813e321f430822a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95491a081c1806df6a80fc34fed4c909f876c1d109ed4a2fc8ccfe34335ffd15","last_reissued_at":"2026-07-30T01:19:40.910923Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:19:40.910923Z"},"graph_snapshot":{"paper":{"title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["physics.chem-ph"],"primary_cat":"quant-ph","authors_text":"Konstantinos Georgopoulos, Manqoba Q. Hlatshwayo, Theodoros Kapourniotis, Vincent Graves","submitted_at":"2026-03-13T16:51:19Z","abstract_excerpt":"Quantum algorithms for selecting a subspace of Hamiltonians to diagonalize have emerged as a promising alternative to variational algorithms in the NISQ era. So far, such algorithms, which include the quantum selected configuration interaction (QSCI) and sample-based quantum diagonalization (SQD), have been formulated within second-quantization in Fock space, which leads to inefficient usage of qubit resources. We introduce the first QSCI algorithm developed in the CI-matrix (CIM) framework, which is known to have optimal qubit scaling of exactly $\\lceil \\log_2 (N) \\rceil$ where $N$ is the siz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.13160","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/2603.13160/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":"2603.13160","created_at":"2026-07-30T01:19:40.916051+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.13160v2","created_at":"2026-07-30T01:19:40.916051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.13160","created_at":"2026-07-30T01:19:40.916051+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVERUCA4DADN","created_at":"2026-07-30T01:19:40.916051+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVERUCA4DADN62UA","created_at":"2026-07-30T01:19:40.916051+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVERUCA4","created_at":"2026-07-30T01:19:40.916051+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/SVERUCA4DADN62UA7Q2P5VGJBH","json":"https://pith.science/pith/SVERUCA4DADN62UA7Q2P5VGJBH.json","graph_json":"https://pith.science/api/pith-number/SVERUCA4DADN62UA7Q2P5VGJBH/graph.json","events_json":"https://pith.science/api/pith-number/SVERUCA4DADN62UA7Q2P5VGJBH/events.json","paper":"https://pith.science/paper/SVERUCA4"},"agent_actions":{"view_html":"https://pith.science/pith/SVERUCA4DADN62UA7Q2P5VGJBH","download_json":"https://pith.science/pith/SVERUCA4DADN62UA7Q2P5VGJBH.json","view_paper":"https://pith.science/paper/SVERUCA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.13160&json=true","fetch_graph":"https://pith.science/api/pith-number/SVERUCA4DADN62UA7Q2P5VGJBH/graph.json","fetch_events":"https://pith.science/api/pith-number/SVERUCA4DADN62UA7Q2P5VGJBH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVERUCA4DADN62UA7Q2P5VGJBH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVERUCA4DADN62UA7Q2P5VGJBH/action/storage_attestation","attest_author":"https://pith.science/pith/SVERUCA4DADN62UA7Q2P5VGJBH/action/author_attestation","sign_citation":"https://pith.science/pith/SVERUCA4DADN62UA7Q2P5VGJBH/action/citation_signature","submit_replication":"https://pith.science/pith/SVERUCA4DADN62UA7Q2P5VGJBH/action/replication_record"}},"created_at":"2026-07-30T01:19:40.916051+00:00","updated_at":"2026-07-30T01:19:40.916051+00:00"}