{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:S2O5R6FRZ62EHDEXKBAWN4RU7A","short_pith_number":"pith:S2O5R6FR","schema_version":"1.0","canonical_sha256":"969dd8f8b1cfb4438c97504166f234f83ca259990913c52969c6046291bbee2f","source":{"kind":"arxiv","id":"1510.00113","version":2},"attestation_state":"computed","paper":{"title":"Quantum Discriminant Analysis for Dimensionality Reduction and Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Iris Cong, Luming Duan","submitted_at":"2015-10-01T05:58:29Z","abstract_excerpt":"We present quantum algorithms to efficiently perform discriminant analysis for dimensionality reduction and classification over an exponentially large input data set. Compared with the best-known classical algorithms, the quantum algorithms show an exponential speedup in both the number of training vectors $M$ and the feature space dimension $N$. We generalize the previous quantum algorithm for solving systems of linear equations [Phys. Rev. Lett. 103, 150502 (2009)] to efficiently implement a Hermitian chain product of $k$ trace-normalized $N \\times N$ Hermitian positive-semidefinite matrices"},"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":"1510.00113","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-10-01T05:58:29Z","cross_cats_sorted":[],"title_canon_sha256":"76052d608f9524a8342c398bae75b77bb5049e732fc488e8c4c13edf5bcf2296","abstract_canon_sha256":"aaec1c92a7a95739f5b5b7b4e5a43a15c649e17d51e6b5b692db1dc08a7e9f8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:18.078912Z","signature_b64":"7XmTOhH/cYMoK03NfpCYQjiTX5Jnw+wz71W5zbXvAy/Tl4dVOJOrsOAsxgDfgwSkfQnCjGnzOaHBBRAJE8RKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"969dd8f8b1cfb4438c97504166f234f83ca259990913c52969c6046291bbee2f","last_reissued_at":"2026-05-18T01:11:18.078366Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:18.078366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Discriminant Analysis for Dimensionality Reduction and Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Iris Cong, Luming Duan","submitted_at":"2015-10-01T05:58:29Z","abstract_excerpt":"We present quantum algorithms to efficiently perform discriminant analysis for dimensionality reduction and classification over an exponentially large input data set. Compared with the best-known classical algorithms, the quantum algorithms show an exponential speedup in both the number of training vectors $M$ and the feature space dimension $N$. We generalize the previous quantum algorithm for solving systems of linear equations [Phys. Rev. Lett. 103, 150502 (2009)] to efficiently implement a Hermitian chain product of $k$ trace-normalized $N \\times N$ Hermitian positive-semidefinite matrices"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00113","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":"1510.00113","created_at":"2026-05-18T01:11:18.078453+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.00113v2","created_at":"2026-05-18T01:11:18.078453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00113","created_at":"2026-05-18T01:11:18.078453+00:00"},{"alias_kind":"pith_short_12","alias_value":"S2O5R6FRZ62E","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"S2O5R6FRZ62EHDEX","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"S2O5R6FR","created_at":"2026-05-18T12:29:39.896362+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/S2O5R6FRZ62EHDEXKBAWN4RU7A","json":"https://pith.science/pith/S2O5R6FRZ62EHDEXKBAWN4RU7A.json","graph_json":"https://pith.science/api/pith-number/S2O5R6FRZ62EHDEXKBAWN4RU7A/graph.json","events_json":"https://pith.science/api/pith-number/S2O5R6FRZ62EHDEXKBAWN4RU7A/events.json","paper":"https://pith.science/paper/S2O5R6FR"},"agent_actions":{"view_html":"https://pith.science/pith/S2O5R6FRZ62EHDEXKBAWN4RU7A","download_json":"https://pith.science/pith/S2O5R6FRZ62EHDEXKBAWN4RU7A.json","view_paper":"https://pith.science/paper/S2O5R6FR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.00113&json=true","fetch_graph":"https://pith.science/api/pith-number/S2O5R6FRZ62EHDEXKBAWN4RU7A/graph.json","fetch_events":"https://pith.science/api/pith-number/S2O5R6FRZ62EHDEXKBAWN4RU7A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S2O5R6FRZ62EHDEXKBAWN4RU7A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S2O5R6FRZ62EHDEXKBAWN4RU7A/action/storage_attestation","attest_author":"https://pith.science/pith/S2O5R6FRZ62EHDEXKBAWN4RU7A/action/author_attestation","sign_citation":"https://pith.science/pith/S2O5R6FRZ62EHDEXKBAWN4RU7A/action/citation_signature","submit_replication":"https://pith.science/pith/S2O5R6FRZ62EHDEXKBAWN4RU7A/action/replication_record"}},"created_at":"2026-05-18T01:11:18.078453+00:00","updated_at":"2026-05-18T01:11:18.078453+00:00"}