{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:KAI76ZMRQEFA54NCDEU5YKCRMK","short_pith_number":"pith:KAI76ZMR","schema_version":"1.0","canonical_sha256":"5011ff6591810a0ef1a21929dc285162aeaa7ad1f1bc0722322bd70e66024af8","source":{"kind":"arxiv","id":"2210.14936","version":1},"attestation_state":"computed","paper":{"title":"A super-polynomial quantum-classical separation for density modelling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"Jean-Pierre Seifert, Jens Eisert, Niklas Pirnay, Ryan Sweke","submitted_at":"2022-10-26T18:00:03Z","abstract_excerpt":"Density modelling is the task of learning an unknown probability density function from samples, and is one of the central problems of unsupervised machine learning. In this work, we show that there exists a density modelling problem for which fault-tolerant quantum computers can offer a super-polynomial advantage over classical learning algorithms, given standard cryptographic assumptions. Along the way, we provide a variety of additional results and insights, of potential interest for proving future distribution learning separations between quantum and classical learning algorithms. Specifica"},"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":"2210.14936","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-10-26T18:00:03Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"735b23279e93e2c6f632d7193a81c12374ea6a32234f2572b7a27e9ebae05f3e","abstract_canon_sha256":"9ea4c328fe361c1369e9f0542d07d5d3f487e7f0a06dd8e604eed377640b6d32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:00:57.563179Z","signature_b64":"h2llFj6d+1u9CqFaBZ7j9rPZIFOVjdtPUN9ZB2S67K6LoBQVngKHCJxcGPLvSh8HXhxS7XvDIMZ6dEW7K5srCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5011ff6591810a0ef1a21929dc285162aeaa7ad1f1bc0722322bd70e66024af8","last_reissued_at":"2026-07-05T06:00:57.562750Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:00:57.562750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A super-polynomial quantum-classical separation for density modelling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"Jean-Pierre Seifert, Jens Eisert, Niklas Pirnay, Ryan Sweke","submitted_at":"2022-10-26T18:00:03Z","abstract_excerpt":"Density modelling is the task of learning an unknown probability density function from samples, and is one of the central problems of unsupervised machine learning. In this work, we show that there exists a density modelling problem for which fault-tolerant quantum computers can offer a super-polynomial advantage over classical learning algorithms, given standard cryptographic assumptions. Along the way, we provide a variety of additional results and insights, of potential interest for proving future distribution learning separations between quantum and classical learning algorithms. Specifica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.14936","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/2210.14936/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":"2210.14936","created_at":"2026-07-05T06:00:57.562806+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.14936v1","created_at":"2026-07-05T06:00:57.562806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.14936","created_at":"2026-07-05T06:00:57.562806+00:00"},{"alias_kind":"pith_short_12","alias_value":"KAI76ZMRQEFA","created_at":"2026-07-05T06:00:57.562806+00:00"},{"alias_kind":"pith_short_16","alias_value":"KAI76ZMRQEFA54NC","created_at":"2026-07-05T06:00:57.562806+00:00"},{"alias_kind":"pith_short_8","alias_value":"KAI76ZMR","created_at":"2026-07-05T06:00:57.562806+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KAI76ZMRQEFA54NCDEU5YKCRMK","json":"https://pith.science/pith/KAI76ZMRQEFA54NCDEU5YKCRMK.json","graph_json":"https://pith.science/api/pith-number/KAI76ZMRQEFA54NCDEU5YKCRMK/graph.json","events_json":"https://pith.science/api/pith-number/KAI76ZMRQEFA54NCDEU5YKCRMK/events.json","paper":"https://pith.science/paper/KAI76ZMR"},"agent_actions":{"view_html":"https://pith.science/pith/KAI76ZMRQEFA54NCDEU5YKCRMK","download_json":"https://pith.science/pith/KAI76ZMRQEFA54NCDEU5YKCRMK.json","view_paper":"https://pith.science/paper/KAI76ZMR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.14936&json=true","fetch_graph":"https://pith.science/api/pith-number/KAI76ZMRQEFA54NCDEU5YKCRMK/graph.json","fetch_events":"https://pith.science/api/pith-number/KAI76ZMRQEFA54NCDEU5YKCRMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KAI76ZMRQEFA54NCDEU5YKCRMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KAI76ZMRQEFA54NCDEU5YKCRMK/action/storage_attestation","attest_author":"https://pith.science/pith/KAI76ZMRQEFA54NCDEU5YKCRMK/action/author_attestation","sign_citation":"https://pith.science/pith/KAI76ZMRQEFA54NCDEU5YKCRMK/action/citation_signature","submit_replication":"https://pith.science/pith/KAI76ZMRQEFA54NCDEU5YKCRMK/action/replication_record"}},"created_at":"2026-07-05T06:00:57.562806+00:00","updated_at":"2026-07-05T06:00:57.562806+00:00"}