{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PVZQYME5OXFAAKA5IJQUVF5LYM","short_pith_number":"pith:PVZQYME5","schema_version":"1.0","canonical_sha256":"7d730c309d75ca00281d42614a97abc332195faa81ccf900953a9cf73c8af669","source":{"kind":"arxiv","id":"2501.05527","version":1},"attestation_state":"computed","paper":{"title":"Deterministic Fault-Tolerant State Preparation for Near-Term Quantum Error Correction: Automatic Synthesis Using Boolean Satisfiability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lucas Berent, Ludwig Schmid, Markus M\\\"uller, Robert Wille, Tom Peham","submitted_at":"2025-01-09T19:06:01Z","abstract_excerpt":"To ensure resilience against the unavoidable noise in quantum computers, quantum information needs to be encoded using an error-correcting code, and circuits must have a particular structure to be fault-tolerant. Compilation of fault-tolerant quantum circuits is thus inherently different from the non-fault-tolerant case. However, automated fault-tolerant compilation methods are widely underexplored, and most known constructions are obtained manually for specific codes only. In this work, we focus on the problem of automatically synthesizing fault-tolerant circuits for the deterministic initial"},"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":"2501.05527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-01-09T19:06:01Z","cross_cats_sorted":[],"title_canon_sha256":"3daa95fde3c528d1d528851d09e48366e4148366d6581d7ddbb2ed6e017be5bd","abstract_canon_sha256":"95f92a3f76bb61aece1b800f244ec1e5541637098f310e91c7e8e06b80e24e71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:59:24.699136Z","signature_b64":"p8Wf8JXH6k7vqCUg9ceNG4GnvtYfTI7Xu1MYq2UL8/b9eCKrp18jIh5sGF/IggAWOTu1jwGjPJKokqFlmTmVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d730c309d75ca00281d42614a97abc332195faa81ccf900953a9cf73c8af669","last_reissued_at":"2026-07-05T09:59:24.698745Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:59:24.698745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Fault-Tolerant State Preparation for Near-Term Quantum Error Correction: Automatic Synthesis Using Boolean Satisfiability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lucas Berent, Ludwig Schmid, Markus M\\\"uller, Robert Wille, Tom Peham","submitted_at":"2025-01-09T19:06:01Z","abstract_excerpt":"To ensure resilience against the unavoidable noise in quantum computers, quantum information needs to be encoded using an error-correcting code, and circuits must have a particular structure to be fault-tolerant. Compilation of fault-tolerant quantum circuits is thus inherently different from the non-fault-tolerant case. However, automated fault-tolerant compilation methods are widely underexplored, and most known constructions are obtained manually for specific codes only. In this work, we focus on the problem of automatically synthesizing fault-tolerant circuits for the deterministic initial"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.05527","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/2501.05527/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":"2501.05527","created_at":"2026-07-05T09:59:24.698801+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.05527v1","created_at":"2026-07-05T09:59:24.698801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.05527","created_at":"2026-07-05T09:59:24.698801+00:00"},{"alias_kind":"pith_short_12","alias_value":"PVZQYME5OXFA","created_at":"2026-07-05T09:59:24.698801+00:00"},{"alias_kind":"pith_short_16","alias_value":"PVZQYME5OXFAAKA5","created_at":"2026-07-05T09:59:24.698801+00:00"},{"alias_kind":"pith_short_8","alias_value":"PVZQYME5","created_at":"2026-07-05T09:59:24.698801+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/PVZQYME5OXFAAKA5IJQUVF5LYM","json":"https://pith.science/pith/PVZQYME5OXFAAKA5IJQUVF5LYM.json","graph_json":"https://pith.science/api/pith-number/PVZQYME5OXFAAKA5IJQUVF5LYM/graph.json","events_json":"https://pith.science/api/pith-number/PVZQYME5OXFAAKA5IJQUVF5LYM/events.json","paper":"https://pith.science/paper/PVZQYME5"},"agent_actions":{"view_html":"https://pith.science/pith/PVZQYME5OXFAAKA5IJQUVF5LYM","download_json":"https://pith.science/pith/PVZQYME5OXFAAKA5IJQUVF5LYM.json","view_paper":"https://pith.science/paper/PVZQYME5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.05527&json=true","fetch_graph":"https://pith.science/api/pith-number/PVZQYME5OXFAAKA5IJQUVF5LYM/graph.json","fetch_events":"https://pith.science/api/pith-number/PVZQYME5OXFAAKA5IJQUVF5LYM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PVZQYME5OXFAAKA5IJQUVF5LYM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PVZQYME5OXFAAKA5IJQUVF5LYM/action/storage_attestation","attest_author":"https://pith.science/pith/PVZQYME5OXFAAKA5IJQUVF5LYM/action/author_attestation","sign_citation":"https://pith.science/pith/PVZQYME5OXFAAKA5IJQUVF5LYM/action/citation_signature","submit_replication":"https://pith.science/pith/PVZQYME5OXFAAKA5IJQUVF5LYM/action/replication_record"}},"created_at":"2026-07-05T09:59:24.698801+00:00","updated_at":"2026-07-05T09:59:24.698801+00:00"}