{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PNAXOF6O2WEAESUWG2MQAGIVCN","short_pith_number":"pith:PNAXOF6O","schema_version":"1.0","canonical_sha256":"7b417717ced588024a963699001915135faac0a883d2585e38a77531ae1578db","source":{"kind":"arxiv","id":"1001.4085","version":2},"attestation_state":"computed","paper":{"title":"Unified approach to topological quantum computation with anyons: From qubit encoding to Toffoli gate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mes-hall","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Haitan Xu, J. M. Taylor","submitted_at":"2010-01-22T21:07:33Z","abstract_excerpt":"Topological quantum computation may provide a robust approach for encoding and manipulating information utilizing the topological properties of anyonic quasi-particle excitations. We develop an efficient means to map between dense and sparse representations of quantum information (qubits) and a simple construction of multi-qubit gates, for all anyon models from Chern-Simons-Witten SU(2)$_k$ theory that support universal quantum computation by braiding ($k\\geq 3,\\ k \\neq 4$). In the process, we show how the constructions of topological quantum memory and gates for $k=2,4$ connect naturally to t"},"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":"1001.4085","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-01-22T21:07:33Z","cross_cats_sorted":["cond-mat.mes-hall","math-ph","math.MP"],"title_canon_sha256":"9faa3571aed58727cad7486fa25debc175dba1c1313b1421516dc367b92fc025","abstract_canon_sha256":"3508f96815ab9c31743afde69df3c5ee84c421f8023ffe738c146cca17ada2d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:32.298711Z","signature_b64":"Nxwbgp24rtDaTgs5yZFtf2lfcFMXUAHh2qLt9GCEVrgHD57K6DyNIJcIuxAqj7SDRYLIwx/qAmowuEuqziKqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b417717ced588024a963699001915135faac0a883d2585e38a77531ae1578db","last_reissued_at":"2026-05-18T04:16:32.298301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:32.298301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unified approach to topological quantum computation with anyons: From qubit encoding to Toffoli gate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mes-hall","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Haitan Xu, J. M. Taylor","submitted_at":"2010-01-22T21:07:33Z","abstract_excerpt":"Topological quantum computation may provide a robust approach for encoding and manipulating information utilizing the topological properties of anyonic quasi-particle excitations. We develop an efficient means to map between dense and sparse representations of quantum information (qubits) and a simple construction of multi-qubit gates, for all anyon models from Chern-Simons-Witten SU(2)$_k$ theory that support universal quantum computation by braiding ($k\\geq 3,\\ k \\neq 4$). In the process, we show how the constructions of topological quantum memory and gates for $k=2,4$ connect naturally to t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.4085","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":""},"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":"1001.4085","created_at":"2026-05-18T04:16:32.298375+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.4085v2","created_at":"2026-05-18T04:16:32.298375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.4085","created_at":"2026-05-18T04:16:32.298375+00:00"},{"alias_kind":"pith_short_12","alias_value":"PNAXOF6O2WEA","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PNAXOF6O2WEAESUW","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PNAXOF6O","created_at":"2026-05-18T12:26:12.377268+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12385","citing_title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","ref_index":288,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PNAXOF6O2WEAESUWG2MQAGIVCN","json":"https://pith.science/pith/PNAXOF6O2WEAESUWG2MQAGIVCN.json","graph_json":"https://pith.science/api/pith-number/PNAXOF6O2WEAESUWG2MQAGIVCN/graph.json","events_json":"https://pith.science/api/pith-number/PNAXOF6O2WEAESUWG2MQAGIVCN/events.json","paper":"https://pith.science/paper/PNAXOF6O"},"agent_actions":{"view_html":"https://pith.science/pith/PNAXOF6O2WEAESUWG2MQAGIVCN","download_json":"https://pith.science/pith/PNAXOF6O2WEAESUWG2MQAGIVCN.json","view_paper":"https://pith.science/paper/PNAXOF6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.4085&json=true","fetch_graph":"https://pith.science/api/pith-number/PNAXOF6O2WEAESUWG2MQAGIVCN/graph.json","fetch_events":"https://pith.science/api/pith-number/PNAXOF6O2WEAESUWG2MQAGIVCN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PNAXOF6O2WEAESUWG2MQAGIVCN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PNAXOF6O2WEAESUWG2MQAGIVCN/action/storage_attestation","attest_author":"https://pith.science/pith/PNAXOF6O2WEAESUWG2MQAGIVCN/action/author_attestation","sign_citation":"https://pith.science/pith/PNAXOF6O2WEAESUWG2MQAGIVCN/action/citation_signature","submit_replication":"https://pith.science/pith/PNAXOF6O2WEAESUWG2MQAGIVCN/action/replication_record"}},"created_at":"2026-05-18T04:16:32.298375+00:00","updated_at":"2026-05-18T04:16:32.298375+00:00"}