{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:4KBDCP6IM6QXZX7NHVKHXZTLPG","short_pith_number":"pith:4KBDCP6I","schema_version":"1.0","canonical_sha256":"e282313fc867a17cdfed3d547be66b799ee820ea07bc623077cb5c2674effcdd","source":{"kind":"arxiv","id":"2111.09787","version":2},"attestation_state":"computed","paper":{"title":"Near-Optimal Quantum Algorithms for Multivariate Mean Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.ST","stat.ML","stat.TH"],"primary_cat":"quant-ph","authors_text":"Arjan Cornelissen, Sofiene Jerbi, Yassine Hamoudi","submitted_at":"2021-11-18T16:35:32Z","abstract_excerpt":"We propose the first near-optimal quantum algorithm for estimating in Euclidean norm the mean of a vector-valued random variable with finite mean and covariance. Our result aims at extending the theory of multivariate sub-Gaussian estimators to the quantum setting. Unlike classically, where any univariate estimator can be turned into a multivariate estimator with at most a logarithmic overhead in the dimension, no similar result can be proved in the quantum setting. Indeed, Heinrich ruled out the existence of a quantum advantage for the mean estimation problem when the sample complexity is sma"},"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":"2111.09787","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-11-18T16:35:32Z","cross_cats_sorted":["cs.CC","cs.DS","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"0e2a09a69cc50ad67b48c009c1f3305b732ce87786ec804fe5969e57b44a12c4","abstract_canon_sha256":"467714fa229a3e70dc7d401ea1298144dcb7f7302a6a2f7413b290e6d1eaeef8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:41:28.044744Z","signature_b64":"ZivtBSpMw09IQGRJbzssyX0e5itgvZK7AjBJw+JkUzrkqQ7J1w8HoVSfjbDn2/sxCLkCEvDCsFSfrDq8yOGMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e282313fc867a17cdfed3d547be66b799ee820ea07bc623077cb5c2674effcdd","last_reissued_at":"2026-07-05T04:41:28.044290Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:41:28.044290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Quantum Algorithms for Multivariate Mean Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.ST","stat.ML","stat.TH"],"primary_cat":"quant-ph","authors_text":"Arjan Cornelissen, Sofiene Jerbi, Yassine Hamoudi","submitted_at":"2021-11-18T16:35:32Z","abstract_excerpt":"We propose the first near-optimal quantum algorithm for estimating in Euclidean norm the mean of a vector-valued random variable with finite mean and covariance. Our result aims at extending the theory of multivariate sub-Gaussian estimators to the quantum setting. Unlike classically, where any univariate estimator can be turned into a multivariate estimator with at most a logarithmic overhead in the dimension, no similar result can be proved in the quantum setting. Indeed, Heinrich ruled out the existence of a quantum advantage for the mean estimation problem when the sample complexity is sma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.09787","kind":"arxiv","version":2},"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/2111.09787/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":"2111.09787","created_at":"2026-07-05T04:41:28.044355+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.09787v2","created_at":"2026-07-05T04:41:28.044355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.09787","created_at":"2026-07-05T04:41:28.044355+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KBDCP6IM6QX","created_at":"2026-07-05T04:41:28.044355+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KBDCP6IM6QXZX7N","created_at":"2026-07-05T04:41:28.044355+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KBDCP6I","created_at":"2026-07-05T04:41:28.044355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04438","citing_title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4KBDCP6IM6QXZX7NHVKHXZTLPG","json":"https://pith.science/pith/4KBDCP6IM6QXZX7NHVKHXZTLPG.json","graph_json":"https://pith.science/api/pith-number/4KBDCP6IM6QXZX7NHVKHXZTLPG/graph.json","events_json":"https://pith.science/api/pith-number/4KBDCP6IM6QXZX7NHVKHXZTLPG/events.json","paper":"https://pith.science/paper/4KBDCP6I"},"agent_actions":{"view_html":"https://pith.science/pith/4KBDCP6IM6QXZX7NHVKHXZTLPG","download_json":"https://pith.science/pith/4KBDCP6IM6QXZX7NHVKHXZTLPG.json","view_paper":"https://pith.science/paper/4KBDCP6I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.09787&json=true","fetch_graph":"https://pith.science/api/pith-number/4KBDCP6IM6QXZX7NHVKHXZTLPG/graph.json","fetch_events":"https://pith.science/api/pith-number/4KBDCP6IM6QXZX7NHVKHXZTLPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KBDCP6IM6QXZX7NHVKHXZTLPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KBDCP6IM6QXZX7NHVKHXZTLPG/action/storage_attestation","attest_author":"https://pith.science/pith/4KBDCP6IM6QXZX7NHVKHXZTLPG/action/author_attestation","sign_citation":"https://pith.science/pith/4KBDCP6IM6QXZX7NHVKHXZTLPG/action/citation_signature","submit_replication":"https://pith.science/pith/4KBDCP6IM6QXZX7NHVKHXZTLPG/action/replication_record"}},"created_at":"2026-07-05T04:41:28.044355+00:00","updated_at":"2026-07-05T04:41:28.044355+00:00"}