{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:J2ARDFI7RGEOQWHMRD24TPM3MT","short_pith_number":"pith:J2ARDFI7","schema_version":"1.0","canonical_sha256":"4e8111951f8988e858ec88f5c9bd9b64cb798f8b977752b6f1bd04ad8818ccaa","source":{"kind":"arxiv","id":"2012.04447","version":3},"attestation_state":"computed","paper":{"title":"Asymptotically Improved Circuit for $d$-ary Grover's Algorithm with Advanced Decomposition of $n$-qudit Toffoli Gate","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Amit Saha, Amlan Chakrabarti, Debasri Saha, Ritajit Majumdar, Susmita Sur-Kolay","submitted_at":"2020-12-08T14:33:04Z","abstract_excerpt":"The progress in building quantum computers to execute quantum algorithms has recently been remarkable. Grover's search algorithm in a binary quantum system provides considerable speed-up over classical paradigm. Further, Grover's algorithm can be extended to a $d$-ary (qudit) quantum system for utilizing the advantage of larger state space, which helps to reduce the run-time of the algorithm as compared to the traditional binary quantum systems. In a qudit quantum system, an $n$-qudit Toffoli gate plays a significant role in the accurate implementation of Grover's algorithm. In this article, a"},"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.04447","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-12-08T14:33:04Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"54fe917bb97cda178b2741e31c3cb9d22e3db95e2b5d8e4fac695e5ab4bb68a6","abstract_canon_sha256":"d45eb4d1aa6e28544e69ad5fd0412792b1087ca67c77d343dd8195e86f5473e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:50:48.684682Z","signature_b64":"3Rdd2Xp03/GcXXceAfwgl551qT4EhX1U18v1F9QHrGz+baElIQuSD3Cu3N1y5EEeiQUdNLlQQBNFbba50sj3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e8111951f8988e858ec88f5c9bd9b64cb798f8b977752b6f1bd04ad8818ccaa","last_reissued_at":"2026-07-05T04:50:48.684277Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:50:48.684277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotically Improved Circuit for $d$-ary Grover's Algorithm with Advanced Decomposition of $n$-qudit Toffoli Gate","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Amit Saha, Amlan Chakrabarti, Debasri Saha, Ritajit Majumdar, Susmita Sur-Kolay","submitted_at":"2020-12-08T14:33:04Z","abstract_excerpt":"The progress in building quantum computers to execute quantum algorithms has recently been remarkable. Grover's search algorithm in a binary quantum system provides considerable speed-up over classical paradigm. Further, Grover's algorithm can be extended to a $d$-ary (qudit) quantum system for utilizing the advantage of larger state space, which helps to reduce the run-time of the algorithm as compared to the traditional binary quantum systems. In a qudit quantum system, an $n$-qudit Toffoli gate plays a significant role in the accurate implementation of Grover's algorithm. In this article, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.04447","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.04447/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.04447","created_at":"2026-07-05T04:50:48.684338+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.04447v3","created_at":"2026-07-05T04:50:48.684338+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.04447","created_at":"2026-07-05T04:50:48.684338+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2ARDFI7RGEO","created_at":"2026-07-05T04:50:48.684338+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2ARDFI7RGEOQWHM","created_at":"2026-07-05T04:50:48.684338+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2ARDFI7","created_at":"2026-07-05T04:50:48.684338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.10945","citing_title":"Non-Abelian dynamics on a cube: improving quantum compilation through qudit-based simulations","ref_index":79,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J2ARDFI7RGEOQWHMRD24TPM3MT","json":"https://pith.science/pith/J2ARDFI7RGEOQWHMRD24TPM3MT.json","graph_json":"https://pith.science/api/pith-number/J2ARDFI7RGEOQWHMRD24TPM3MT/graph.json","events_json":"https://pith.science/api/pith-number/J2ARDFI7RGEOQWHMRD24TPM3MT/events.json","paper":"https://pith.science/paper/J2ARDFI7"},"agent_actions":{"view_html":"https://pith.science/pith/J2ARDFI7RGEOQWHMRD24TPM3MT","download_json":"https://pith.science/pith/J2ARDFI7RGEOQWHMRD24TPM3MT.json","view_paper":"https://pith.science/paper/J2ARDFI7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.04447&json=true","fetch_graph":"https://pith.science/api/pith-number/J2ARDFI7RGEOQWHMRD24TPM3MT/graph.json","fetch_events":"https://pith.science/api/pith-number/J2ARDFI7RGEOQWHMRD24TPM3MT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2ARDFI7RGEOQWHMRD24TPM3MT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2ARDFI7RGEOQWHMRD24TPM3MT/action/storage_attestation","attest_author":"https://pith.science/pith/J2ARDFI7RGEOQWHMRD24TPM3MT/action/author_attestation","sign_citation":"https://pith.science/pith/J2ARDFI7RGEOQWHMRD24TPM3MT/action/citation_signature","submit_replication":"https://pith.science/pith/J2ARDFI7RGEOQWHMRD24TPM3MT/action/replication_record"}},"created_at":"2026-07-05T04:50:48.684338+00:00","updated_at":"2026-07-05T04:50:48.684338+00:00"}