{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OYUMKJNRLNBJBLC7HCFTECAJFV","short_pith_number":"pith:OYUMKJNR","schema_version":"1.0","canonical_sha256":"7628c525b15b4290ac5f388b3208092d6ac6ffa0391104451b2d29b3903c076d","source":{"kind":"arxiv","id":"1307.0411","version":2},"attestation_state":"computed","paper":{"title":"Quantum algorithms for supervised and unsupervised machine learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Masoud Mohseni, Patrick Rebentrost, Seth Lloyd","submitted_at":"2013-07-01T15:38:12Z","abstract_excerpt":"Machine-learning tasks frequently involve problems of manipulating and classifying large numbers of vectors in high-dimensional spaces. Classical algorithms for solving such problems typically take time polynomial in the number of vectors and the dimension of the space. Quantum computers are good at manipulating high-dimensional vectors in large tensor product spaces. This paper provides supervised and unsupervised quantum machine learning algorithms for cluster assignment and cluster finding. Quantum machine learning can take time logarithmic in both the number of vectors and their dimension,"},"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":"1307.0411","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-07-01T15:38:12Z","cross_cats_sorted":[],"title_canon_sha256":"afa990b7c40d5071d755647a20c37185c8e36d16e15af027d8e6121b23da9fba","abstract_canon_sha256":"16b2990182e443d57097cc74251c82891f5aedc080ba3a57614a885d1078fa9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:04.068311Z","signature_b64":"O8c296wL8jYGqNWPqV1MIwyHUvneVjzWFIIqB/Cew+2BMmH0ZQNn2CWXWsVKdQFgzXJA8KpN/YxAo24gzSjGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7628c525b15b4290ac5f388b3208092d6ac6ffa0391104451b2d29b3903c076d","last_reissued_at":"2026-05-18T03:08:04.067641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:04.067641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum algorithms for supervised and unsupervised machine learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Masoud Mohseni, Patrick Rebentrost, Seth Lloyd","submitted_at":"2013-07-01T15:38:12Z","abstract_excerpt":"Machine-learning tasks frequently involve problems of manipulating and classifying large numbers of vectors in high-dimensional spaces. Classical algorithms for solving such problems typically take time polynomial in the number of vectors and the dimension of the space. Quantum computers are good at manipulating high-dimensional vectors in large tensor product spaces. This paper provides supervised and unsupervised quantum machine learning algorithms for cluster assignment and cluster finding. Quantum machine learning can take time logarithmic in both the number of vectors and their dimension,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0411","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":""},"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":"1307.0411","created_at":"2026-05-18T03:08:04.067735+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.0411v2","created_at":"2026-05-18T03:08:04.067735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0411","created_at":"2026-05-18T03:08:04.067735+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYUMKJNRLNBJ","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYUMKJNRLNBJBLC7","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYUMKJNR","created_at":"2026-05-18T12:27:54.935989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":16,"internal_anchor_count":11,"sample":[{"citing_arxiv_id":"1906.10175","citing_title":"Machine learning methods in quantum computing theory","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2605.06789","citing_title":"Physics inspired quantum algorithm for QCD splitting functions","ref_index":55,"is_internal_anchor":true},{"citing_arxiv_id":"1907.03315","citing_title":"A Quantum Algorithm for Finding $k$-Minima","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2605.20222","citing_title":"Quantum End-to-End Learning for Contextual Combinatorial Optimization","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2506.01432","citing_title":"New aspects of quantum topological data analysis: Betti number estimation, and testing and tracking of homology and cohomology classes","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2507.07018","citing_title":"Quantum Spectral Clustering: Comparing Parameterized and Neuromorphic Quantum Kernels","ref_index":32,"is_internal_anchor":true},{"citing_arxiv_id":"2508.01516","citing_title":"Hybrid quantum-classical framework for Betti number estimation with applications to topological data analysis","ref_index":51,"is_internal_anchor":true},{"citing_arxiv_id":"2508.02855","citing_title":"A resource-efficient quantum-walker Quantum RAM","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2512.02066","citing_title":"Parallel Multi-Circuit Quantum Feature Fusion in Hybrid Quantum-Classical Convolutional Neural Networks for Breast Tumor Classification","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2603.13441","citing_title":"Filtered Spectral Projection for Quantum Principal Component Analysis","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2605.13833","citing_title":"QLAM: A Quantum Long-Attention Memory Approach to Long-Sequence Token Modeling","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2604.08094","citing_title":"Divide et impera: hybrid multinomial classifiers from quantum binary models","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06789","citing_title":"Physics inspired quantum algorithm for QCD splitting functions","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05881","citing_title":"Hybrid Quantum-Classical Algorithm for Hamiltonian Simulation","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15626","citing_title":"Bridge the Gap between Classical and Quantum Neural Networks with Residual Connections","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15645","citing_title":"PINNACLE: An Open-Source Computational Framework for Classical and Quantum PINNs","ref_index":57,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OYUMKJNRLNBJBLC7HCFTECAJFV","json":"https://pith.science/pith/OYUMKJNRLNBJBLC7HCFTECAJFV.json","graph_json":"https://pith.science/api/pith-number/OYUMKJNRLNBJBLC7HCFTECAJFV/graph.json","events_json":"https://pith.science/api/pith-number/OYUMKJNRLNBJBLC7HCFTECAJFV/events.json","paper":"https://pith.science/paper/OYUMKJNR"},"agent_actions":{"view_html":"https://pith.science/pith/OYUMKJNRLNBJBLC7HCFTECAJFV","download_json":"https://pith.science/pith/OYUMKJNRLNBJBLC7HCFTECAJFV.json","view_paper":"https://pith.science/paper/OYUMKJNR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.0411&json=true","fetch_graph":"https://pith.science/api/pith-number/OYUMKJNRLNBJBLC7HCFTECAJFV/graph.json","fetch_events":"https://pith.science/api/pith-number/OYUMKJNRLNBJBLC7HCFTECAJFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYUMKJNRLNBJBLC7HCFTECAJFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYUMKJNRLNBJBLC7HCFTECAJFV/action/storage_attestation","attest_author":"https://pith.science/pith/OYUMKJNRLNBJBLC7HCFTECAJFV/action/author_attestation","sign_citation":"https://pith.science/pith/OYUMKJNRLNBJBLC7HCFTECAJFV/action/citation_signature","submit_replication":"https://pith.science/pith/OYUMKJNRLNBJBLC7HCFTECAJFV/action/replication_record"}},"created_at":"2026-05-18T03:08:04.067735+00:00","updated_at":"2026-05-18T03:08:04.067735+00:00"}