{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3OMEGTS4MNK66CAFIZNCL4UEFZ","short_pith_number":"pith:3OMEGTS4","schema_version":"1.0","canonical_sha256":"db98434e5c6355ef0805465a25f2842e4e1eb784ee5a2ddbe9f31ce689325e8f","source":{"kind":"arxiv","id":"2607.26477","version":1},"attestation_state":"computed","paper":{"title":"Finding diagonal logical gates in CSS codes and circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andreas Bauer","submitted_at":"2026-07-29T05:09:15Z","abstract_excerpt":"Finding efficient schemes for non-Clifford logic or magic state preparation is one of the central challenges on the way to fault-tolerant quantum computation. Many of the proposed schemes rely on diagonal non-Clifford logical gates acting on CSS codes in space or decorating CSS-type syndrome-extraction circuits in spacetime. Here we propose and implement efficient algorithms to find all (spacetime) logical gates of a given CSS code (circuit) composed from a prescribed set of ansatz gates. Depending on the choice of ansatz gates, this means finding transversal gates, more general locality-prese"},"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":"2607.26477","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-29T05:09:15Z","cross_cats_sorted":[],"title_canon_sha256":"f87447d9a8fec65b0ac8c57fa5347b73f0992fb9bd77d6223ebe19548e7b5111","abstract_canon_sha256":"401aef97dd291a1494565d1e4a0a11d568a08261352b14b3edc920e367984aa0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db98434e5c6355ef0805465a25f2842e4e1eb784ee5a2ddbe9f31ce689325e8f","last_reissued_at":"2026-07-30T01:20:37.159486Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:20:37.159486Z"},"graph_snapshot":{"paper":{"title":"Finding diagonal logical gates in CSS codes and circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andreas Bauer","submitted_at":"2026-07-29T05:09:15Z","abstract_excerpt":"Finding efficient schemes for non-Clifford logic or magic state preparation is one of the central challenges on the way to fault-tolerant quantum computation. Many of the proposed schemes rely on diagonal non-Clifford logical gates acting on CSS codes in space or decorating CSS-type syndrome-extraction circuits in spacetime. Here we propose and implement efficient algorithms to find all (spacetime) logical gates of a given CSS code (circuit) composed from a prescribed set of ansatz gates. Depending on the choice of ansatz gates, this means finding transversal gates, more general locality-prese"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26477","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/2607.26477/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":"2607.26477","created_at":"2026-07-30T01:20:37.164617+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.26477v1","created_at":"2026-07-30T01:20:37.164617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26477","created_at":"2026-07-30T01:20:37.164617+00:00"},{"alias_kind":"pith_short_12","alias_value":"3OMEGTS4MNK6","created_at":"2026-07-30T01:20:37.164617+00:00"},{"alias_kind":"pith_short_16","alias_value":"3OMEGTS4MNK66CAF","created_at":"2026-07-30T01:20:37.164617+00:00"},{"alias_kind":"pith_short_8","alias_value":"3OMEGTS4","created_at":"2026-07-30T01:20:37.164617+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3OMEGTS4MNK66CAFIZNCL4UEFZ","json":"https://pith.science/pith/3OMEGTS4MNK66CAFIZNCL4UEFZ.json","graph_json":"https://pith.science/api/pith-number/3OMEGTS4MNK66CAFIZNCL4UEFZ/graph.json","events_json":"https://pith.science/api/pith-number/3OMEGTS4MNK66CAFIZNCL4UEFZ/events.json","paper":"https://pith.science/paper/3OMEGTS4"},"agent_actions":{"view_html":"https://pith.science/pith/3OMEGTS4MNK66CAFIZNCL4UEFZ","download_json":"https://pith.science/pith/3OMEGTS4MNK66CAFIZNCL4UEFZ.json","view_paper":"https://pith.science/paper/3OMEGTS4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.26477&json=true","fetch_graph":"https://pith.science/api/pith-number/3OMEGTS4MNK66CAFIZNCL4UEFZ/graph.json","fetch_events":"https://pith.science/api/pith-number/3OMEGTS4MNK66CAFIZNCL4UEFZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3OMEGTS4MNK66CAFIZNCL4UEFZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3OMEGTS4MNK66CAFIZNCL4UEFZ/action/storage_attestation","attest_author":"https://pith.science/pith/3OMEGTS4MNK66CAFIZNCL4UEFZ/action/author_attestation","sign_citation":"https://pith.science/pith/3OMEGTS4MNK66CAFIZNCL4UEFZ/action/citation_signature","submit_replication":"https://pith.science/pith/3OMEGTS4MNK66CAFIZNCL4UEFZ/action/replication_record"}},"created_at":"2026-07-30T01:20:37.164617+00:00","updated_at":"2026-07-30T01:20:37.164617+00:00"}