{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KUTDJB5ZDQ6FFJ4LQJUIASD6YN","short_pith_number":"pith:KUTDJB5Z","schema_version":"1.0","canonical_sha256":"55263487b91c3c52a78b826880487ec354246788d4c8cb0791fcc7b78345dd33","source":{"kind":"arxiv","id":"1310.4150","version":1},"attestation_state":"computed","paper":{"title":"Asymptotically Optimal Topological Quantum Compiling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Alex Bocharov, Krysta M. Svore, Vadym Kliuchnikov","submitted_at":"2013-10-15T19:15:32Z","abstract_excerpt":"In a topological quantum computer, universality is achieved by braiding and quantum information is natively protected from small local errors. We address the problem of compiling single-qubit quantum operations into braid representations for non-abelian quasiparticles described by the Fibonacci anyon model. We develop a probabilistically polynomial algorithm that outputs a braid pattern to approximate a given single-qubit unitary to a desired precision. We also classify the single-qubit unitaries that can be implemented exactly by a Fibonacci anyon braid pattern and present an efficient algori"},"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":"1310.4150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-15T19:15:32Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"1785f09b46c65bcb36fe46118d4e34fe0f7d5b04dace3fa14f5ab91546a9db9f","abstract_canon_sha256":"e803818c2de36004d9166ab501cc5eb6b1d19f5323e2be9f4324ef5b66442ce7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:47:05.031022Z","signature_b64":"sRR+boBx7bsMtsHMDPPzm2DxZnzXclVHpvyoqKFNYPeIhKgIuNBpnqn1aRWLD+mtYaDL4rEGxekVjvWu/qWOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55263487b91c3c52a78b826880487ec354246788d4c8cb0791fcc7b78345dd33","last_reissued_at":"2026-05-18T01:47:05.030543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:47:05.030543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotically Optimal Topological Quantum Compiling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Alex Bocharov, Krysta M. Svore, Vadym Kliuchnikov","submitted_at":"2013-10-15T19:15:32Z","abstract_excerpt":"In a topological quantum computer, universality is achieved by braiding and quantum information is natively protected from small local errors. We address the problem of compiling single-qubit quantum operations into braid representations for non-abelian quasiparticles described by the Fibonacci anyon model. We develop a probabilistically polynomial algorithm that outputs a braid pattern to approximate a given single-qubit unitary to a desired precision. We also classify the single-qubit unitaries that can be implemented exactly by a Fibonacci anyon braid pattern and present an efficient algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4150","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":""},"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":"1310.4150","created_at":"2026-05-18T01:47:05.030620+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.4150v1","created_at":"2026-05-18T01:47:05.030620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4150","created_at":"2026-05-18T01:47:05.030620+00:00"},{"alias_kind":"pith_short_12","alias_value":"KUTDJB5ZDQ6F","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"KUTDJB5ZDQ6FFJ4L","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"KUTDJB5Z","created_at":"2026-05-18T12:27:51.066281+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.06076","citing_title":"Number-Theoretic Characterizations of Some Restricted Clifford+T Circuits","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KUTDJB5ZDQ6FFJ4LQJUIASD6YN","json":"https://pith.science/pith/KUTDJB5ZDQ6FFJ4LQJUIASD6YN.json","graph_json":"https://pith.science/api/pith-number/KUTDJB5ZDQ6FFJ4LQJUIASD6YN/graph.json","events_json":"https://pith.science/api/pith-number/KUTDJB5ZDQ6FFJ4LQJUIASD6YN/events.json","paper":"https://pith.science/paper/KUTDJB5Z"},"agent_actions":{"view_html":"https://pith.science/pith/KUTDJB5ZDQ6FFJ4LQJUIASD6YN","download_json":"https://pith.science/pith/KUTDJB5ZDQ6FFJ4LQJUIASD6YN.json","view_paper":"https://pith.science/paper/KUTDJB5Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.4150&json=true","fetch_graph":"https://pith.science/api/pith-number/KUTDJB5ZDQ6FFJ4LQJUIASD6YN/graph.json","fetch_events":"https://pith.science/api/pith-number/KUTDJB5ZDQ6FFJ4LQJUIASD6YN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KUTDJB5ZDQ6FFJ4LQJUIASD6YN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KUTDJB5ZDQ6FFJ4LQJUIASD6YN/action/storage_attestation","attest_author":"https://pith.science/pith/KUTDJB5ZDQ6FFJ4LQJUIASD6YN/action/author_attestation","sign_citation":"https://pith.science/pith/KUTDJB5ZDQ6FFJ4LQJUIASD6YN/action/citation_signature","submit_replication":"https://pith.science/pith/KUTDJB5ZDQ6FFJ4LQJUIASD6YN/action/replication_record"}},"created_at":"2026-05-18T01:47:05.030620+00:00","updated_at":"2026-05-18T01:47:05.030620+00:00"}