{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:N4AQCWDJVTIE6RWJT22DI64YLY","short_pith_number":"pith:N4AQCWDJ","schema_version":"1.0","canonical_sha256":"6f01015869acd04f46c99eb4347b985e0c6a2dff90853b9c34dd59c262e02639","source":{"kind":"arxiv","id":"2412.20931","version":2},"attestation_state":"computed","paper":{"title":"Entangling gates from cabling of knots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-th"],"primary_cat":"quant-ph","authors_text":"Andrey Morozov, Sergey Mironov","submitted_at":"2024-12-30T13:21:21Z","abstract_excerpt":"While there is a general consensus about the structure of one qubit operations in topological quantum computer, two qubits are as usual a more difficult and complex story of different attempts with varying approaches, problems and effectiveness. In this paper we discuss how to construct an efficient realization of a two qubit gate in topological quantum computer, by using principle of cabling from the knot theory. This allows to construct a braiding of cables dependent on the parameters of the theory where there is a low probability of moving out of computational space (high fidelity of operat"},"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":"2412.20931","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-12-30T13:21:21Z","cross_cats_sorted":["hep-th"],"title_canon_sha256":"437e791e14dc739d3468a9bf62862d020ca8e3cd4efb9a161ecf4381d190500b","abstract_canon_sha256":"1f6f3765394b2081e50f5835a75be8c46d7c76bf028fea432aadc5f6588d948b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:09:43.178195Z","signature_b64":"M6C1OPy5IulyUBd2+rcDo5IvniQ46vYAm6HTpHdI/4Jioa335VuDuOXI8rwXBrgxxmlHDdKlGA1ATJZ0klcXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f01015869acd04f46c99eb4347b985e0c6a2dff90853b9c34dd59c262e02639","last_reissued_at":"2026-07-05T12:09:43.177654Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:09:43.177654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entangling gates from cabling of knots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-th"],"primary_cat":"quant-ph","authors_text":"Andrey Morozov, Sergey Mironov","submitted_at":"2024-12-30T13:21:21Z","abstract_excerpt":"While there is a general consensus about the structure of one qubit operations in topological quantum computer, two qubits are as usual a more difficult and complex story of different attempts with varying approaches, problems and effectiveness. In this paper we discuss how to construct an efficient realization of a two qubit gate in topological quantum computer, by using principle of cabling from the knot theory. This allows to construct a braiding of cables dependent on the parameters of the theory where there is a low probability of moving out of computational space (high fidelity of operat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.20931","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/2412.20931/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":"2412.20931","created_at":"2026-07-05T12:09:43.177718+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.20931v2","created_at":"2026-07-05T12:09:43.177718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.20931","created_at":"2026-07-05T12:09:43.177718+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4AQCWDJVTIE","created_at":"2026-07-05T12:09:43.177718+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4AQCWDJVTIE6RWJ","created_at":"2026-07-05T12:09:43.177718+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4AQCWDJ","created_at":"2026-07-05T12:09:43.177718+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04016","citing_title":"Entangling gates for the SU(N) anyons","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N4AQCWDJVTIE6RWJT22DI64YLY","json":"https://pith.science/pith/N4AQCWDJVTIE6RWJT22DI64YLY.json","graph_json":"https://pith.science/api/pith-number/N4AQCWDJVTIE6RWJT22DI64YLY/graph.json","events_json":"https://pith.science/api/pith-number/N4AQCWDJVTIE6RWJT22DI64YLY/events.json","paper":"https://pith.science/paper/N4AQCWDJ"},"agent_actions":{"view_html":"https://pith.science/pith/N4AQCWDJVTIE6RWJT22DI64YLY","download_json":"https://pith.science/pith/N4AQCWDJVTIE6RWJT22DI64YLY.json","view_paper":"https://pith.science/paper/N4AQCWDJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.20931&json=true","fetch_graph":"https://pith.science/api/pith-number/N4AQCWDJVTIE6RWJT22DI64YLY/graph.json","fetch_events":"https://pith.science/api/pith-number/N4AQCWDJVTIE6RWJT22DI64YLY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4AQCWDJVTIE6RWJT22DI64YLY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4AQCWDJVTIE6RWJT22DI64YLY/action/storage_attestation","attest_author":"https://pith.science/pith/N4AQCWDJVTIE6RWJT22DI64YLY/action/author_attestation","sign_citation":"https://pith.science/pith/N4AQCWDJVTIE6RWJT22DI64YLY/action/citation_signature","submit_replication":"https://pith.science/pith/N4AQCWDJVTIE6RWJT22DI64YLY/action/replication_record"}},"created_at":"2026-07-05T12:09:43.177718+00:00","updated_at":"2026-07-05T12:09:43.177718+00:00"}