{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:RI3IB3EZDHGCF2GHRB2W6QSC6Y","short_pith_number":"pith:RI3IB3EZ","schema_version":"1.0","canonical_sha256":"8a3680ec9919cc22e8c788756f4242f637b9af4a894bffe402f7cf5127eb5c1a","source":{"kind":"arxiv","id":"0903.1497","version":2},"attestation_state":"computed","paper":{"title":"Quantum hashing with the icosahedral group","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mes-hall","cond-mat.str-el","hep-th"],"primary_cat":"quant-ph","authors_text":"Giuseppe Mussardo, Haitan Xu, Michele Burrello, Xin Wan","submitted_at":"2009-03-09T09:00:22Z","abstract_excerpt":"We study an efficient algorithm to hash any single qubit gate (or unitary matrix) into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different lengths, we introduce a series of pseudo-groups. Joining these braid segments in a renormalization group fashion, we obtain a Gaussian unitary ensemble of random-matrix representations of braids. With braids of length O[log(1/epsilon)], we can approximate all SU(2) matrices to an average error epsilon with a cost of O[log(1/epsilon)] in time. The algorithm is a"},"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":"0903.1497","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-03-09T09:00:22Z","cross_cats_sorted":["cond-mat.mes-hall","cond-mat.str-el","hep-th"],"title_canon_sha256":"80d46ed96adca6477720beb73f0e3b3ef32ccf97a6447102722b74526ccad83f","abstract_canon_sha256":"3084e6ddc012624a8d2db8907c1ab342b0a05958532553c97f35aa28364f9c08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:56.300771Z","signature_b64":"iLsY1dNeK8gloH6ywRIMj2nFb/+VooVLJrakYHWarH98LDak5R3skw4jQIrXiD/CVMMKtWnpE+7+CSnU9/UABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a3680ec9919cc22e8c788756f4242f637b9af4a894bffe402f7cf5127eb5c1a","last_reissued_at":"2026-05-18T02:24:56.300050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:56.300050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum hashing with the icosahedral group","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mes-hall","cond-mat.str-el","hep-th"],"primary_cat":"quant-ph","authors_text":"Giuseppe Mussardo, Haitan Xu, Michele Burrello, Xin Wan","submitted_at":"2009-03-09T09:00:22Z","abstract_excerpt":"We study an efficient algorithm to hash any single qubit gate (or unitary matrix) into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different lengths, we introduce a series of pseudo-groups. Joining these braid segments in a renormalization group fashion, we obtain a Gaussian unitary ensemble of random-matrix representations of braids. With braids of length O[log(1/epsilon)], we can approximate all SU(2) matrices to an average error epsilon with a cost of O[log(1/epsilon)] in time. The algorithm is a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.1497","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":"0903.1497","created_at":"2026-05-18T02:24:56.300160+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.1497v2","created_at":"2026-05-18T02:24:56.300160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.1497","created_at":"2026-05-18T02:24:56.300160+00:00"},{"alias_kind":"pith_short_12","alias_value":"RI3IB3EZDHGC","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"RI3IB3EZDHGCF2GH","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"RI3IB3EZ","created_at":"2026-05-18T12:26:01.383474+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":227,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RI3IB3EZDHGCF2GHRB2W6QSC6Y","json":"https://pith.science/pith/RI3IB3EZDHGCF2GHRB2W6QSC6Y.json","graph_json":"https://pith.science/api/pith-number/RI3IB3EZDHGCF2GHRB2W6QSC6Y/graph.json","events_json":"https://pith.science/api/pith-number/RI3IB3EZDHGCF2GHRB2W6QSC6Y/events.json","paper":"https://pith.science/paper/RI3IB3EZ"},"agent_actions":{"view_html":"https://pith.science/pith/RI3IB3EZDHGCF2GHRB2W6QSC6Y","download_json":"https://pith.science/pith/RI3IB3EZDHGCF2GHRB2W6QSC6Y.json","view_paper":"https://pith.science/paper/RI3IB3EZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.1497&json=true","fetch_graph":"https://pith.science/api/pith-number/RI3IB3EZDHGCF2GHRB2W6QSC6Y/graph.json","fetch_events":"https://pith.science/api/pith-number/RI3IB3EZDHGCF2GHRB2W6QSC6Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RI3IB3EZDHGCF2GHRB2W6QSC6Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RI3IB3EZDHGCF2GHRB2W6QSC6Y/action/storage_attestation","attest_author":"https://pith.science/pith/RI3IB3EZDHGCF2GHRB2W6QSC6Y/action/author_attestation","sign_citation":"https://pith.science/pith/RI3IB3EZDHGCF2GHRB2W6QSC6Y/action/citation_signature","submit_replication":"https://pith.science/pith/RI3IB3EZDHGCF2GHRB2W6QSC6Y/action/replication_record"}},"created_at":"2026-05-18T02:24:56.300160+00:00","updated_at":"2026-05-18T02:24:56.300160+00:00"}