{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BNO7BE4IQLOMHAKNWAYWSBXFFB","short_pith_number":"pith:BNO7BE4I","schema_version":"1.0","canonical_sha256":"0b5df0938882dcc3814db0316906e52875289c109fc45a30dfce479315536b9f","source":{"kind":"arxiv","id":"2108.11670","version":5},"attestation_state":"computed","paper":{"title":"Quantum Alphatron: quantum advantage for learning with kernels and noise","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Miklos Santha, Naixu Guo, Patrick Rebentrost, Siyi Yang","submitted_at":"2021-08-26T09:36:20Z","abstract_excerpt":"At the interface of machine learning and quantum computing, an important question is what distributions can be learned provably with optimal sample complexities and with quantum-accelerated time complexities. In the classical case, Klivans and Goel discussed the \\textit{Alphatron}, an algorithm to learn distributions related to kernelized regression, which they also applied to the learning of two-layer neural networks. In this work, we provide quantum versions of the Alphatron in the fault-tolerant setting. In a well-defined learning model, this quantum algorithm is able to provide a polynomia"},"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":"2108.11670","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-08-26T09:36:20Z","cross_cats_sorted":[],"title_canon_sha256":"39c9aa26ecf8e3d6ba36e617d7143f9c78c8655f3b69dbb861c6a8de9eecaf80","abstract_canon_sha256":"ca4220ff6e7c22292c304f3eddf514da173f85c82654e1ea742f600ff76b76ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:10:16.992963Z","signature_b64":"JgSONu4Szxl2m8t8/4ghnVCFKa5RLMxKkXmzo+ZR7mLVmBxiLqHWu/q7FzkxgJ/8ks9L7stMnIXUxrLY3iKBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b5df0938882dcc3814db0316906e52875289c109fc45a30dfce479315536b9f","last_reissued_at":"2026-07-05T07:10:16.992524Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:10:16.992524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Alphatron: quantum advantage for learning with kernels and noise","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Miklos Santha, Naixu Guo, Patrick Rebentrost, Siyi Yang","submitted_at":"2021-08-26T09:36:20Z","abstract_excerpt":"At the interface of machine learning and quantum computing, an important question is what distributions can be learned provably with optimal sample complexities and with quantum-accelerated time complexities. In the classical case, Klivans and Goel discussed the \\textit{Alphatron}, an algorithm to learn distributions related to kernelized regression, which they also applied to the learning of two-layer neural networks. In this work, we provide quantum versions of the Alphatron in the fault-tolerant setting. In a well-defined learning model, this quantum algorithm is able to provide a polynomia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.11670","kind":"arxiv","version":5},"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/2108.11670/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":"2108.11670","created_at":"2026-07-05T07:10:16.992584+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.11670v5","created_at":"2026-07-05T07:10:16.992584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.11670","created_at":"2026-07-05T07:10:16.992584+00:00"},{"alias_kind":"pith_short_12","alias_value":"BNO7BE4IQLOM","created_at":"2026-07-05T07:10:16.992584+00:00"},{"alias_kind":"pith_short_16","alias_value":"BNO7BE4IQLOMHAKN","created_at":"2026-07-05T07:10:16.992584+00:00"},{"alias_kind":"pith_short_8","alias_value":"BNO7BE4I","created_at":"2026-07-05T07:10:16.992584+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06040","citing_title":"Hybrid quantum floating-point method for sharp arithmetic","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BNO7BE4IQLOMHAKNWAYWSBXFFB","json":"https://pith.science/pith/BNO7BE4IQLOMHAKNWAYWSBXFFB.json","graph_json":"https://pith.science/api/pith-number/BNO7BE4IQLOMHAKNWAYWSBXFFB/graph.json","events_json":"https://pith.science/api/pith-number/BNO7BE4IQLOMHAKNWAYWSBXFFB/events.json","paper":"https://pith.science/paper/BNO7BE4I"},"agent_actions":{"view_html":"https://pith.science/pith/BNO7BE4IQLOMHAKNWAYWSBXFFB","download_json":"https://pith.science/pith/BNO7BE4IQLOMHAKNWAYWSBXFFB.json","view_paper":"https://pith.science/paper/BNO7BE4I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.11670&json=true","fetch_graph":"https://pith.science/api/pith-number/BNO7BE4IQLOMHAKNWAYWSBXFFB/graph.json","fetch_events":"https://pith.science/api/pith-number/BNO7BE4IQLOMHAKNWAYWSBXFFB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BNO7BE4IQLOMHAKNWAYWSBXFFB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BNO7BE4IQLOMHAKNWAYWSBXFFB/action/storage_attestation","attest_author":"https://pith.science/pith/BNO7BE4IQLOMHAKNWAYWSBXFFB/action/author_attestation","sign_citation":"https://pith.science/pith/BNO7BE4IQLOMHAKNWAYWSBXFFB/action/citation_signature","submit_replication":"https://pith.science/pith/BNO7BE4IQLOMHAKNWAYWSBXFFB/action/replication_record"}},"created_at":"2026-07-05T07:10:16.992584+00:00","updated_at":"2026-07-05T07:10:16.992584+00:00"}