{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:EZCAQOBA3OJ2O4HY5FRABFY2VT","short_pith_number":"pith:EZCAQOBA","schema_version":"1.0","canonical_sha256":"2644083820db93a770f8e96200971aace15dc047627fdac1566ded8e69ad2e56","source":{"kind":"arxiv","id":"2208.07544","version":1},"attestation_state":"computed","paper":{"title":"Mean estimation when you have the source code; or, quantum Monte Carlo methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.PR","math.ST","stat.TH"],"primary_cat":"quant-ph","authors_text":"Robin Kothari, Ryan O'Donnell","submitted_at":"2022-08-16T05:34:26Z","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"},"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":"2208.07544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-08-16T05:34:26Z","cross_cats_sorted":["cs.CC","cs.DS","math.PR","math.ST","stat.TH"],"title_canon_sha256":"3242e284ac77e664e70d95ffbca8201336901fab7e16c7f19e28811674d5e69e","abstract_canon_sha256":"3abf1f79b4f4566516c3b134baaaa0357b6dcb4c505f179d9e3f0774fea076a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:49:06.073343Z","signature_b64":"2WkEtTRlbWiJFZ1NWF2zSbd7WmNe4KdS38eQRpINuVAo8VCp9cHgCgCc2R746YyqVfqnqIlSAJRqtp3eU2yCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2644083820db93a770f8e96200971aace15dc047627fdac1566ded8e69ad2e56","last_reissued_at":"2026-07-05T04:49:06.072906Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:49:06.072906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mean estimation when you have the source code; or, quantum Monte Carlo methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.PR","math.ST","stat.TH"],"primary_cat":"quant-ph","authors_text":"Robin Kothari, Ryan O'Donnell","submitted_at":"2022-08-16T05:34:26Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.07544","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/2208.07544/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":"2208.07544","created_at":"2026-07-05T04:49:06.072967+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.07544v1","created_at":"2026-07-05T04:49:06.072967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.07544","created_at":"2026-07-05T04:49:06.072967+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZCAQOBA3OJ2","created_at":"2026-07-05T04:49:06.072967+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZCAQOBA3OJ2O4HY","created_at":"2026-07-05T04:49:06.072967+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZCAQOBA","created_at":"2026-07-05T04:49:06.072967+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.31076","citing_title":"Quantum Derivative Pricing for SPDEs via BDSDE Representation","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EZCAQOBA3OJ2O4HY5FRABFY2VT","json":"https://pith.science/pith/EZCAQOBA3OJ2O4HY5FRABFY2VT.json","graph_json":"https://pith.science/api/pith-number/EZCAQOBA3OJ2O4HY5FRABFY2VT/graph.json","events_json":"https://pith.science/api/pith-number/EZCAQOBA3OJ2O4HY5FRABFY2VT/events.json","paper":"https://pith.science/paper/EZCAQOBA"},"agent_actions":{"view_html":"https://pith.science/pith/EZCAQOBA3OJ2O4HY5FRABFY2VT","download_json":"https://pith.science/pith/EZCAQOBA3OJ2O4HY5FRABFY2VT.json","view_paper":"https://pith.science/paper/EZCAQOBA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.07544&json=true","fetch_graph":"https://pith.science/api/pith-number/EZCAQOBA3OJ2O4HY5FRABFY2VT/graph.json","fetch_events":"https://pith.science/api/pith-number/EZCAQOBA3OJ2O4HY5FRABFY2VT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZCAQOBA3OJ2O4HY5FRABFY2VT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZCAQOBA3OJ2O4HY5FRABFY2VT/action/storage_attestation","attest_author":"https://pith.science/pith/EZCAQOBA3OJ2O4HY5FRABFY2VT/action/author_attestation","sign_citation":"https://pith.science/pith/EZCAQOBA3OJ2O4HY5FRABFY2VT/action/citation_signature","submit_replication":"https://pith.science/pith/EZCAQOBA3OJ2O4HY5FRABFY2VT/action/replication_record"}},"created_at":"2026-07-05T04:49:06.072967+00:00","updated_at":"2026-07-05T04:49:06.072967+00:00"}