{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GDPDLJTUYONT5PJCS4RFVRUESN","short_pith_number":"pith:GDPDLJTU","schema_version":"1.0","canonical_sha256":"30de35a674c39b3ebd2297225ac6849347ee0edd9dc80b62b80ff4bccd26a358","source":{"kind":"arxiv","id":"2606.04096","version":1},"attestation_state":"computed","paper":{"title":"Better Pauli Channel Learning with Maximum Likelihood Estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alireza Seif, Bryan K. Clark, Daniel Belkin, Ewout van den Berg, Faisal Alam, Matthew Thibodeau","submitted_at":"2026-06-02T18:01:06Z","abstract_excerpt":"Error mitigation in a noisy quantum device requires a very good estimate of the noise channel. The accuracy of probabilistic error cancellation is often limited by the high sample complexity of channel tomography. In principle, optimal sample complexity is attained by maximum likelihood estimation (MLE), but MLE is computationally challenging. We show that MLE can be made computationally tractable in certain cases of interest. For the common case of a 1D-local sparse Pauli-Lindblad channel, the likelihood function reduces to an efficiently-evaluable Bayesian network. We show that the resulting"},"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":"2606.04096","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-02T18:01:06Z","cross_cats_sorted":[],"title_canon_sha256":"7f2e586095f343a02375ebb93826e26baef486f4cfc520bda1d9a4da24a47a45","abstract_canon_sha256":"8fed9f8b1eee9559c4058a52f989d63db58b71df55ec27728f3432f354a0a0b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T00:06:46.498915Z","signature_b64":"rpFOq8VTyGKZNRIvcl62BBk94fjdxMl6q/V2uXwrfGiIvfVG5A98xjZCbZjIuMiIbVzMaJabWZzji5Qh2ywRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30de35a674c39b3ebd2297225ac6849347ee0edd9dc80b62b80ff4bccd26a358","last_reissued_at":"2026-06-04T00:06:46.498536Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T00:06:46.498536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Better Pauli Channel Learning with Maximum Likelihood Estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alireza Seif, Bryan K. Clark, Daniel Belkin, Ewout van den Berg, Faisal Alam, Matthew Thibodeau","submitted_at":"2026-06-02T18:01:06Z","abstract_excerpt":"Error mitigation in a noisy quantum device requires a very good estimate of the noise channel. The accuracy of probabilistic error cancellation is often limited by the high sample complexity of channel tomography. In principle, optimal sample complexity is attained by maximum likelihood estimation (MLE), but MLE is computationally challenging. We show that MLE can be made computationally tractable in certain cases of interest. For the common case of a 1D-local sparse Pauli-Lindblad channel, the likelihood function reduces to an efficiently-evaluable Bayesian network. We show that the resulting"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04096","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/2606.04096/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":"2606.04096","created_at":"2026-06-04T00:06:46.498602+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.04096v1","created_at":"2026-06-04T00:06:46.498602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04096","created_at":"2026-06-04T00:06:46.498602+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDPDLJTUYONT","created_at":"2026-06-04T00:06:46.498602+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDPDLJTUYONT5PJC","created_at":"2026-06-04T00:06:46.498602+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDPDLJTU","created_at":"2026-06-04T00:06:46.498602+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/GDPDLJTUYONT5PJCS4RFVRUESN","json":"https://pith.science/pith/GDPDLJTUYONT5PJCS4RFVRUESN.json","graph_json":"https://pith.science/api/pith-number/GDPDLJTUYONT5PJCS4RFVRUESN/graph.json","events_json":"https://pith.science/api/pith-number/GDPDLJTUYONT5PJCS4RFVRUESN/events.json","paper":"https://pith.science/paper/GDPDLJTU"},"agent_actions":{"view_html":"https://pith.science/pith/GDPDLJTUYONT5PJCS4RFVRUESN","download_json":"https://pith.science/pith/GDPDLJTUYONT5PJCS4RFVRUESN.json","view_paper":"https://pith.science/paper/GDPDLJTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.04096&json=true","fetch_graph":"https://pith.science/api/pith-number/GDPDLJTUYONT5PJCS4RFVRUESN/graph.json","fetch_events":"https://pith.science/api/pith-number/GDPDLJTUYONT5PJCS4RFVRUESN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDPDLJTUYONT5PJCS4RFVRUESN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDPDLJTUYONT5PJCS4RFVRUESN/action/storage_attestation","attest_author":"https://pith.science/pith/GDPDLJTUYONT5PJCS4RFVRUESN/action/author_attestation","sign_citation":"https://pith.science/pith/GDPDLJTUYONT5PJCS4RFVRUESN/action/citation_signature","submit_replication":"https://pith.science/pith/GDPDLJTUYONT5PJCS4RFVRUESN/action/replication_record"}},"created_at":"2026-06-04T00:06:46.498602+00:00","updated_at":"2026-06-04T00:06:46.498602+00:00"}