{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3KBSQXJQBBH64BMROVIPMNMJVE","short_pith_number":"pith:3KBSQXJQ","schema_version":"1.0","canonical_sha256":"da83285d30084fee05917550f63589a93b5b64c9bf4fe17c1a9a71bc467ca201","source":{"kind":"arxiv","id":"2408.11894","version":3},"attestation_state":"computed","paper":{"title":"Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error Correction Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Lucas Berent, Ludwig Schmid, Markus M\\\"uller, Robert Wille, Tom Peham","submitted_at":"2024-08-21T18:00:01Z","abstract_excerpt":"A central ingredient in fault-tolerant quantum algorithms is the initialization of a logical state for a given quantum error-correcting code from a set of noisy qubits. A scheme that has demonstrated promising results for small code instances that are realizable on currently available hardware composes a non-fault-tolerant state preparation step with a verification step that checks for spreading errors. Known circuit constructions of this scheme are mostly obtained manually, and no algorithmic techniques for constructing depth- or gate-optimal circuits exist. As a consequence, the current stat"},"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":"2408.11894","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-08-21T18:00:01Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"a102606cbcf429c6ce44cd77490f6efea5b093c7bd6f6b3e02c9a096d7593199","abstract_canon_sha256":"3c89912d17c1e2b8b464181c505dcfd8a9e9afe607e0100183c8aaee63a17835"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:03:51.655535Z","signature_b64":"IUJbrmsxTasAnjAUAybcPN1mamrv/k/s9wsHIPXQVmxzziloLOE+CGmKqN1KA4gFtA8oGQ15EleCAbbdNOKVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da83285d30084fee05917550f63589a93b5b64c9bf4fe17c1a9a71bc467ca201","last_reissued_at":"2026-07-05T11:03:51.654975Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:03:51.654975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error Correction Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Lucas Berent, Ludwig Schmid, Markus M\\\"uller, Robert Wille, Tom Peham","submitted_at":"2024-08-21T18:00:01Z","abstract_excerpt":"A central ingredient in fault-tolerant quantum algorithms is the initialization of a logical state for a given quantum error-correcting code from a set of noisy qubits. A scheme that has demonstrated promising results for small code instances that are realizable on currently available hardware composes a non-fault-tolerant state preparation step with a verification step that checks for spreading errors. Known circuit constructions of this scheme are mostly obtained manually, and no algorithmic techniques for constructing depth- or gate-optimal circuits exist. As a consequence, the current stat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.11894","kind":"arxiv","version":3},"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/2408.11894/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":"2408.11894","created_at":"2026-07-05T11:03:51.655033+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.11894v3","created_at":"2026-07-05T11:03:51.655033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.11894","created_at":"2026-07-05T11:03:51.655033+00:00"},{"alias_kind":"pith_short_12","alias_value":"3KBSQXJQBBH6","created_at":"2026-07-05T11:03:51.655033+00:00"},{"alias_kind":"pith_short_16","alias_value":"3KBSQXJQBBH64BMR","created_at":"2026-07-05T11:03:51.655033+00:00"},{"alias_kind":"pith_short_8","alias_value":"3KBSQXJQ","created_at":"2026-07-05T11:03:51.655033+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.19471","citing_title":"Efficient Fault-Tolerant Ancilla Preparation for Quantum BCH codes via Cyclic Symmetry","ref_index":37,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3KBSQXJQBBH64BMROVIPMNMJVE","json":"https://pith.science/pith/3KBSQXJQBBH64BMROVIPMNMJVE.json","graph_json":"https://pith.science/api/pith-number/3KBSQXJQBBH64BMROVIPMNMJVE/graph.json","events_json":"https://pith.science/api/pith-number/3KBSQXJQBBH64BMROVIPMNMJVE/events.json","paper":"https://pith.science/paper/3KBSQXJQ"},"agent_actions":{"view_html":"https://pith.science/pith/3KBSQXJQBBH64BMROVIPMNMJVE","download_json":"https://pith.science/pith/3KBSQXJQBBH64BMROVIPMNMJVE.json","view_paper":"https://pith.science/paper/3KBSQXJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.11894&json=true","fetch_graph":"https://pith.science/api/pith-number/3KBSQXJQBBH64BMROVIPMNMJVE/graph.json","fetch_events":"https://pith.science/api/pith-number/3KBSQXJQBBH64BMROVIPMNMJVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3KBSQXJQBBH64BMROVIPMNMJVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3KBSQXJQBBH64BMROVIPMNMJVE/action/storage_attestation","attest_author":"https://pith.science/pith/3KBSQXJQBBH64BMROVIPMNMJVE/action/author_attestation","sign_citation":"https://pith.science/pith/3KBSQXJQBBH64BMROVIPMNMJVE/action/citation_signature","submit_replication":"https://pith.science/pith/3KBSQXJQBBH64BMROVIPMNMJVE/action/replication_record"}},"created_at":"2026-07-05T11:03:51.655033+00:00","updated_at":"2026-07-05T11:03:51.655033+00:00"}