{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UJCAOOYTRPPBZGV3KN7OOVOXOL","short_pith_number":"pith:UJCAOOYT","schema_version":"1.0","canonical_sha256":"a244073b138bde1c9abb537ee755d772ea1b89df49cf4ee57be27b8d036002a7","source":{"kind":"arxiv","id":"2502.01864","version":3},"attestation_state":"computed","paper":{"title":"Quantum Codes with Addressable and Transversal Non-Clifford Gates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Adam Wills, Rachel Yun Zhang, Vinod Vaikuntanathan, Zhiyang He","submitted_at":"2025-02-03T22:24:34Z","abstract_excerpt":"The development of quantum codes with good error correction parameters and useful sets of transversal gates is a problem of major interest in quantum error-correction. Abundant prior works have studied transversal gates which are restricted to acting on all logical qubits simultaneously. In this work, we study codes that support transversal gates which induce $\\textit{addressable}$ logical gates, i.e., the logical gates act on logical qubits of our choice. As we consider scaling to high-rate codes, the study and design of low-overhead, addressable logical operations presents an important probl"},"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":"2502.01864","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-02-03T22:24:34Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"877c8972bba4b73ac750d84b75a3df51237f31a6647f553ed7e31ff469ab2bc6","abstract_canon_sha256":"cbca488fc1edb9a72795a6a2f0be3153372dcf1c027c2fcf1647e680956b961d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:34:04.130101Z","signature_b64":"hbJGGxW8ZnUhzrSvhOyB3WQQj++JCG/27gjhaflP844G5oWnD/CV4T/bfx8RNDO5wkmeMhw6KdhWIPKykgtGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a244073b138bde1c9abb537ee755d772ea1b89df49cf4ee57be27b8d036002a7","last_reissued_at":"2026-07-05T11:34:04.129667Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:34:04.129667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Codes with Addressable and Transversal Non-Clifford Gates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Adam Wills, Rachel Yun Zhang, Vinod Vaikuntanathan, Zhiyang He","submitted_at":"2025-02-03T22:24:34Z","abstract_excerpt":"The development of quantum codes with good error correction parameters and useful sets of transversal gates is a problem of major interest in quantum error-correction. Abundant prior works have studied transversal gates which are restricted to acting on all logical qubits simultaneously. In this work, we study codes that support transversal gates which induce $\\textit{addressable}$ logical gates, i.e., the logical gates act on logical qubits of our choice. As we consider scaling to high-rate codes, the study and design of low-overhead, addressable logical operations presents an important probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01864","kind":"arxiv","version":3},"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/2502.01864/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":"2502.01864","created_at":"2026-07-05T11:34:04.129721+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.01864v3","created_at":"2026-07-05T11:34:04.129721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01864","created_at":"2026-07-05T11:34:04.129721+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJCAOOYTRPPB","created_at":"2026-07-05T11:34:04.129721+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJCAOOYTRPPBZGV3","created_at":"2026-07-05T11:34:04.129721+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJCAOOYT","created_at":"2026-07-05T11:34:04.129721+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.31441","citing_title":"Intrinsic locality dimension of quantum codes","ref_index":66,"is_internal_anchor":false},{"citing_arxiv_id":"2503.05003","citing_title":"Parallel Logical Measurements via Quantum Code Surgery","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18981","citing_title":"A Review of Galois Qudits","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UJCAOOYTRPPBZGV3KN7OOVOXOL","json":"https://pith.science/pith/UJCAOOYTRPPBZGV3KN7OOVOXOL.json","graph_json":"https://pith.science/api/pith-number/UJCAOOYTRPPBZGV3KN7OOVOXOL/graph.json","events_json":"https://pith.science/api/pith-number/UJCAOOYTRPPBZGV3KN7OOVOXOL/events.json","paper":"https://pith.science/paper/UJCAOOYT"},"agent_actions":{"view_html":"https://pith.science/pith/UJCAOOYTRPPBZGV3KN7OOVOXOL","download_json":"https://pith.science/pith/UJCAOOYTRPPBZGV3KN7OOVOXOL.json","view_paper":"https://pith.science/paper/UJCAOOYT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.01864&json=true","fetch_graph":"https://pith.science/api/pith-number/UJCAOOYTRPPBZGV3KN7OOVOXOL/graph.json","fetch_events":"https://pith.science/api/pith-number/UJCAOOYTRPPBZGV3KN7OOVOXOL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJCAOOYTRPPBZGV3KN7OOVOXOL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJCAOOYTRPPBZGV3KN7OOVOXOL/action/storage_attestation","attest_author":"https://pith.science/pith/UJCAOOYTRPPBZGV3KN7OOVOXOL/action/author_attestation","sign_citation":"https://pith.science/pith/UJCAOOYTRPPBZGV3KN7OOVOXOL/action/citation_signature","submit_replication":"https://pith.science/pith/UJCAOOYTRPPBZGV3KN7OOVOXOL/action/replication_record"}},"created_at":"2026-07-05T11:34:04.129721+00:00","updated_at":"2026-07-05T11:34:04.129721+00:00"}