{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BMCXOTJKO7DA2IQBYRWTIL5HH4","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"28087bded4c5d64fcee81984467731f1f1318cfe8acb88d34801a11975bf54de","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-14T01:48:14Z","title_canon_sha256":"4e14ef8e355f02869cdf75fbe92296480f09bea816f610cdcd3a0e7f8ad61e08"},"schema_version":"1.0","source":{"id":"2605.14256","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14256","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14256v1","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14256","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"pith_short_12","alias_value":"BMCXOTJKO7DA","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"BMCXOTJKO7DA2IQB","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"BMCXOTJK","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:f810aaca5938e6f6d2b648771369e07370d2245c6ac045e0efe337be1d4cf2df","target":"graph","created_at":"2026-05-17T23:39:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"For this kernel under local Clifford sampling, we prove a sharp fourth-moment bound using the single-qubit Clifford commutant. This yields worst-case sample complexity O(√(4.5^n)), attained by identical pure product stabilizer states."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The reduction of the minimax kernel optimization to Hamming-distance kernels, together with the claim that unbiasedness fixes a unique kernel within this class."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The work proves a worst-case sample complexity of O(sqrt(4.5^n)) for distributed inner product estimation with local Clifford sampling on n-qubit states, with a conjectured O(sqrt(3.6^n)) for Haar sampling."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Local Clifford measurements achieve O(√(4.5^n)) worst-case sample complexity for distributed inner product estimation on n-qubit states."}],"snapshot_sha256":"a1f727aaba18679ef5231c65eb6bf92e2752a56d6f2ae8f3e0c954ede6ee9709"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"01365b82c2e62865c44e82988a9dc4b56b41e76e378ba55ad61d8cf1d60ff451"},"paper":{"abstract_excerpt":"We study distributed inner product estimation for $n$-qubit states using local randomized measurements, for which rigorous worst-case guarantees are less understood. We first reduce the minimax kernel optimization to Hamming-distance kernels. Within this class, unbiasedness fixes a unique kernel. For this kernel under local Clifford sampling, we prove a sharp fourth-moment bound using the single-qubit Clifford commutant. This yields worst-case sample complexity $\\mathcal{O}(\\sqrt{4.5^n})$, attained by identical pure product stabilizer states. For the same kernel under local Haar sampling, we p","authors_text":"Kun Wang, Ping Xu, Zhenyuan Huang","cross_cats":[],"headline":"Local Clifford measurements achieve O(√(4.5^n)) worst-case sample complexity for distributed inner product estimation on n-qubit states.","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-14T01:48:14Z","title":"Worst-Case Sample Complexity Bounds for Distributed Inner Product Estimation with Local Randomized Measurements"},"references":{"count":62,"internal_anchors":0,"resolved_work":62,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"A. Elben, B. Vermersch, R. van Bijnen, C. Kokail, T. Bry- dges, C. Maier, M. K. Joshi, R. Blatt, C. F. Roos, and P . Zoller, Physical Review Letters124,010504(2020)","work_id":"0958467f-b544-4cb3-a47b-c1723c0f0533","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"J. Eisert, D. Hangleiter, N. Walk, I. Roth, D. Markham, R. Parekh, U. Chabaud, and E. Kashefi, Nature Reviews Physics2,382(2020)","work_id":"549f198f-38c9-4c56-a2bd-28e8b1dc561a","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"M. Kliesch and I. Roth, PRX Quantum2,010201(2021)","work_id":"fa97cf24-222c-4beb-83d0-2489ae24a73f","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Distributed quantum information processing: A review of recent progress","work_id":"8f1ceac6-d03e-4520-bd8b-fc3796cd0778","year":2025},{"cited_arxiv_id":"","doi":"10.1038/s41467-022-34279-5(2022","is_internal_anchor":false,"ref_index":5,"title":"D. Zhu, Z. P . Cian, C. Noel, A. Risinger, D. Biswas, L. Egan, Y. Zhu, A. M. Green, C. H. Alderete, N. H. Nguyen, Q. Wang, A. Maksymov, Y. Nam, M. Cetina, N. M. Linke, M. Hafezi, and C. Monroe, Nature","work_id":"6d8de622-abc8-480a-959a-8f2fba5677fa","year":2022}],"snapshot_sha256":"4cc78a78fcbbf2f66e744082b25bbe1c452bf7f3356cefcd7388dd4e90087732"},"source":{"id":"2605.14256","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:41:57.813954Z","id":"34956ff4-12ec-4b05-9a0c-1a1ac23db93d","model_set":{"reader":"grok-4.3"},"one_line_summary":"The work proves a worst-case sample complexity of O(sqrt(4.5^n)) for distributed inner product estimation with local Clifford sampling on n-qubit states, with a conjectured O(sqrt(3.6^n)) for Haar sampling.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Local Clifford measurements achieve O(√(4.5^n)) worst-case sample complexity for distributed inner product estimation on n-qubit states.","strongest_claim":"For this kernel under local Clifford sampling, we prove a sharp fourth-moment bound using the single-qubit Clifford commutant. This yields worst-case sample complexity O(√(4.5^n)), attained by identical pure product stabilizer states.","weakest_assumption":"The reduction of the minimax kernel optimization to Hamming-distance kernels, together with the claim that unbiasedness fixes a unique kernel within this class."}},"verdict_id":"34956ff4-12ec-4b05-9a0c-1a1ac23db93d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d09fbb0513699f33a803a0fc0c04c9d027e785ccf60712ccbe952f295f7983cb","target":"record","created_at":"2026-05-17T23:39:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"28087bded4c5d64fcee81984467731f1f1318cfe8acb88d34801a11975bf54de","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-14T01:48:14Z","title_canon_sha256":"4e14ef8e355f02869cdf75fbe92296480f09bea816f610cdcd3a0e7f8ad61e08"},"schema_version":"1.0","source":{"id":"2605.14256","kind":"arxiv","version":1}},"canonical_sha256":"0b05774d2a77c60d2201c46d342fa73f368cc0ceaeb4c6fca7e285a4c99aefef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b05774d2a77c60d2201c46d342fa73f368cc0ceaeb4c6fca7e285a4c99aefef","first_computed_at":"2026-05-17T23:39:10.526009Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:10.526009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fSZPXtAeQKZK8JPFyI4ivUHAAjtrzmW9X81NA0Y/iRYvOb0JfllPqJCwn6jt5Hh7JfiGMAQ85mgzwpFW4VM3CA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:10.526457Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14256","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d09fbb0513699f33a803a0fc0c04c9d027e785ccf60712ccbe952f295f7983cb","sha256:f810aaca5938e6f6d2b648771369e07370d2245c6ac045e0efe337be1d4cf2df","sha256:6f7aac4741c5a171d38ef3bf8875031167eedfe65cd5c4f5a4d13143d1909bb6"],"state_sha256":"a7f7340ffae986ee9cd2e819077221c3dda09c0137e1bff50426f1b57bea762e"}