{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PC3YRY6MECHJZBGZABH6QZGJTW","short_pith_number":"pith:PC3YRY6M","schema_version":"1.0","canonical_sha256":"78b788e3cc208e9c84d9004fe864c99d904e55bfeb9fed5e869ba1eb3abcb637","source":{"kind":"arxiv","id":"1403.5861","version":3},"attestation_state":"computed","paper":{"title":"Computational speed-up with a single qudit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"B. \\c{C}akmak, D. O. Soares-Pinto, E. L. G. Vidoto, E. R. deAzevedo, F. F. Fanchini, G. Karpat, I. A. Silva, Z. Gedik","submitted_at":"2014-03-24T05:58:23Z","abstract_excerpt":"Quantum algorithms are known for providing more efficient solutions to certain computational tasks than any corresponding classical algorithm. Here we show that a single qudit is sufficient to implement an oracle based quantum algorithm, which can solve a black-box problem faster than any classical algorithm. For $2d$ permutation functions defined on a set of $d$ elements, deciding whether a given permutation is even or odd, requires evaluation of the function for at least two elements. We demonstrate that a quantum circuit with a single qudit can determine the parity of the permutation with o"},"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":"1403.5861","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-03-24T05:58:23Z","cross_cats_sorted":[],"title_canon_sha256":"a2e0ee7497972dae18025413917cc12150d2595ed114e6d0ed676c307ee11bd3","abstract_canon_sha256":"5facd11eddde51d718eeb430033a8e6c4f8cea484c898ef71570e70300262509"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:15.393477Z","signature_b64":"dVCzxVJxE6N/RWgw/aV3ADAABLNZaV8Q3KYQwra3E3IGG8Hd7LZDzZAwT4/d8o7Kl4hmXM92jOaYQRzjjrcSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78b788e3cc208e9c84d9004fe864c99d904e55bfeb9fed5e869ba1eb3abcb637","last_reissued_at":"2026-05-18T01:27:15.392937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:15.392937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational speed-up with a single qudit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"B. \\c{C}akmak, D. O. Soares-Pinto, E. L. G. Vidoto, E. R. deAzevedo, F. F. Fanchini, G. Karpat, I. A. Silva, Z. Gedik","submitted_at":"2014-03-24T05:58:23Z","abstract_excerpt":"Quantum algorithms are known for providing more efficient solutions to certain computational tasks than any corresponding classical algorithm. Here we show that a single qudit is sufficient to implement an oracle based quantum algorithm, which can solve a black-box problem faster than any classical algorithm. For $2d$ permutation functions defined on a set of $d$ elements, deciding whether a given permutation is even or odd, requires evaluation of the function for at least two elements. We demonstrate that a quantum circuit with a single qudit can determine the parity of the permutation with o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5861","kind":"arxiv","version":3},"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":"1403.5861","created_at":"2026-05-18T01:27:15.393031+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.5861v3","created_at":"2026-05-18T01:27:15.393031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5861","created_at":"2026-05-18T01:27:15.393031+00:00"},{"alias_kind":"pith_short_12","alias_value":"PC3YRY6MECHJ","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PC3YRY6MECHJZBGZ","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PC3YRY6M","created_at":"2026-05-18T12:28:43.426989+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/PC3YRY6MECHJZBGZABH6QZGJTW","json":"https://pith.science/pith/PC3YRY6MECHJZBGZABH6QZGJTW.json","graph_json":"https://pith.science/api/pith-number/PC3YRY6MECHJZBGZABH6QZGJTW/graph.json","events_json":"https://pith.science/api/pith-number/PC3YRY6MECHJZBGZABH6QZGJTW/events.json","paper":"https://pith.science/paper/PC3YRY6M"},"agent_actions":{"view_html":"https://pith.science/pith/PC3YRY6MECHJZBGZABH6QZGJTW","download_json":"https://pith.science/pith/PC3YRY6MECHJZBGZABH6QZGJTW.json","view_paper":"https://pith.science/paper/PC3YRY6M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.5861&json=true","fetch_graph":"https://pith.science/api/pith-number/PC3YRY6MECHJZBGZABH6QZGJTW/graph.json","fetch_events":"https://pith.science/api/pith-number/PC3YRY6MECHJZBGZABH6QZGJTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PC3YRY6MECHJZBGZABH6QZGJTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PC3YRY6MECHJZBGZABH6QZGJTW/action/storage_attestation","attest_author":"https://pith.science/pith/PC3YRY6MECHJZBGZABH6QZGJTW/action/author_attestation","sign_citation":"https://pith.science/pith/PC3YRY6MECHJZBGZABH6QZGJTW/action/citation_signature","submit_replication":"https://pith.science/pith/PC3YRY6MECHJZBGZABH6QZGJTW/action/replication_record"}},"created_at":"2026-05-18T01:27:15.393031+00:00","updated_at":"2026-05-18T01:27:15.393031+00:00"}