{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:E7XPWFWDPHPRSVBQRK3PVSBIGW","short_pith_number":"pith:E7XPWFWD","schema_version":"1.0","canonical_sha256":"27eefb16c379df1954308ab6fac828359f3c67a9efb2128a7e7667748c5b649f","source":{"kind":"arxiv","id":"2004.07764","version":1},"attestation_state":"computed","paper":{"title":"Quantum $\\mathcal{R}$-matrices as universal qubit gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"hep-th","authors_text":"Andrey Morozov, Nikita Kolganov","submitted_at":"2020-04-16T16:59:04Z","abstract_excerpt":"We study the Chern-Simons approach to the topological quantum computing. We use quantum $\\mathcal{R}$-matrices as universal quantum gates and study the approximations of some one-qubit operations. We make some modifications to the known Solovay-Kitaev algorithm suitable for our particular problem."},"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":"2004.07764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-th","submitted_at":"2020-04-16T16:59:04Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"0a20cbee73c734853310ba50a92c618f9831042aefe4159655d548829d8ac3d4","abstract_canon_sha256":"ae86932d04a8fc1714af647b4d40162f814acf80864d22dbbb922401a155beb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:04:22.918301Z","signature_b64":"l+w+0fiPA5EB7qtS+4Vf+qGgSrEnkQo+sm9h7FbMnlNUz+M4qJNicFEjRBug49MxoVAdJb3Thg+uJ2ReKrABDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27eefb16c379df1954308ab6fac828359f3c67a9efb2128a7e7667748c5b649f","last_reissued_at":"2026-07-05T01:04:22.917777Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:04:22.917777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum $\\mathcal{R}$-matrices as universal qubit gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"hep-th","authors_text":"Andrey Morozov, Nikita Kolganov","submitted_at":"2020-04-16T16:59:04Z","abstract_excerpt":"We study the Chern-Simons approach to the topological quantum computing. We use quantum $\\mathcal{R}$-matrices as universal quantum gates and study the approximations of some one-qubit operations. We make some modifications to the known Solovay-Kitaev algorithm suitable for our particular problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.07764","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/2004.07764/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":"2004.07764","created_at":"2026-07-05T01:04:22.917839+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.07764v1","created_at":"2026-07-05T01:04:22.917839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.07764","created_at":"2026-07-05T01:04:22.917839+00:00"},{"alias_kind":"pith_short_12","alias_value":"E7XPWFWDPHPR","created_at":"2026-07-05T01:04:22.917839+00:00"},{"alias_kind":"pith_short_16","alias_value":"E7XPWFWDPHPRSVBQ","created_at":"2026-07-05T01:04:22.917839+00:00"},{"alias_kind":"pith_short_8","alias_value":"E7XPWFWD","created_at":"2026-07-05T01:04:22.917839+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":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E7XPWFWDPHPRSVBQRK3PVSBIGW","json":"https://pith.science/pith/E7XPWFWDPHPRSVBQRK3PVSBIGW.json","graph_json":"https://pith.science/api/pith-number/E7XPWFWDPHPRSVBQRK3PVSBIGW/graph.json","events_json":"https://pith.science/api/pith-number/E7XPWFWDPHPRSVBQRK3PVSBIGW/events.json","paper":"https://pith.science/paper/E7XPWFWD"},"agent_actions":{"view_html":"https://pith.science/pith/E7XPWFWDPHPRSVBQRK3PVSBIGW","download_json":"https://pith.science/pith/E7XPWFWDPHPRSVBQRK3PVSBIGW.json","view_paper":"https://pith.science/paper/E7XPWFWD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.07764&json=true","fetch_graph":"https://pith.science/api/pith-number/E7XPWFWDPHPRSVBQRK3PVSBIGW/graph.json","fetch_events":"https://pith.science/api/pith-number/E7XPWFWDPHPRSVBQRK3PVSBIGW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E7XPWFWDPHPRSVBQRK3PVSBIGW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E7XPWFWDPHPRSVBQRK3PVSBIGW/action/storage_attestation","attest_author":"https://pith.science/pith/E7XPWFWDPHPRSVBQRK3PVSBIGW/action/author_attestation","sign_citation":"https://pith.science/pith/E7XPWFWDPHPRSVBQRK3PVSBIGW/action/citation_signature","submit_replication":"https://pith.science/pith/E7XPWFWDPHPRSVBQRK3PVSBIGW/action/replication_record"}},"created_at":"2026-07-05T01:04:22.917839+00:00","updated_at":"2026-07-05T01:04:22.917839+00:00"}