{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:EZCAQOBA3OJ2O4HY5FRABFY2VT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3abf1f79b4f4566516c3b134baaaa0357b6dcb4c505f179d9e3f0774fea076a9","cross_cats_sorted":["cs.CC","cs.DS","math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-08-16T05:34:26Z","title_canon_sha256":"3242e284ac77e664e70d95ffbca8201336901fab7e16c7f19e28811674d5e69e"},"schema_version":"1.0","source":{"id":"2208.07544","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.07544","created_at":"2026-07-05T04:49:06Z"},{"alias_kind":"arxiv_version","alias_value":"2208.07544v1","created_at":"2026-07-05T04:49:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.07544","created_at":"2026-07-05T04:49:06Z"},{"alias_kind":"pith_short_12","alias_value":"EZCAQOBA3OJ2","created_at":"2026-07-05T04:49:06Z"},{"alias_kind":"pith_short_16","alias_value":"EZCAQOBA3OJ2O4HY","created_at":"2026-07-05T04:49:06Z"},{"alias_kind":"pith_short_8","alias_value":"EZCAQOBA","created_at":"2026-07-05T04:49:06Z"}],"graph_snapshots":[{"event_id":"sha256:97e147620712544accda0f20690fae99ecf2468c12c19b96f33979e8744cb0e7","target":"graph","created_at":"2026-07-05T04:49:06Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2208.07544/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Suppose $\\boldsymbol{y}$ is a real random variable, and one is given access to ``the code'' that generates it (for example, a randomized or quantum circuit whose output is $\\boldsymbol{y}$). We give a quantum procedure that runs the code $O(n)$ times and returns an estimate $\\widehat{\\boldsymbol{\\mu}}$ for $\\mu = \\mathrm{E}[\\boldsymbol{y}]$ that with high probability satisfies $|\\widehat{\\boldsymbol{\\mu}} - \\mu| \\leq \\sigma/n$, where $\\sigma = \\mathrm{stddev}[\\boldsymbol{y}]$. This dependence on $n$ is optimal for quantum algorithms. One may compare with classical algorithms, which can only ac","authors_text":"Robin Kothari, Ryan O'Donnell","cross_cats":["cs.CC","cs.DS","math.PR","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-08-16T05:34:26Z","title":"Mean estimation when you have the source code; or, quantum Monte Carlo methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.07544","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2ca3f2932bd173c4187e76424edf569ca30ee93fb3f8b480c64e1bd92f97b23e","target":"record","created_at":"2026-07-05T04:49:06Z","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":"3abf1f79b4f4566516c3b134baaaa0357b6dcb4c505f179d9e3f0774fea076a9","cross_cats_sorted":["cs.CC","cs.DS","math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-08-16T05:34:26Z","title_canon_sha256":"3242e284ac77e664e70d95ffbca8201336901fab7e16c7f19e28811674d5e69e"},"schema_version":"1.0","source":{"id":"2208.07544","kind":"arxiv","version":1}},"canonical_sha256":"2644083820db93a770f8e96200971aace15dc047627fdac1566ded8e69ad2e56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2644083820db93a770f8e96200971aace15dc047627fdac1566ded8e69ad2e56","first_computed_at":"2026-07-05T04:49:06.072906Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:49:06.072906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2WkEtTRlbWiJFZ1NWF2zSbd7WmNe4KdS38eQRpINuVAo8VCp9cHgCgCc2R746YyqVfqnqIlSAJRqtp3eU2yCAg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:49:06.073343Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.07544","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ca3f2932bd173c4187e76424edf569ca30ee93fb3f8b480c64e1bd92f97b23e","sha256:97e147620712544accda0f20690fae99ecf2468c12c19b96f33979e8744cb0e7"],"state_sha256":"3208671cb3b4a1a24f7fada56131874fd4687a6f420fbf1b7e5aaec91396a72e"}