{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:P6IFCGHCTBJYGL7XB3OWKGT4IU","short_pith_number":"pith:P6IFCGHC","schema_version":"1.0","canonical_sha256":"7f905118e29853832ff70edd651a7c4534523c25dbc17db0613d10bf7122d24f","source":{"kind":"arxiv","id":"2111.04384","version":3},"attestation_state":"computed","paper":{"title":"Efficient realization of quantum algorithms with qudits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksey K. Fedorov, Anastasiia S. Nikolaeva, Evgeniy O. Kiktenko","submitted_at":"2021-11-08T11:09:37Z","abstract_excerpt":"The development of a universal fault-tolerant quantum computer that can solve efficiently various difficult computational problems is an outstanding challenge for science and technology. In this work, we propose a technique for an efficient implementation of quantum algorithms with multilevel quantum systems (qudits). Our method uses a transpilation of a circuit in the standard qubit form, which depends on the parameters of a qudit-based processor, such as their number and the number of accessible levels. This approach provides a qubit-to-qudit mapping and comparison to a standard realization "},"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":"2111.04384","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-11-08T11:09:37Z","cross_cats_sorted":[],"title_canon_sha256":"462673070ce41e30db531ed11dbad4448a31a8d59d800c2d558b73c1bb2e0dae","abstract_canon_sha256":"7ff7b829d75e472b937e567355d78b436020bc35da1c779143b7e752281b3a28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:38:31.699709Z","signature_b64":"H2y1W1g082xcV0f99k5rmOJ7+tNteZ5BPIu9oxuFb24CH8pq/bCuTtW6zgKp7mb96YOTe4IYb2TZGkeFny6OBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f905118e29853832ff70edd651a7c4534523c25dbc17db0613d10bf7122d24f","last_reissued_at":"2026-07-05T08:38:31.699352Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:38:31.699352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient realization of quantum algorithms with qudits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksey K. Fedorov, Anastasiia S. Nikolaeva, Evgeniy O. Kiktenko","submitted_at":"2021-11-08T11:09:37Z","abstract_excerpt":"The development of a universal fault-tolerant quantum computer that can solve efficiently various difficult computational problems is an outstanding challenge for science and technology. In this work, we propose a technique for an efficient implementation of quantum algorithms with multilevel quantum systems (qudits). Our method uses a transpilation of a circuit in the standard qubit form, which depends on the parameters of a qudit-based processor, such as their number and the number of accessible levels. This approach provides a qubit-to-qudit mapping and comparison to a standard realization "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.04384","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/2111.04384/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":"2111.04384","created_at":"2026-07-05T08:38:31.699416+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.04384v3","created_at":"2026-07-05T08:38:31.699416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.04384","created_at":"2026-07-05T08:38:31.699416+00:00"},{"alias_kind":"pith_short_12","alias_value":"P6IFCGHCTBJY","created_at":"2026-07-05T08:38:31.699416+00:00"},{"alias_kind":"pith_short_16","alias_value":"P6IFCGHCTBJYGL7X","created_at":"2026-07-05T08:38:31.699416+00:00"},{"alias_kind":"pith_short_8","alias_value":"P6IFCGHC","created_at":"2026-07-05T08:38:31.699416+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":73,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P6IFCGHCTBJYGL7XB3OWKGT4IU","json":"https://pith.science/pith/P6IFCGHCTBJYGL7XB3OWKGT4IU.json","graph_json":"https://pith.science/api/pith-number/P6IFCGHCTBJYGL7XB3OWKGT4IU/graph.json","events_json":"https://pith.science/api/pith-number/P6IFCGHCTBJYGL7XB3OWKGT4IU/events.json","paper":"https://pith.science/paper/P6IFCGHC"},"agent_actions":{"view_html":"https://pith.science/pith/P6IFCGHCTBJYGL7XB3OWKGT4IU","download_json":"https://pith.science/pith/P6IFCGHCTBJYGL7XB3OWKGT4IU.json","view_paper":"https://pith.science/paper/P6IFCGHC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.04384&json=true","fetch_graph":"https://pith.science/api/pith-number/P6IFCGHCTBJYGL7XB3OWKGT4IU/graph.json","fetch_events":"https://pith.science/api/pith-number/P6IFCGHCTBJYGL7XB3OWKGT4IU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P6IFCGHCTBJYGL7XB3OWKGT4IU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P6IFCGHCTBJYGL7XB3OWKGT4IU/action/storage_attestation","attest_author":"https://pith.science/pith/P6IFCGHCTBJYGL7XB3OWKGT4IU/action/author_attestation","sign_citation":"https://pith.science/pith/P6IFCGHCTBJYGL7XB3OWKGT4IU/action/citation_signature","submit_replication":"https://pith.science/pith/P6IFCGHCTBJYGL7XB3OWKGT4IU/action/replication_record"}},"created_at":"2026-07-05T08:38:31.699416+00:00","updated_at":"2026-07-05T08:38:31.699416+00:00"}