{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TBME52XO2337MZKSQCLUQW65YL","short_pith_number":"pith:TBME52XO","schema_version":"1.0","canonical_sha256":"98584eeaeed6f7f665528097485bddc2e912e4e61c3f797ccf881cae7ad3478e","source":{"kind":"arxiv","id":"2302.03394","version":1},"attestation_state":"computed","paper":{"title":"Sparse random Hamiltonians are quantumly easy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"quant-ph","authors_text":"Alexander M. Dalzell, Chi-Fang (Anthony) Chen, Fernando G.S.L. Brand\\~ao, Joel A. Tropp, Mario Berta","submitted_at":"2023-02-07T10:57:36Z","abstract_excerpt":"A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. For this task, there is a well-studied quantum algorithm that performs quantum phase estimation on an initial trial state that has a nonnegligible overlap with a low-energy state. However, it is notoriously hard to give theoretical guarantees that such a trial state can be prepared efficiently. Moreover, the heuristic proposals that are currently available, such as with adiabatic state preparation, appear insufficient in practical cases. This paper shows that, for most random sparse "},"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":"2302.03394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-02-07T10:57:36Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"14c756077a77014e441dd3f616bfa9aca5c51c68993d82d0b76888e63c145f12","abstract_canon_sha256":"76b6b535547c9e483ee8d64fb53d4e075a311791b5969ceb6f635e9049e6e4d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:29:23.440742Z","signature_b64":"SASiNIz59LZ4BMmc4uKrk8ZdhDGWnDbc1Wvt6awUZj7LBW2sxpA+IP9lruzirpP00YyNDdGYRM1XEojgpaCsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98584eeaeed6f7f665528097485bddc2e912e4e61c3f797ccf881cae7ad3478e","last_reissued_at":"2026-07-05T09:29:23.440099Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:29:23.440099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse random Hamiltonians are quantumly easy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"quant-ph","authors_text":"Alexander M. Dalzell, Chi-Fang (Anthony) Chen, Fernando G.S.L. Brand\\~ao, Joel A. Tropp, Mario Berta","submitted_at":"2023-02-07T10:57:36Z","abstract_excerpt":"A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. For this task, there is a well-studied quantum algorithm that performs quantum phase estimation on an initial trial state that has a nonnegligible overlap with a low-energy state. However, it is notoriously hard to give theoretical guarantees that such a trial state can be prepared efficiently. Moreover, the heuristic proposals that are currently available, such as with adiabatic state preparation, appear insufficient in practical cases. This paper shows that, for most random sparse "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.03394","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/2302.03394/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":"2302.03394","created_at":"2026-07-05T09:29:23.440173+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.03394v1","created_at":"2026-07-05T09:29:23.440173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.03394","created_at":"2026-07-05T09:29:23.440173+00:00"},{"alias_kind":"pith_short_12","alias_value":"TBME52XO2337","created_at":"2026-07-05T09:29:23.440173+00:00"},{"alias_kind":"pith_short_16","alias_value":"TBME52XO2337MZKS","created_at":"2026-07-05T09:29:23.440173+00:00"},{"alias_kind":"pith_short_8","alias_value":"TBME52XO","created_at":"2026-07-05T09:29:23.440173+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22743","citing_title":"Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TBME52XO2337MZKSQCLUQW65YL","json":"https://pith.science/pith/TBME52XO2337MZKSQCLUQW65YL.json","graph_json":"https://pith.science/api/pith-number/TBME52XO2337MZKSQCLUQW65YL/graph.json","events_json":"https://pith.science/api/pith-number/TBME52XO2337MZKSQCLUQW65YL/events.json","paper":"https://pith.science/paper/TBME52XO"},"agent_actions":{"view_html":"https://pith.science/pith/TBME52XO2337MZKSQCLUQW65YL","download_json":"https://pith.science/pith/TBME52XO2337MZKSQCLUQW65YL.json","view_paper":"https://pith.science/paper/TBME52XO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.03394&json=true","fetch_graph":"https://pith.science/api/pith-number/TBME52XO2337MZKSQCLUQW65YL/graph.json","fetch_events":"https://pith.science/api/pith-number/TBME52XO2337MZKSQCLUQW65YL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TBME52XO2337MZKSQCLUQW65YL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TBME52XO2337MZKSQCLUQW65YL/action/storage_attestation","attest_author":"https://pith.science/pith/TBME52XO2337MZKSQCLUQW65YL/action/author_attestation","sign_citation":"https://pith.science/pith/TBME52XO2337MZKSQCLUQW65YL/action/citation_signature","submit_replication":"https://pith.science/pith/TBME52XO2337MZKSQCLUQW65YL/action/replication_record"}},"created_at":"2026-07-05T09:29:23.440173+00:00","updated_at":"2026-07-05T09:29:23.440173+00:00"}