{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HPRZQMTNIW477JRLIQEL2JLDM7","short_pith_number":"pith:HPRZQMTN","schema_version":"1.0","canonical_sha256":"3be398326d45b9ffa62b4408bd256367fc83e2ad4374fb2d7f1279948f210984","source":{"kind":"arxiv","id":"2406.16023","version":1},"attestation_state":"computed","paper":{"title":"Quantum Metropolis Sampling via Weak Measurement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Jiaqing Jiang, Sandy Irani","submitted_at":"2024-06-23T06:05:01Z","abstract_excerpt":"Gibbs sampling is a crucial computational technique used in physics, statistics, and many other scientific fields. For classical Hamiltonians, the most commonly used Gibbs sampler is the Metropolis algorithm, known for having the Gibbs state as its unique fixed point. For quantum Hamiltonians, designing provably correct Gibbs samplers has been more challenging. [TOV+11] introduced a novel method that uses quantum phase estimation (QPE) and the Marriot-Watrous rewinding technique to mimic the classical Metropolis algorithm for quantum Hamiltonians. The analysis of their algorithm relies upon th"},"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":"2406.16023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-06-23T06:05:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"395eba92114f659a768bd913e400eef01cf17876236d94aee4d1b4538d1ca47e","abstract_canon_sha256":"4d8ca78c8c184b8f573be42f812b0d29c0d1940e6b97ded55defe8f60fe207e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:35:52.150691Z","signature_b64":"Ee5jyhxGh6FlLknEqpn6rkF4vHv7NDpuaTRtdUiUVQ+JTMWBM3+5CNDhceqGhXoAPn0jZjO5nlYR2gOoGphlBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3be398326d45b9ffa62b4408bd256367fc83e2ad4374fb2d7f1279948f210984","last_reissued_at":"2026-07-05T08:35:52.150224Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:35:52.150224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Metropolis Sampling via Weak Measurement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Jiaqing Jiang, Sandy Irani","submitted_at":"2024-06-23T06:05:01Z","abstract_excerpt":"Gibbs sampling is a crucial computational technique used in physics, statistics, and many other scientific fields. For classical Hamiltonians, the most commonly used Gibbs sampler is the Metropolis algorithm, known for having the Gibbs state as its unique fixed point. For quantum Hamiltonians, designing provably correct Gibbs samplers has been more challenging. [TOV+11] introduced a novel method that uses quantum phase estimation (QPE) and the Marriot-Watrous rewinding technique to mimic the classical Metropolis algorithm for quantum Hamiltonians. The analysis of their algorithm relies upon th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.16023","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/2406.16023/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":"2406.16023","created_at":"2026-07-05T08:35:52.150282+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.16023v1","created_at":"2026-07-05T08:35:52.150282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.16023","created_at":"2026-07-05T08:35:52.150282+00:00"},{"alias_kind":"pith_short_12","alias_value":"HPRZQMTNIW47","created_at":"2026-07-05T08:35:52.150282+00:00"},{"alias_kind":"pith_short_16","alias_value":"HPRZQMTNIW477JRL","created_at":"2026-07-05T08:35:52.150282+00:00"},{"alias_kind":"pith_short_8","alias_value":"HPRZQMTN","created_at":"2026-07-05T08:35:52.150282+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.26245","citing_title":"Preparing thermal states of frustrated quantum spin systems using 139 qubits","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2605.26245","citing_title":"Preparing thermal states of frustrated quantum spin systems using 139 qubits","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2505.00087","citing_title":"Quantum Glassiness From Efficient Learning","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2505.21255","citing_title":"Quantum Markov chain Monte Carlo method with programmable quantum simulators","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22996","citing_title":"Accelerating quantum Gibbs sampling without quantum walks","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21089","citing_title":"A rigorous quasipolynomial-time classical algorithm for SYK thermal expectations","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07214","citing_title":"Quantum Gibbs sampling through the detectability lemma","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HPRZQMTNIW477JRLIQEL2JLDM7","json":"https://pith.science/pith/HPRZQMTNIW477JRLIQEL2JLDM7.json","graph_json":"https://pith.science/api/pith-number/HPRZQMTNIW477JRLIQEL2JLDM7/graph.json","events_json":"https://pith.science/api/pith-number/HPRZQMTNIW477JRLIQEL2JLDM7/events.json","paper":"https://pith.science/paper/HPRZQMTN"},"agent_actions":{"view_html":"https://pith.science/pith/HPRZQMTNIW477JRLIQEL2JLDM7","download_json":"https://pith.science/pith/HPRZQMTNIW477JRLIQEL2JLDM7.json","view_paper":"https://pith.science/paper/HPRZQMTN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.16023&json=true","fetch_graph":"https://pith.science/api/pith-number/HPRZQMTNIW477JRLIQEL2JLDM7/graph.json","fetch_events":"https://pith.science/api/pith-number/HPRZQMTNIW477JRLIQEL2JLDM7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HPRZQMTNIW477JRLIQEL2JLDM7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HPRZQMTNIW477JRLIQEL2JLDM7/action/storage_attestation","attest_author":"https://pith.science/pith/HPRZQMTNIW477JRLIQEL2JLDM7/action/author_attestation","sign_citation":"https://pith.science/pith/HPRZQMTNIW477JRLIQEL2JLDM7/action/citation_signature","submit_replication":"https://pith.science/pith/HPRZQMTNIW477JRLIQEL2JLDM7/action/replication_record"}},"created_at":"2026-07-05T08:35:52.150282+00:00","updated_at":"2026-07-05T08:35:52.150282+00:00"}