{"paper":{"title":"Cryptographic Conditions for Efficient Testing of Distributions and Quantum States","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"quant-ph","authors_text":"Bruno Cavalar, Eli Goldin, Matthew Gray, Min-Hsiu Hsieh, Taiga Hiroka, Tomoyuki Morimae","submitted_at":"2025-10-06T17:05:38Z","abstract_excerpt":"One of the most fundamental problems in distribution testing is the identity testing problem: given samples $x_1,\\ldots,x_s$, the goal is to determine whether the samples are drawn from a target distribution $\\mathcal{D}$. When $\\mathcal{D}$ is a distribution over $\\bit^n$, the optimal sample complexity of identity testing is known to be $\\Omega(\\sqrt{2^n})$. Furthermore, most existing results assume that the samples $x_1,\\ldots,x_s$ are generated independently from an unknown distribution.\n  In this work, we overcome both of these limitations by initiating study of distribution testing in a m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.05028","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"}