{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:V3W7GTXRREOXRZWJQI2KTUCVJA","short_pith_number":"pith:V3W7GTXR","schema_version":"1.0","canonical_sha256":"aeedf34ef1891d78e6c98234a9d055483e2afc5554d9defe681de4307cb528a2","source":{"kind":"arxiv","id":"1412.3646","version":1},"attestation_state":"computed","paper":{"title":"Quantum computing for pattern classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Francesco Petruccione, Ilya Sinayskiy, Maria Schuld","submitted_at":"2014-12-11T13:46:10Z","abstract_excerpt":"It is well known that for certain tasks, quantum computing outperforms classical computing. A growing number of contributions try to use this advantage in order to improve or extend classical machine learning algorithms by methods of quantum information theory. This paper gives a brief introduction into quantum machine learning using the example of pattern classification. We introduce a quantum pattern classification algorithm that draws on Trugenberger's proposal for measuring the Hamming distance on a quantum computer (CA Trugenberger, Phys Rev Let 87, 2001) and discuss its advantages using "},"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":"1412.3646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-12-11T13:46:10Z","cross_cats_sorted":[],"title_canon_sha256":"280962347838737781d2788aa8fac100a8aa75f3ba757b340e9b828eada5d1b1","abstract_canon_sha256":"cf49f171e574cf620e314c74b6223bfba9fe7db8aa2f76ac7fd99483cb8991e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:30.652040Z","signature_b64":"xdXwGrSUESgBiBuf+1cdEPiK/pWevgs/4fV3Wvf2NT8fTqxJE0gaRwjXl4PLqhDlnAs7s4/fxD6BNDB33hnCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aeedf34ef1891d78e6c98234a9d055483e2afc5554d9defe681de4307cb528a2","last_reissued_at":"2026-05-18T02:31:30.651646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:30.651646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum computing for pattern classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Francesco Petruccione, Ilya Sinayskiy, Maria Schuld","submitted_at":"2014-12-11T13:46:10Z","abstract_excerpt":"It is well known that for certain tasks, quantum computing outperforms classical computing. A growing number of contributions try to use this advantage in order to improve or extend classical machine learning algorithms by methods of quantum information theory. This paper gives a brief introduction into quantum machine learning using the example of pattern classification. We introduce a quantum pattern classification algorithm that draws on Trugenberger's proposal for measuring the Hamming distance on a quantum computer (CA Trugenberger, Phys Rev Let 87, 2001) and discuss its advantages using "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3646","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":""},"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":"1412.3646","created_at":"2026-05-18T02:31:30.651701+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3646v1","created_at":"2026-05-18T02:31:30.651701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3646","created_at":"2026-05-18T02:31:30.651701+00:00"},{"alias_kind":"pith_short_12","alias_value":"V3W7GTXRREOX","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"V3W7GTXRREOXRZWJ","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"V3W7GTXR","created_at":"2026-05-18T12:28:52.271510+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/V3W7GTXRREOXRZWJQI2KTUCVJA","json":"https://pith.science/pith/V3W7GTXRREOXRZWJQI2KTUCVJA.json","graph_json":"https://pith.science/api/pith-number/V3W7GTXRREOXRZWJQI2KTUCVJA/graph.json","events_json":"https://pith.science/api/pith-number/V3W7GTXRREOXRZWJQI2KTUCVJA/events.json","paper":"https://pith.science/paper/V3W7GTXR"},"agent_actions":{"view_html":"https://pith.science/pith/V3W7GTXRREOXRZWJQI2KTUCVJA","download_json":"https://pith.science/pith/V3W7GTXRREOXRZWJQI2KTUCVJA.json","view_paper":"https://pith.science/paper/V3W7GTXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3646&json=true","fetch_graph":"https://pith.science/api/pith-number/V3W7GTXRREOXRZWJQI2KTUCVJA/graph.json","fetch_events":"https://pith.science/api/pith-number/V3W7GTXRREOXRZWJQI2KTUCVJA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V3W7GTXRREOXRZWJQI2KTUCVJA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V3W7GTXRREOXRZWJQI2KTUCVJA/action/storage_attestation","attest_author":"https://pith.science/pith/V3W7GTXRREOXRZWJQI2KTUCVJA/action/author_attestation","sign_citation":"https://pith.science/pith/V3W7GTXRREOXRZWJQI2KTUCVJA/action/citation_signature","submit_replication":"https://pith.science/pith/V3W7GTXRREOXRZWJQI2KTUCVJA/action/replication_record"}},"created_at":"2026-05-18T02:31:30.651701+00:00","updated_at":"2026-05-18T02:31:30.651701+00:00"}