{"paper":{"title":"Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Search over stabilizer tableaus yields encoders for arbitrary stabilizer codes with up to 43% fewer two-qubit gates.","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Matthew Steinberg, Robert Wille, Sascha Heu{\\ss}en, Tom Peham","submitted_at":"2026-05-14T18:00:01Z","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"},"claims":{"count":4,"items":[{"kind":"strongest_claim","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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Search over stabilizer tableaus yields encoders for arbitrary stabilizer codes with up to 43% fewer two-qubit gates.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"81c02c0183b43270413bbd75e05647dcb3dc05048020fe454a328229c35a6fca"},"source":{"id":"2605.15266","kind":"arxiv","version":1},"verdict":{"id":"3027e2c9-d42b-461e-88a0-f823cc2b8746","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T16:19:09.963107Z","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.","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","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.","pith_extraction_headline":"Search over stabilizer tableaus yields encoders for arbitrary stabilizer codes with up to 43% fewer two-qubit gates."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15266/integrity.json","findings":[],"available":true,"detectors_run":[{"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","findings_count":0}],"snapshot_sha256":"684775422739de59be84288c323fa5ef6db56c6c5462dc9bdb9c4a8e7d394503"},"references":{"count":92,"sample":[{"doi":"","year":2024,"title":"Wille, et al., in2024 IEEE International Conference on Quantum Software (QSW)(IEEE, 2024) pp","work_id":"1688e15a-9b08-4751-a417-2cb7d2163bf1","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"D. A. Lidar and T. A. Brun,Quantum error correction (Cambridge University Press, 2013)","work_id":"67fca206-847b-46ec-a236-8971e9a79d6d","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"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","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Google Quantum AI,Quantum error correction below the surface code threshold, Nature638, 920–926 (2024)","work_id":"d7ee0c6a-6195-4809-ac0f-0f365c535a5b","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Pogorelov, et al.,Experimental fault-tolerant code switching, Nat","work_id":"3ae41672-fc6c-4dde-a5a3-d07994c91208","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":92,"snapshot_sha256":"4472eabe67767739e975f1c5447ed93266678f8de38f42249d1bca205b1c2bc4","internal_anchors":5},"formal_canon":{"evidence_count":1,"snapshot_sha256":"22220053c0783a451162ba7f85de4636f569a7d5292033d09b7ed66c76f2912d"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}