{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FMHBSKH3KECH376TJ6E6G7QBZD","short_pith_number":"pith:FMHBSKH3","schema_version":"1.0","canonical_sha256":"2b0e1928fb51047dffd34f89e37e01c8ce9f4bc70d167fbea0f81b0e8f8621be","source":{"kind":"arxiv","id":"2504.20847","version":1},"attestation_state":"computed","paper":{"title":"Transversal Gates in Nonadditive Quantum Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bei Zeng, Chao Zhang, Shilin Huang, Zipeng Wu","submitted_at":"2025-04-29T15:18:33Z","abstract_excerpt":"Transversal gates play a crucial role in suppressing error propagation in fault-tolerant quantum computation, yet they are intrinsically constrained: any nontrivial code encoding a single logical qubit admits only a finite subgroup of $\\mathrm{SU}(2)$ as its transversal operations. We introduce a systematic framework for searching codes with specified transversal groups by parametrizing their logical subspaces on the Stiefel manifold and minimizing a composite loss that enforces both the Knill-Laflamme conditions and a target transversal-group structure. Applying this method, we uncover a new "},"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":"2504.20847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-04-29T15:18:33Z","cross_cats_sorted":[],"title_canon_sha256":"c287159169ce72113273ee4fc8dfc6d374c95e49827cec692f5917c57f813614","abstract_canon_sha256":"a34101bb356d6e23eef487bd1b83acfead444dc97db2ff69d542aea1ecde30cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:49.890871Z","signature_b64":"s0q4IYOu6nYtXaJ1AlyVOcu7hZWgOmWRPF6UZb31zHFY51HAkczHuZYiYPae6Jj0UjQHTT2mhVd1YBCpbTf9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b0e1928fb51047dffd34f89e37e01c8ce9f4bc70d167fbea0f81b0e8f8621be","last_reissued_at":"2026-07-05T10:55:49.890384Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:49.890384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transversal Gates in Nonadditive Quantum Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bei Zeng, Chao Zhang, Shilin Huang, Zipeng Wu","submitted_at":"2025-04-29T15:18:33Z","abstract_excerpt":"Transversal gates play a crucial role in suppressing error propagation in fault-tolerant quantum computation, yet they are intrinsically constrained: any nontrivial code encoding a single logical qubit admits only a finite subgroup of $\\mathrm{SU}(2)$ as its transversal operations. We introduce a systematic framework for searching codes with specified transversal groups by parametrizing their logical subspaces on the Stiefel manifold and minimizing a composite loss that enforces both the Knill-Laflamme conditions and a target transversal-group structure. Applying this method, we uncover a new "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.20847","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/2504.20847/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":"2504.20847","created_at":"2026-07-05T10:55:49.890444+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.20847v1","created_at":"2026-07-05T10:55:49.890444+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.20847","created_at":"2026-07-05T10:55:49.890444+00:00"},{"alias_kind":"pith_short_12","alias_value":"FMHBSKH3KECH","created_at":"2026-07-05T10:55:49.890444+00:00"},{"alias_kind":"pith_short_16","alias_value":"FMHBSKH3KECH376T","created_at":"2026-07-05T10:55:49.890444+00:00"},{"alias_kind":"pith_short_8","alias_value":"FMHBSKH3","created_at":"2026-07-05T10:55:49.890444+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.20728","citing_title":"Co-Designing Quantum Codes with Transversal Diagonal Gates via Multi-Agent Systems","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21800","citing_title":"Variance Geometry of Exact Pauli-Detecting Codes: Continuous Landscapes Beyond Stabilizers","ref_index":59,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FMHBSKH3KECH376TJ6E6G7QBZD","json":"https://pith.science/pith/FMHBSKH3KECH376TJ6E6G7QBZD.json","graph_json":"https://pith.science/api/pith-number/FMHBSKH3KECH376TJ6E6G7QBZD/graph.json","events_json":"https://pith.science/api/pith-number/FMHBSKH3KECH376TJ6E6G7QBZD/events.json","paper":"https://pith.science/paper/FMHBSKH3"},"agent_actions":{"view_html":"https://pith.science/pith/FMHBSKH3KECH376TJ6E6G7QBZD","download_json":"https://pith.science/pith/FMHBSKH3KECH376TJ6E6G7QBZD.json","view_paper":"https://pith.science/paper/FMHBSKH3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.20847&json=true","fetch_graph":"https://pith.science/api/pith-number/FMHBSKH3KECH376TJ6E6G7QBZD/graph.json","fetch_events":"https://pith.science/api/pith-number/FMHBSKH3KECH376TJ6E6G7QBZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FMHBSKH3KECH376TJ6E6G7QBZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FMHBSKH3KECH376TJ6E6G7QBZD/action/storage_attestation","attest_author":"https://pith.science/pith/FMHBSKH3KECH376TJ6E6G7QBZD/action/author_attestation","sign_citation":"https://pith.science/pith/FMHBSKH3KECH376TJ6E6G7QBZD/action/citation_signature","submit_replication":"https://pith.science/pith/FMHBSKH3KECH376TJ6E6G7QBZD/action/replication_record"}},"created_at":"2026-07-05T10:55:49.890444+00:00","updated_at":"2026-07-05T10:55:49.890444+00:00"}