{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KV3MPLQVS6JHG53F3EE6DQROPH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"38e15e3d5f92148e8832528109d66c3d6a4b0eec26c0eff439aee82a24f40839","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-14T18:00:01Z","title_canon_sha256":"e37a74bb60ad751fc5c1f560f072893e0cb492cd803a7b0ad7ec99923dac8e95"},"schema_version":"1.0","source":{"id":"2605.15266","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15266","created_at":"2026-05-20T00:00:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15266v1","created_at":"2026-05-20T00:00:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15266","created_at":"2026-05-20T00:00:49Z"},{"alias_kind":"pith_short_12","alias_value":"KV3MPLQVS6JH","created_at":"2026-05-20T00:00:49Z"},{"alias_kind":"pith_short_16","alias_value":"KV3MPLQVS6JHG53F","created_at":"2026-05-20T00:00:49Z"},{"alias_kind":"pith_short_8","alias_value":"KV3MPLQV","created_at":"2026-05-20T00:00:49Z"}],"graph_snapshots":[{"event_id":"sha256:ce6a4103bc1ecb381a5ddcc112e8fe10e5a64d4a9ffbf60165cce3425f262e92","target":"graph","created_at":"2026-05-20T00:00:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We develop methods for synthesizing efficient encoders for arbitrary stabilizer codes... obtaining improvements of up to 43% in two-qubit gate count and up to 70% in depth."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The search algorithms (greedy and rollout) will reliably locate high-quality stabilizer-equivalent realizations without becoming trapped in poor local optima for the codes of practical interest."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"New search algorithms over stabilizer tableaus and modular assembly techniques yield encoders with up to 43% fewer two-qubit gates and 70% lower depth than prior constructions on tested stabilizer codes including qLDPC and holographic families."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Search over stabilizer tableaus yields encoders for arbitrary stabilizer codes with up to 43% fewer two-qubit gates."}],"snapshot_sha256":"81c02c0183b43270413bbd75e05647dcb3dc05048020fe454a328229c35a6fca"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"22220053c0783a451162ba7f85de4636f569a7d5292033d09b7ed66c76f2912d"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T16:31:18.387564Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T16:27:05.353932Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:41:54.267800Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.806267Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15266/integrity.json","findings":[],"snapshot_sha256":"684775422739de59be84288c323fa5ef6db56c6c5462dc9bdb9c4a8e7d394503","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Preparing arbitrary logical states is a central primitive for universal fault-tolerant quantum computation and the cost of encoded-state preparation contributes directly to the overall resource overhead. This makes the synthesis of efficient general-state encoding circuits an important problem, particularly with respect to two-qubit gate count and circuit depth. Yet the synthesis of such encoders has been studied less extensively than general Clifford circuit synthesis or the preparation of specific logical Pauli-eigenstates. In this work, we develop methods for synthesizing efficient encoders","authors_text":"Matthew Steinberg, Robert Wille, Sascha Heu{\\ss}en, Tom Peham","cross_cats":["cs.ET"],"headline":"Search over stabilizer tableaus yields encoders for arbitrary stabilizer codes with up to 43% fewer two-qubit gates.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-14T18:00:01Z","title":"Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation"},"references":{"count":92,"internal_anchors":5,"resolved_work":92,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Wille, et al., in2024 IEEE International Conference on Quantum Software (QSW)(IEEE, 2024) pp","work_id":"1688e15a-9b08-4751-a417-2cb7d2163bf1","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"D. A. Lidar and T. A. Brun,Quantum error correction (Cambridge University Press, 2013)","work_id":"67fca206-847b-46ec-a236-8971e9a79d6d","year":2013},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"S. J. Devitt, W. J. Munro, and K. Nemoto,Quantum er- ror correction for beginners, Rep. Prog. Phys.76, 076001 (2013)","work_id":"9a387dcc-8662-47f2-9e10-9094658379d5","year":2013},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Google Quantum AI,Quantum error correction below the surface code threshold, Nature638, 920–926 (2024)","work_id":"d7ee0c6a-6195-4809-ac0f-0f365c535a5b","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Pogorelov, et al.,Experimental fault-tolerant code switching, Nat","work_id":"3ae41672-fc6c-4dde-a5a3-d07994c91208","year":2025}],"snapshot_sha256":"4472eabe67767739e975f1c5447ed93266678f8de38f42249d1bca205b1c2bc4"},"source":{"id":"2605.15266","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T16:19:09.963107Z","id":"3027e2c9-d42b-461e-88a0-f823cc2b8746","model_set":{"reader":"grok-4.3"},"one_line_summary":"New search algorithms over stabilizer tableaus and modular assembly techniques yield encoders with up to 43% fewer two-qubit gates and 70% lower depth than prior constructions on tested stabilizer codes including qLDPC and holographic families.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Search over stabilizer tableaus yields encoders for arbitrary stabilizer codes with up to 43% fewer two-qubit gates.","strongest_claim":"We develop methods for synthesizing efficient encoders for arbitrary stabilizer codes... obtaining improvements of up to 43% in two-qubit gate count and up to 70% in depth.","weakest_assumption":"The search algorithms (greedy and rollout) will reliably locate high-quality stabilizer-equivalent realizations without becoming trapped in poor local optima for the codes of practical interest."}},"verdict_id":"3027e2c9-d42b-461e-88a0-f823cc2b8746"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bfcef3eadc9bc4aa50b2cb9cd5fe6be827787a665e1ebae421a3966d621e872b","target":"record","created_at":"2026-05-20T00:00:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"38e15e3d5f92148e8832528109d66c3d6a4b0eec26c0eff439aee82a24f40839","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-14T18:00:01Z","title_canon_sha256":"e37a74bb60ad751fc5c1f560f072893e0cb492cd803a7b0ad7ec99923dac8e95"},"schema_version":"1.0","source":{"id":"2605.15266","kind":"arxiv","version":1}},"canonical_sha256":"5576c7ae159792737765d909e1c22e79f2a6050b49222abc666c17383e073f0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5576c7ae159792737765d909e1c22e79f2a6050b49222abc666c17383e073f0e","first_computed_at":"2026-05-20T00:00:49.589456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:49.589456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g0r+l9RTxQpo6z2M4ufRTxJNTwvT+vWi+7wk1Yc2TjFqmnAuYRx+LzHvAMAmqh8guFfKlcGPlxVZTdBGxXIdCw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:49.590127Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15266","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfcef3eadc9bc4aa50b2cb9cd5fe6be827787a665e1ebae421a3966d621e872b","sha256:ce6a4103bc1ecb381a5ddcc112e8fe10e5a64d4a9ffbf60165cce3425f262e92"],"state_sha256":"445ad9c2c4de67656044f01c49f574f8b8c051d3892bd6e156dde0fe29893d79"}