{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:J2XHA54DKYF743WO7DSICEXUUD","short_pith_number":"pith:J2XHA54D","schema_version":"1.0","canonical_sha256":"4eae707783560bfe6ecef8e48112f4a0c3da4ee1caf4a331af35774fabfdb727","source":{"kind":"arxiv","id":"2305.18514","version":1},"attestation_state":"computed","paper":{"title":"Polynomial-time classical sampling of high-temperature quantum Gibbs states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.CC","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Andrew Lucas, Chao Yin","submitted_at":"2023-05-29T18:00:00Z","abstract_excerpt":"The computational complexity of simulating quantum many-body systems generally scales exponentially with the number of particles. This enormous computational cost prohibits first principles simulations of many important problems throughout science, ranging from simulating quantum chemistry to discovering the thermodynamic phase diagram of quantum materials or high-density neutron stars. We present a classical algorithm that samples from a high-temperature quantum Gibbs state in a computational (product state) basis. The runtime grows polynomially with the number of particles, while error vanis"},"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":"2305.18514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-05-29T18:00:00Z","cross_cats_sorted":["cond-mat.stat-mech","cs.CC","math-ph","math.MP"],"title_canon_sha256":"4e84fc6f91bd817d4e7647d7e945489b5ce9c69bf4e24547a1872b1bbb7ab4b5","abstract_canon_sha256":"57a8a83cf003d686386db24a634a6eecedc86b938d7ae25d2fc280afb04e09b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:15:01.879133Z","signature_b64":"9Z8KJYxyUYubWPiXxRPstqPTOosks1p4LE2r/gJXnE2vHfbyeAROTar5OSjZHfjreYJNlccKjyC4c1SVCscYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4eae707783560bfe6ecef8e48112f4a0c3da4ee1caf4a331af35774fabfdb727","last_reissued_at":"2026-07-05T06:15:01.878659Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:15:01.878659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial-time classical sampling of high-temperature quantum Gibbs states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.CC","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Andrew Lucas, Chao Yin","submitted_at":"2023-05-29T18:00:00Z","abstract_excerpt":"The computational complexity of simulating quantum many-body systems generally scales exponentially with the number of particles. This enormous computational cost prohibits first principles simulations of many important problems throughout science, ranging from simulating quantum chemistry to discovering the thermodynamic phase diagram of quantum materials or high-density neutron stars. We present a classical algorithm that samples from a high-temperature quantum Gibbs state in a computational (product state) basis. The runtime grows polynomially with the number of particles, while error vanis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.18514","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/2305.18514/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":"2305.18514","created_at":"2026-07-05T06:15:01.878718+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.18514v1","created_at":"2026-07-05T06:15:01.878718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.18514","created_at":"2026-07-05T06:15:01.878718+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2XHA54DKYF7","created_at":"2026-07-05T06:15:01.878718+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2XHA54DKYF743WO","created_at":"2026-07-05T06:15:01.878718+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2XHA54D","created_at":"2026-07-05T06:15:01.878718+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26090","citing_title":"Fast mixing of all-to-all quantum systems at high temperatures","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2606.26162","citing_title":"Dissipative Quantum Multiplicative Weights with Sampling Feedback: A Classically Hard Primitive Realized via Engineered Open-System Dynamics","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2509.09517","citing_title":"Exponential Lindbladian fast forwarding and exponential amplification of certain Gibbs state properties","ref_index":79,"is_internal_anchor":false},{"citing_arxiv_id":"2410.13844","citing_title":"Post-measurement Quantum Monte Carlo","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J2XHA54DKYF743WO7DSICEXUUD","json":"https://pith.science/pith/J2XHA54DKYF743WO7DSICEXUUD.json","graph_json":"https://pith.science/api/pith-number/J2XHA54DKYF743WO7DSICEXUUD/graph.json","events_json":"https://pith.science/api/pith-number/J2XHA54DKYF743WO7DSICEXUUD/events.json","paper":"https://pith.science/paper/J2XHA54D"},"agent_actions":{"view_html":"https://pith.science/pith/J2XHA54DKYF743WO7DSICEXUUD","download_json":"https://pith.science/pith/J2XHA54DKYF743WO7DSICEXUUD.json","view_paper":"https://pith.science/paper/J2XHA54D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.18514&json=true","fetch_graph":"https://pith.science/api/pith-number/J2XHA54DKYF743WO7DSICEXUUD/graph.json","fetch_events":"https://pith.science/api/pith-number/J2XHA54DKYF743WO7DSICEXUUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2XHA54DKYF743WO7DSICEXUUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2XHA54DKYF743WO7DSICEXUUD/action/storage_attestation","attest_author":"https://pith.science/pith/J2XHA54DKYF743WO7DSICEXUUD/action/author_attestation","sign_citation":"https://pith.science/pith/J2XHA54DKYF743WO7DSICEXUUD/action/citation_signature","submit_replication":"https://pith.science/pith/J2XHA54DKYF743WO7DSICEXUUD/action/replication_record"}},"created_at":"2026-07-05T06:15:01.878718+00:00","updated_at":"2026-07-05T06:15:01.878718+00:00"}