{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BGOI3T4WP7NUX3ZCM5O6ZFUMHF","short_pith_number":"pith:BGOI3T4W","schema_version":"1.0","canonical_sha256":"099c8dcf967fdb4bef22675dec968c3953200a1c6d6b5d192b63b977121d3553","source":{"kind":"arxiv","id":"2412.18973","version":1},"attestation_state":"computed","paper":{"title":"Derandomized shallow shadows: Efficient Pauli learning with bounded-depth circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el","cs.LG"],"primary_cat":"quant-ph","authors_text":"Christian Kokail, Hannes Pichler, Hong-Ye Hu, Jacob Taylor, Jonathan Kunjummen, Katherine Van Kirk, Madelyn Cain, Mikhail Lukin, Susanne F. Yelin, Yanting Teng","submitted_at":"2024-12-25T19:23:29Z","abstract_excerpt":"Efficiently estimating large numbers of non-commuting observables is an important subroutine of many quantum science tasks. We present the derandomized shallow shadows (DSS) algorithm for efficiently learning a large set of non-commuting observables, using shallow circuits to rotate into measurement bases. Exploiting tensor network techniques to ensure polynomial scaling of classical resources, our algorithm outputs a set of shallow measurement circuits that approximately minimizes the sample complexity of estimating a given set of Pauli strings. We numerically demonstrate systematic improveme"},"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":"2412.18973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-12-25T19:23:29Z","cross_cats_sorted":["cond-mat.str-el","cs.LG"],"title_canon_sha256":"360551d8cbdec34ee4e6a0bd5c983b90587344c5b8e6f25c4ea1ac97ebbd892d","abstract_canon_sha256":"96a848178be7a342c8bd47057f33cfde149fdad7f5174368b533aa94477bcaa0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:14.164375Z","signature_b64":"QnjdZP/zNUbvqLXDN6LIxvMInRA81Y2JU13MgPLnNGIvvp8ETZHCwOrsCcw0PPG2YiHLtJBrYcD3tfS7+ljADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"099c8dcf967fdb4bef22675dec968c3953200a1c6d6b5d192b63b977121d3553","last_reissued_at":"2026-07-05T09:54:14.163932Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:14.163932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Derandomized shallow shadows: Efficient Pauli learning with bounded-depth circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el","cs.LG"],"primary_cat":"quant-ph","authors_text":"Christian Kokail, Hannes Pichler, Hong-Ye Hu, Jacob Taylor, Jonathan Kunjummen, Katherine Van Kirk, Madelyn Cain, Mikhail Lukin, Susanne F. Yelin, Yanting Teng","submitted_at":"2024-12-25T19:23:29Z","abstract_excerpt":"Efficiently estimating large numbers of non-commuting observables is an important subroutine of many quantum science tasks. We present the derandomized shallow shadows (DSS) algorithm for efficiently learning a large set of non-commuting observables, using shallow circuits to rotate into measurement bases. Exploiting tensor network techniques to ensure polynomial scaling of classical resources, our algorithm outputs a set of shallow measurement circuits that approximately minimizes the sample complexity of estimating a given set of Pauli strings. We numerically demonstrate systematic improveme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.18973","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/2412.18973/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":"2412.18973","created_at":"2026-07-05T09:54:14.163995+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.18973v1","created_at":"2026-07-05T09:54:14.163995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.18973","created_at":"2026-07-05T09:54:14.163995+00:00"},{"alias_kind":"pith_short_12","alias_value":"BGOI3T4WP7NU","created_at":"2026-07-05T09:54:14.163995+00:00"},{"alias_kind":"pith_short_16","alias_value":"BGOI3T4WP7NUX3ZC","created_at":"2026-07-05T09:54:14.163995+00:00"},{"alias_kind":"pith_short_8","alias_value":"BGOI3T4W","created_at":"2026-07-05T09:54:14.163995+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.00682","citing_title":"An Error-aware and Adaptive Method for the Estimation of Quantum Observables on Qudit-Based Quantum Computers","ref_index":61,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BGOI3T4WP7NUX3ZCM5O6ZFUMHF","json":"https://pith.science/pith/BGOI3T4WP7NUX3ZCM5O6ZFUMHF.json","graph_json":"https://pith.science/api/pith-number/BGOI3T4WP7NUX3ZCM5O6ZFUMHF/graph.json","events_json":"https://pith.science/api/pith-number/BGOI3T4WP7NUX3ZCM5O6ZFUMHF/events.json","paper":"https://pith.science/paper/BGOI3T4W"},"agent_actions":{"view_html":"https://pith.science/pith/BGOI3T4WP7NUX3ZCM5O6ZFUMHF","download_json":"https://pith.science/pith/BGOI3T4WP7NUX3ZCM5O6ZFUMHF.json","view_paper":"https://pith.science/paper/BGOI3T4W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.18973&json=true","fetch_graph":"https://pith.science/api/pith-number/BGOI3T4WP7NUX3ZCM5O6ZFUMHF/graph.json","fetch_events":"https://pith.science/api/pith-number/BGOI3T4WP7NUX3ZCM5O6ZFUMHF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BGOI3T4WP7NUX3ZCM5O6ZFUMHF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BGOI3T4WP7NUX3ZCM5O6ZFUMHF/action/storage_attestation","attest_author":"https://pith.science/pith/BGOI3T4WP7NUX3ZCM5O6ZFUMHF/action/author_attestation","sign_citation":"https://pith.science/pith/BGOI3T4WP7NUX3ZCM5O6ZFUMHF/action/citation_signature","submit_replication":"https://pith.science/pith/BGOI3T4WP7NUX3ZCM5O6ZFUMHF/action/replication_record"}},"created_at":"2026-07-05T09:54:14.163995+00:00","updated_at":"2026-07-05T09:54:14.163995+00:00"}