{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:RIUMNKUYO2TZJSQNQPY554A4WD","short_pith_number":"pith:RIUMNKUY","schema_version":"1.0","canonical_sha256":"8a28c6aa9876a794ca0d83f1def01cb0d6148f3a6ac46eec6c5e9d4a7ad70cfc","source":{"kind":"arxiv","id":"2012.04145","version":2},"attestation_state":"computed","paper":{"title":"Nearest Centroid Classification on a Trapped Ion Quantum Computer","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexandros Singh, Anupam Prakash, Avinash Mocherla, Iordanis Kerenidis, Jungsang Kim, Shantanu Debnath, Sonika Johri","submitted_at":"2020-12-08T01:10:30Z","abstract_excerpt":"Quantum machine learning has seen considerable theoretical and practical developments in recent years and has become a promising area for finding real world applications of quantum computers. In pursuit of this goal, here we combine state-of-the-art algorithms and quantum hardware to provide an experimental demonstration of a quantum machine learning application with provable guarantees for its performance and efficiency. In particular, we design a quantum Nearest Centroid classifier, using techniques for efficiently loading classical data into quantum states and performing distance estimation"},"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":"2012.04145","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2020-12-08T01:10:30Z","cross_cats_sorted":[],"title_canon_sha256":"c1ce4b42a3372da6286d9f1b916f3fdfdb3fc5000012e6751859d36b5c3bd7d3","abstract_canon_sha256":"aec8aad77cd2a3eef4a22863972e99dbf928acb66bdaac1ce4cd42ec208afb8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:58:21.585419Z","signature_b64":"8WL8HUMlnt0yo018Gqw9VWWBV1bNQsxS9TV/ZiBQWQ+wGDdzHEbiP1ldufV2UkM9Uma3HY66o/TVcP89Ol8tBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a28c6aa9876a794ca0d83f1def01cb0d6148f3a6ac46eec6c5e9d4a7ad70cfc","last_reissued_at":"2026-07-05T01:58:21.584958Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:58:21.584958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearest Centroid Classification on a Trapped Ion Quantum Computer","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexandros Singh, Anupam Prakash, Avinash Mocherla, Iordanis Kerenidis, Jungsang Kim, Shantanu Debnath, Sonika Johri","submitted_at":"2020-12-08T01:10:30Z","abstract_excerpt":"Quantum machine learning has seen considerable theoretical and practical developments in recent years and has become a promising area for finding real world applications of quantum computers. In pursuit of this goal, here we combine state-of-the-art algorithms and quantum hardware to provide an experimental demonstration of a quantum machine learning application with provable guarantees for its performance and efficiency. In particular, we design a quantum Nearest Centroid classifier, using techniques for efficiently loading classical data into quantum states and performing distance estimation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.04145","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/2012.04145/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":"2012.04145","created_at":"2026-07-05T01:58:21.585018+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.04145v2","created_at":"2026-07-05T01:58:21.585018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.04145","created_at":"2026-07-05T01:58:21.585018+00:00"},{"alias_kind":"pith_short_12","alias_value":"RIUMNKUYO2TZ","created_at":"2026-07-05T01:58:21.585018+00:00"},{"alias_kind":"pith_short_16","alias_value":"RIUMNKUYO2TZJSQN","created_at":"2026-07-05T01:58:21.585018+00:00"},{"alias_kind":"pith_short_8","alias_value":"RIUMNKUY","created_at":"2026-07-05T01:58:21.585018+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01329","citing_title":"Ravines in quantum cost landscapes: opportunities for improved VQA predictions","ref_index":63,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RIUMNKUYO2TZJSQNQPY554A4WD","json":"https://pith.science/pith/RIUMNKUYO2TZJSQNQPY554A4WD.json","graph_json":"https://pith.science/api/pith-number/RIUMNKUYO2TZJSQNQPY554A4WD/graph.json","events_json":"https://pith.science/api/pith-number/RIUMNKUYO2TZJSQNQPY554A4WD/events.json","paper":"https://pith.science/paper/RIUMNKUY"},"agent_actions":{"view_html":"https://pith.science/pith/RIUMNKUYO2TZJSQNQPY554A4WD","download_json":"https://pith.science/pith/RIUMNKUYO2TZJSQNQPY554A4WD.json","view_paper":"https://pith.science/paper/RIUMNKUY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.04145&json=true","fetch_graph":"https://pith.science/api/pith-number/RIUMNKUYO2TZJSQNQPY554A4WD/graph.json","fetch_events":"https://pith.science/api/pith-number/RIUMNKUYO2TZJSQNQPY554A4WD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RIUMNKUYO2TZJSQNQPY554A4WD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RIUMNKUYO2TZJSQNQPY554A4WD/action/storage_attestation","attest_author":"https://pith.science/pith/RIUMNKUYO2TZJSQNQPY554A4WD/action/author_attestation","sign_citation":"https://pith.science/pith/RIUMNKUYO2TZJSQNQPY554A4WD/action/citation_signature","submit_replication":"https://pith.science/pith/RIUMNKUYO2TZJSQNQPY554A4WD/action/replication_record"}},"created_at":"2026-07-05T01:58:21.585018+00:00","updated_at":"2026-07-05T01:58:21.585018+00:00"}