{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:L7F2MXNGJOUDUERUIBTLWPMNO7","short_pith_number":"pith:L7F2MXNG","schema_version":"1.0","canonical_sha256":"5fcba65da64ba83a12344066bb3d8d77ecb13f1734e98d40dccdb582a54c4b06","source":{"kind":"arxiv","id":"2202.00054","version":2},"attestation_state":"computed","paper":{"title":"Quantum machine learning with subspace states","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Anupam Prakash, Iordanis Kerenidis","submitted_at":"2022-01-31T19:34:47Z","abstract_excerpt":"We introduce a new approach for quantum linear algebra based on quantum subspace states and present three new quantum machine learning algorithms. The first is a quantum determinant sampling algorithm that samples from the distribution $\\Pr[S]= det(X_{S}X_{S}^{T})$ for $|S|=d$ using $O(nd)$ gates and with circuit depth $O(d\\log n)$. The state of art classical algorithm for the task requires $O(d^{3})$ operations \\cite{derezinski2019minimax}. The second is a quantum singular value estimation algorithm for compound matrices $\\mathcal{A}^{k}$, the speedup for this algorithm is potentially exponen"},"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":"2202.00054","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-01-31T19:34:47Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"30057c2076eb48b7d0ee2338df37af7de96b1330859e6cbd66e572b36ec35f6d","abstract_canon_sha256":"8738a8eb2e401883b43fad08f1266903f57dc8eb15c027796458b9cbb9438df7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:53:39.480076Z","signature_b64":"Hc9b9e3zJ3bBMUhOGgG0uqml56tq2Sa1KrsSpny+iGvciyEWwy161h8thS/LPREXVb5XoUUH4X9wvD+zW+eEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fcba65da64ba83a12344066bb3d8d77ecb13f1734e98d40dccdb582a54c4b06","last_reissued_at":"2026-07-05T03:53:39.479594Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:53:39.479594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum machine learning with subspace states","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Anupam Prakash, Iordanis Kerenidis","submitted_at":"2022-01-31T19:34:47Z","abstract_excerpt":"We introduce a new approach for quantum linear algebra based on quantum subspace states and present three new quantum machine learning algorithms. The first is a quantum determinant sampling algorithm that samples from the distribution $\\Pr[S]= det(X_{S}X_{S}^{T})$ for $|S|=d$ using $O(nd)$ gates and with circuit depth $O(d\\log n)$. The state of art classical algorithm for the task requires $O(d^{3})$ operations \\cite{derezinski2019minimax}. The second is a quantum singular value estimation algorithm for compound matrices $\\mathcal{A}^{k}$, the speedup for this algorithm is potentially exponen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.00054","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/2202.00054/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":"2202.00054","created_at":"2026-07-05T03:53:39.479657+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.00054v2","created_at":"2026-07-05T03:53:39.479657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.00054","created_at":"2026-07-05T03:53:39.479657+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7F2MXNGJOUD","created_at":"2026-07-05T03:53:39.479657+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7F2MXNGJOUDUERU","created_at":"2026-07-05T03:53:39.479657+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7F2MXNG","created_at":"2026-07-05T03:53:39.479657+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26873","citing_title":"Scalable Message-Passing Quantum Graph Neural Networks in the Weisfeiler-Leman Hierarchy","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2606.03517","citing_title":"Scalable On-Hardware Training of Quantum Neural Networks and Application to Clinical Data Imputation","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16701","citing_title":"Enabling Lie-Algebraic Classical Simulation beyond Free Fermions","ref_index":116,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20108","citing_title":"Efficient Quantum Algorithms for Higher-Order Coupled Oscillators","ref_index":65,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L7F2MXNGJOUDUERUIBTLWPMNO7","json":"https://pith.science/pith/L7F2MXNGJOUDUERUIBTLWPMNO7.json","graph_json":"https://pith.science/api/pith-number/L7F2MXNGJOUDUERUIBTLWPMNO7/graph.json","events_json":"https://pith.science/api/pith-number/L7F2MXNGJOUDUERUIBTLWPMNO7/events.json","paper":"https://pith.science/paper/L7F2MXNG"},"agent_actions":{"view_html":"https://pith.science/pith/L7F2MXNGJOUDUERUIBTLWPMNO7","download_json":"https://pith.science/pith/L7F2MXNGJOUDUERUIBTLWPMNO7.json","view_paper":"https://pith.science/paper/L7F2MXNG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.00054&json=true","fetch_graph":"https://pith.science/api/pith-number/L7F2MXNGJOUDUERUIBTLWPMNO7/graph.json","fetch_events":"https://pith.science/api/pith-number/L7F2MXNGJOUDUERUIBTLWPMNO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7F2MXNGJOUDUERUIBTLWPMNO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7F2MXNGJOUDUERUIBTLWPMNO7/action/storage_attestation","attest_author":"https://pith.science/pith/L7F2MXNGJOUDUERUIBTLWPMNO7/action/author_attestation","sign_citation":"https://pith.science/pith/L7F2MXNGJOUDUERUIBTLWPMNO7/action/citation_signature","submit_replication":"https://pith.science/pith/L7F2MXNGJOUDUERUIBTLWPMNO7/action/replication_record"}},"created_at":"2026-07-05T03:53:39.479657+00:00","updated_at":"2026-07-05T03:53:39.479657+00:00"}