{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HUBAGUJ7FTMLJ624EQWGJMV447","short_pith_number":"pith:HUBAGUJ7","schema_version":"1.0","canonical_sha256":"3d0203513f2cd8b4fb5c242c64b2bce7c3ec0f09cb41ce0924f64eb98a984a21","source":{"kind":"arxiv","id":"2602.04952","version":1},"attestation_state":"computed","paper":{"title":"Instance-optimal high-precision shadow tomography with few-copy measurements: A metrological approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"quant-ph","authors_text":"Senrui Chen, Sisi Zhou, Weiyuan Gong","submitted_at":"2026-02-04T19:00:00Z","abstract_excerpt":"We study the sample complexity of shadow tomography in the high-precision regime under realistic measurement constraints. Given an unknown $d$-dimensional quantum state $\\rho$ and a known set of observables $\\{O_i\\}_{i=1}^m$, the goal is to estimate expectation values $\\{\\mathrm{tr}(O_i\\rho)\\}_{i=1}^m$ to accuracy $\\epsilon$ in $L_p$-norm, using possibly adaptive measurements that act on $O(\\mathrm{polylog}(d))$ number of copies of $\\rho$ at a time. We focus on the regime where $\\epsilon$ is below an instance-dependent threshold.\n  Our main contribution is an instance-optimal characterization "},"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":"2602.04952","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-02-04T19:00:00Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"3c62221d8dccbe8f53655ea0631e4ca19eda456ea99f0b1ac6882c17def59114","abstract_canon_sha256":"de92fbf595f23255f1e11b20d23f20bca8cfdd49c40797694803bd1ccd9bbb77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T00:30:51.635955Z","signature_b64":"iFbN/FSuogQaoHU5VZSofkcKCc5E1htG+ITLyeJc2lFct2HgYgdG2wsDtDVcyN3WbfAaXT13Bj1OuHu0AwA5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d0203513f2cd8b4fb5c242c64b2bce7c3ec0f09cb41ce0924f64eb98a984a21","last_reissued_at":"2026-08-04T00:30:51.634242Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T00:30:51.634242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Instance-optimal high-precision shadow tomography with few-copy measurements: A metrological approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"quant-ph","authors_text":"Senrui Chen, Sisi Zhou, Weiyuan Gong","submitted_at":"2026-02-04T19:00:00Z","abstract_excerpt":"We study the sample complexity of shadow tomography in the high-precision regime under realistic measurement constraints. Given an unknown $d$-dimensional quantum state $\\rho$ and a known set of observables $\\{O_i\\}_{i=1}^m$, the goal is to estimate expectation values $\\{\\mathrm{tr}(O_i\\rho)\\}_{i=1}^m$ to accuracy $\\epsilon$ in $L_p$-norm, using possibly adaptive measurements that act on $O(\\mathrm{polylog}(d))$ number of copies of $\\rho$ at a time. We focus on the regime where $\\epsilon$ is below an instance-dependent threshold.\n  Our main contribution is an instance-optimal characterization "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.04952","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/2602.04952/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":"2602.04952","created_at":"2026-08-04T00:30:51.635381+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.04952v1","created_at":"2026-08-04T00:30:51.635381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.04952","created_at":"2026-08-04T00:30:51.635381+00:00"},{"alias_kind":"pith_short_12","alias_value":"HUBAGUJ7FTML","created_at":"2026-08-04T00:30:51.635381+00:00"},{"alias_kind":"pith_short_16","alias_value":"HUBAGUJ7FTMLJ624","created_at":"2026-08-04T00:30:51.635381+00:00"},{"alias_kind":"pith_short_8","alias_value":"HUBAGUJ7","created_at":"2026-08-04T00:30:51.635381+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.04096","citing_title":"Better Pauli Channel Learning with Maximum Likelihood Estimation","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HUBAGUJ7FTMLJ624EQWGJMV447","json":"https://pith.science/pith/HUBAGUJ7FTMLJ624EQWGJMV447.json","graph_json":"https://pith.science/api/pith-number/HUBAGUJ7FTMLJ624EQWGJMV447/graph.json","events_json":"https://pith.science/api/pith-number/HUBAGUJ7FTMLJ624EQWGJMV447/events.json","paper":"https://pith.science/paper/HUBAGUJ7"},"agent_actions":{"view_html":"https://pith.science/pith/HUBAGUJ7FTMLJ624EQWGJMV447","download_json":"https://pith.science/pith/HUBAGUJ7FTMLJ624EQWGJMV447.json","view_paper":"https://pith.science/paper/HUBAGUJ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.04952&json=true","fetch_graph":"https://pith.science/api/pith-number/HUBAGUJ7FTMLJ624EQWGJMV447/graph.json","fetch_events":"https://pith.science/api/pith-number/HUBAGUJ7FTMLJ624EQWGJMV447/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HUBAGUJ7FTMLJ624EQWGJMV447/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HUBAGUJ7FTMLJ624EQWGJMV447/action/storage_attestation","attest_author":"https://pith.science/pith/HUBAGUJ7FTMLJ624EQWGJMV447/action/author_attestation","sign_citation":"https://pith.science/pith/HUBAGUJ7FTMLJ624EQWGJMV447/action/citation_signature","submit_replication":"https://pith.science/pith/HUBAGUJ7FTMLJ624EQWGJMV447/action/replication_record"}},"created_at":"2026-08-04T00:30:51.635381+00:00","updated_at":"2026-08-04T00:30:51.635381+00:00"}