{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RLFNFFVSUFGBMHN7ZNJXMTI65E","short_pith_number":"pith:RLFNFFVS","schema_version":"1.0","canonical_sha256":"8acad296b2a14c161dbfcb53764d1ee93b2eb4783754dfd2578a8420927db94e","source":{"kind":"arxiv","id":"2605.19471","version":1},"attestation_state":"computed","paper":{"title":"Efficient Fault-Tolerant Ancilla Preparation for Quantum BCH codes via Cyclic Symmetry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Keisuke Fujii, Kohei Yamamoto","submitted_at":"2026-05-19T07:22:47Z","abstract_excerpt":"One of the major challenges in realizing fault-tolerant quantum computers (FTQCs) is the requirement for a large number of physical qubits. To address this issue, high-rate quantum error correcting codes, which efficiently embed logical qubits into physical qubits, have recently attracted considerable attention. Among such codes, quantum BCH codes, which offer both high rates and large code distances, are promising yet underexplored candidates. However, no fault-tolerant ancilla preparation method specialized for this class had been established. We employ a two-stage approach (non-fault-tolera"},"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":"2605.19471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-19T07:22:47Z","cross_cats_sorted":[],"title_canon_sha256":"8b6283d46b4f0a13a9c65a0c10506a73f7dec23fd9d9931435deee64c90fdc7d","abstract_canon_sha256":"d8178fd99a3a8e927853ef3d589266f432e9c7d4107a158639df7152c3afd0d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:47.447665Z","signature_b64":"V1cdBJf3IXpaXN+vDmypDLnN9toc/IUxEBMrhBHCtK+1U0UY0X8kdgw4DDQWKDpQ40QIkPJPMYOGKKKMrBlYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8acad296b2a14c161dbfcb53764d1ee93b2eb4783754dfd2578a8420927db94e","last_reissued_at":"2026-05-20T01:05:47.446868Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:47.446868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Fault-Tolerant Ancilla Preparation for Quantum BCH codes via Cyclic Symmetry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Keisuke Fujii, Kohei Yamamoto","submitted_at":"2026-05-19T07:22:47Z","abstract_excerpt":"One of the major challenges in realizing fault-tolerant quantum computers (FTQCs) is the requirement for a large number of physical qubits. To address this issue, high-rate quantum error correcting codes, which efficiently embed logical qubits into physical qubits, have recently attracted considerable attention. Among such codes, quantum BCH codes, which offer both high rates and large code distances, are promising yet underexplored candidates. However, no fault-tolerant ancilla preparation method specialized for this class had been established. We employ a two-stage approach (non-fault-tolera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19471","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/2605.19471/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":"2605.19471","created_at":"2026-05-20T01:05:47.447008+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19471v1","created_at":"2026-05-20T01:05:47.447008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19471","created_at":"2026-05-20T01:05:47.447008+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLFNFFVSUFGB","created_at":"2026-05-20T01:05:47.447008+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLFNFFVSUFGBMHN7","created_at":"2026-05-20T01:05:47.447008+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLFNFFVS","created_at":"2026-05-20T01:05:47.447008+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/RLFNFFVSUFGBMHN7ZNJXMTI65E","json":"https://pith.science/pith/RLFNFFVSUFGBMHN7ZNJXMTI65E.json","graph_json":"https://pith.science/api/pith-number/RLFNFFVSUFGBMHN7ZNJXMTI65E/graph.json","events_json":"https://pith.science/api/pith-number/RLFNFFVSUFGBMHN7ZNJXMTI65E/events.json","paper":"https://pith.science/paper/RLFNFFVS"},"agent_actions":{"view_html":"https://pith.science/pith/RLFNFFVSUFGBMHN7ZNJXMTI65E","download_json":"https://pith.science/pith/RLFNFFVSUFGBMHN7ZNJXMTI65E.json","view_paper":"https://pith.science/paper/RLFNFFVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19471&json=true","fetch_graph":"https://pith.science/api/pith-number/RLFNFFVSUFGBMHN7ZNJXMTI65E/graph.json","fetch_events":"https://pith.science/api/pith-number/RLFNFFVSUFGBMHN7ZNJXMTI65E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLFNFFVSUFGBMHN7ZNJXMTI65E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLFNFFVSUFGBMHN7ZNJXMTI65E/action/storage_attestation","attest_author":"https://pith.science/pith/RLFNFFVSUFGBMHN7ZNJXMTI65E/action/author_attestation","sign_citation":"https://pith.science/pith/RLFNFFVSUFGBMHN7ZNJXMTI65E/action/citation_signature","submit_replication":"https://pith.science/pith/RLFNFFVSUFGBMHN7ZNJXMTI65E/action/replication_record"}},"created_at":"2026-05-20T01:05:47.447008+00:00","updated_at":"2026-05-20T01:05:47.447008+00:00"}