{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UECOGF2LVUAAQIYVIN5PLG4U57","short_pith_number":"pith:UECOGF2L","schema_version":"1.0","canonical_sha256":"a104e3174bad00082315437af59b94efe92eb83e8f26066f574cacab1c58a5ee","source":{"kind":"arxiv","id":"2505.18265","version":1},"attestation_state":"computed","paper":{"title":"Non-Clifford gates between stabilizer codes via non-Abelian topological order","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Brenden Roberts, Rohith Sajith, Varun Menon, Yabo Li, Zijian Song","submitted_at":"2025-05-23T18:01:38Z","abstract_excerpt":"We propose protocols to implement non-Clifford logical gates between stabilizer codes by entangling into a non-Abelian topological order as an intermediate step. Generalizing previous approaches, we provide a framework that generates a large class of non-Clifford and non-diagonal logical gates between qudit surface codes by gauging the topological symmetry of symmetry-enriched topological orders. As our main example, we concretely detail a protocol that utilizes the quantum double of $S_3$ to generate a controlled-charge conjugation ($C\\mathcal{C}$) gate between a qubit and qutrit surface code"},"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":"2505.18265","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-05-23T18:01:38Z","cross_cats_sorted":["cond-mat.str-el"],"title_canon_sha256":"92964fadcff3ac33982fa40f7e01f2f3dc85d4c35df17ba415fa4a3c0e083d62","abstract_canon_sha256":"43d00dfe1b7b701e87c796b2358b66732a1fcea8faf80ea98ee6c44dbec22773"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:43.777131Z","signature_b64":"JB2M2v6wfUdqIcnscs5sVulmioJgUc/rR6nhpjS0fcgtphSGwiXd4A81evmfXGxI1zfG2i2UQG0wUawSJ1p1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a104e3174bad00082315437af59b94efe92eb83e8f26066f574cacab1c58a5ee","last_reissued_at":"2026-07-05T11:08:43.776647Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:43.776647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Clifford gates between stabilizer codes via non-Abelian topological order","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Brenden Roberts, Rohith Sajith, Varun Menon, Yabo Li, Zijian Song","submitted_at":"2025-05-23T18:01:38Z","abstract_excerpt":"We propose protocols to implement non-Clifford logical gates between stabilizer codes by entangling into a non-Abelian topological order as an intermediate step. Generalizing previous approaches, we provide a framework that generates a large class of non-Clifford and non-diagonal logical gates between qudit surface codes by gauging the topological symmetry of symmetry-enriched topological orders. As our main example, we concretely detail a protocol that utilizes the quantum double of $S_3$ to generate a controlled-charge conjugation ($C\\mathcal{C}$) gate between a qubit and qutrit surface code"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.18265","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.18265/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":"2505.18265","created_at":"2026-07-05T11:08:43.776718+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.18265v1","created_at":"2026-07-05T11:08:43.776718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.18265","created_at":"2026-07-05T11:08:43.776718+00:00"},{"alias_kind":"pith_short_12","alias_value":"UECOGF2LVUAA","created_at":"2026-07-05T11:08:43.776718+00:00"},{"alias_kind":"pith_short_16","alias_value":"UECOGF2LVUAAQIYV","created_at":"2026-07-05T11:08:43.776718+00:00"},{"alias_kind":"pith_short_8","alias_value":"UECOGF2L","created_at":"2026-07-05T11:08:43.776718+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2507.16152","citing_title":"Practical blueprint for low-depth photonic quantum computing with quantum dots","ref_index":108,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UECOGF2LVUAAQIYVIN5PLG4U57","json":"https://pith.science/pith/UECOGF2LVUAAQIYVIN5PLG4U57.json","graph_json":"https://pith.science/api/pith-number/UECOGF2LVUAAQIYVIN5PLG4U57/graph.json","events_json":"https://pith.science/api/pith-number/UECOGF2LVUAAQIYVIN5PLG4U57/events.json","paper":"https://pith.science/paper/UECOGF2L"},"agent_actions":{"view_html":"https://pith.science/pith/UECOGF2LVUAAQIYVIN5PLG4U57","download_json":"https://pith.science/pith/UECOGF2LVUAAQIYVIN5PLG4U57.json","view_paper":"https://pith.science/paper/UECOGF2L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.18265&json=true","fetch_graph":"https://pith.science/api/pith-number/UECOGF2LVUAAQIYVIN5PLG4U57/graph.json","fetch_events":"https://pith.science/api/pith-number/UECOGF2LVUAAQIYVIN5PLG4U57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UECOGF2LVUAAQIYVIN5PLG4U57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UECOGF2LVUAAQIYVIN5PLG4U57/action/storage_attestation","attest_author":"https://pith.science/pith/UECOGF2LVUAAQIYVIN5PLG4U57/action/author_attestation","sign_citation":"https://pith.science/pith/UECOGF2LVUAAQIYVIN5PLG4U57/action/citation_signature","submit_replication":"https://pith.science/pith/UECOGF2LVUAAQIYVIN5PLG4U57/action/replication_record"}},"created_at":"2026-07-05T11:08:43.776718+00:00","updated_at":"2026-07-05T11:08:43.776718+00:00"}