{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:K4UJ2FET67ZWELZUM53BIMWQHC","short_pith_number":"pith:K4UJ2FET","schema_version":"1.0","canonical_sha256":"57289d1493f7f3622f3467761432d03882f6c5b8935f0cc65853ac9153486bcf","source":{"kind":"arxiv","id":"2502.13889","version":4},"attestation_state":"computed","paper":{"title":"On the Addressability Problem on CSS Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"J\\'er\\^ome Guyot, Samuel Jaques","submitted_at":"2025-02-19T17:18:52Z","abstract_excerpt":"Recent discoveries in asymptotically good quantum codes have intensified research on their application in quantum computation and fault-tolerant operations. This study focuses on the addressability problem within CSS codes: we ask what circuits might implement logical gates on strict subsets of logical qubits. With some notion of fault-tolerance, we prove several impossibility results: for CSS codes with non-zero rate, one cannot address a logical $H$, $HS$, $SH$, or $\\mathsf{CNOT}$ to any non-empty strict subset of logical qubits using a circuit made only from 1-local Clifford gates.\n  Furthe"},"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.13889","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-02-19T17:18:52Z","cross_cats_sorted":[],"title_canon_sha256":"63d0022e7b1842d86c97f279e8d0b8535ed5caf56a4bed1c53da856125c287b0","abstract_canon_sha256":"2193d4daadab64069a98a61c9c46c5df7f6364803c656a2c65c19ef3d3269523"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:25.438338Z","signature_b64":"qgJDhUB7v7/CoRfb2DkVkwtmpJsXsOql/Oi8tK78hThVUvQd3115+J++ZvIrdNdmO19pk5I++lJJ7QpXUesDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57289d1493f7f3622f3467761432d03882f6c5b8935f0cc65853ac9153486bcf","last_reissued_at":"2026-06-11T01:10:25.437263Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:25.437263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Addressability Problem on CSS Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"J\\'er\\^ome Guyot, Samuel Jaques","submitted_at":"2025-02-19T17:18:52Z","abstract_excerpt":"Recent discoveries in asymptotically good quantum codes have intensified research on their application in quantum computation and fault-tolerant operations. This study focuses on the addressability problem within CSS codes: we ask what circuits might implement logical gates on strict subsets of logical qubits. With some notion of fault-tolerance, we prove several impossibility results: for CSS codes with non-zero rate, one cannot address a logical $H$, $HS$, $SH$, or $\\mathsf{CNOT}$ to any non-empty strict subset of logical qubits using a circuit made only from 1-local Clifford gates.\n  Furthe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.13889","kind":"arxiv","version":4},"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.13889/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.13889","created_at":"2026-06-11T01:10:25.437437+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.13889v4","created_at":"2026-06-11T01:10:25.437437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.13889","created_at":"2026-06-11T01:10:25.437437+00:00"},{"alias_kind":"pith_short_12","alias_value":"K4UJ2FET67ZW","created_at":"2026-06-11T01:10:25.437437+00:00"},{"alias_kind":"pith_short_16","alias_value":"K4UJ2FET67ZWELZU","created_at":"2026-06-11T01:10:25.437437+00:00"},{"alias_kind":"pith_short_8","alias_value":"K4UJ2FET","created_at":"2026-06-11T01:10:25.437437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.04794","citing_title":"Automorphism gadgets in homological product codes","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K4UJ2FET67ZWELZUM53BIMWQHC","json":"https://pith.science/pith/K4UJ2FET67ZWELZUM53BIMWQHC.json","graph_json":"https://pith.science/api/pith-number/K4UJ2FET67ZWELZUM53BIMWQHC/graph.json","events_json":"https://pith.science/api/pith-number/K4UJ2FET67ZWELZUM53BIMWQHC/events.json","paper":"https://pith.science/paper/K4UJ2FET"},"agent_actions":{"view_html":"https://pith.science/pith/K4UJ2FET67ZWELZUM53BIMWQHC","download_json":"https://pith.science/pith/K4UJ2FET67ZWELZUM53BIMWQHC.json","view_paper":"https://pith.science/paper/K4UJ2FET","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.13889&json=true","fetch_graph":"https://pith.science/api/pith-number/K4UJ2FET67ZWELZUM53BIMWQHC/graph.json","fetch_events":"https://pith.science/api/pith-number/K4UJ2FET67ZWELZUM53BIMWQHC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K4UJ2FET67ZWELZUM53BIMWQHC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K4UJ2FET67ZWELZUM53BIMWQHC/action/storage_attestation","attest_author":"https://pith.science/pith/K4UJ2FET67ZWELZUM53BIMWQHC/action/author_attestation","sign_citation":"https://pith.science/pith/K4UJ2FET67ZWELZUM53BIMWQHC/action/citation_signature","submit_replication":"https://pith.science/pith/K4UJ2FET67ZWELZUM53BIMWQHC/action/replication_record"}},"created_at":"2026-06-11T01:10:25.437437+00:00","updated_at":"2026-06-11T01:10:25.437437+00:00"}