{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2IBXV7ZELM75NWKL4C5PAFFVVO","short_pith_number":"pith:2IBXV7ZE","schema_version":"1.0","canonical_sha256":"d2037aff245b3fd6d94be0baf014b5aba422b214b7f988a60d1dd9fad83f6774","source":{"kind":"arxiv","id":"2506.13619","version":1},"attestation_state":"computed","paper":{"title":"Blocklet concatenation: Low-overhead fault-tolerant protocols for fusion-based quantum computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Litinski","submitted_at":"2025-06-16T15:48:19Z","abstract_excerpt":"We introduce a construction for protocols for fault-tolerant quantum computing based on code concatenation and transversal gates. These protocols can be interpreted as families of quantum circuits of low-weight stabilizer measurements without strict locality constraints, effectively implementing concatenated codes. However, we primarily study these protocols in the context of photonic fusion-based quantum computing (FBQC), where they yield families of fusion networks with constant-sized resource states. Their high erasure thresholds relative to their resource-state cost establish them as promi"},"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":"2506.13619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-06-16T15:48:19Z","cross_cats_sorted":[],"title_canon_sha256":"042e0a3022eb9163cadd2f11bec49bfe0c22314ae0cbbf396cc05995e92360ba","abstract_canon_sha256":"77dbe137a30bfaa128e144d404f71f5b0c9615e47b060abb24413b95c4d294ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:23.488766Z","signature_b64":"QBuXREoGS9p5FWyE1d4FZDAdfZa1D1y6U6NVDmSUHm4azpFmli3czLNRuBgUh0JnRyWC2GQ9H0twwQVxsagrBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2037aff245b3fd6d94be0baf014b5aba422b214b7f988a60d1dd9fad83f6774","last_reissued_at":"2026-07-05T11:22:23.488224Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:23.488224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Blocklet concatenation: Low-overhead fault-tolerant protocols for fusion-based quantum computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Litinski","submitted_at":"2025-06-16T15:48:19Z","abstract_excerpt":"We introduce a construction for protocols for fault-tolerant quantum computing based on code concatenation and transversal gates. These protocols can be interpreted as families of quantum circuits of low-weight stabilizer measurements without strict locality constraints, effectively implementing concatenated codes. However, we primarily study these protocols in the context of photonic fusion-based quantum computing (FBQC), where they yield families of fusion networks with constant-sized resource states. Their high erasure thresholds relative to their resource-state cost establish them as promi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.13619","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/2506.13619/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":"2506.13619","created_at":"2026-07-05T11:22:23.488282+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.13619v1","created_at":"2026-07-05T11:22:23.488282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.13619","created_at":"2026-07-05T11:22:23.488282+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IBXV7ZELM75","created_at":"2026-07-05T11:22:23.488282+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IBXV7ZELM75NWKL","created_at":"2026-07-05T11:22:23.488282+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IBXV7ZE","created_at":"2026-07-05T11:22:23.488282+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.28936","citing_title":"Hardware-Tailored Resource Estimation for Magic-State Distillation on Silicon Spin Qubits","ref_index":56,"is_internal_anchor":false},{"citing_arxiv_id":"2507.16152","citing_title":"Practical blueprint for low-depth photonic quantum computing with quantum dots","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2509.13247","citing_title":"Demonstration of a Logical Architecture Uniting Motion and In-Place Entanglement","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2603.05320","citing_title":"Simplified circuit-level decoding using Knill error correction","ref_index":65,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2IBXV7ZELM75NWKL4C5PAFFVVO","json":"https://pith.science/pith/2IBXV7ZELM75NWKL4C5PAFFVVO.json","graph_json":"https://pith.science/api/pith-number/2IBXV7ZELM75NWKL4C5PAFFVVO/graph.json","events_json":"https://pith.science/api/pith-number/2IBXV7ZELM75NWKL4C5PAFFVVO/events.json","paper":"https://pith.science/paper/2IBXV7ZE"},"agent_actions":{"view_html":"https://pith.science/pith/2IBXV7ZELM75NWKL4C5PAFFVVO","download_json":"https://pith.science/pith/2IBXV7ZELM75NWKL4C5PAFFVVO.json","view_paper":"https://pith.science/paper/2IBXV7ZE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.13619&json=true","fetch_graph":"https://pith.science/api/pith-number/2IBXV7ZELM75NWKL4C5PAFFVVO/graph.json","fetch_events":"https://pith.science/api/pith-number/2IBXV7ZELM75NWKL4C5PAFFVVO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IBXV7ZELM75NWKL4C5PAFFVVO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IBXV7ZELM75NWKL4C5PAFFVVO/action/storage_attestation","attest_author":"https://pith.science/pith/2IBXV7ZELM75NWKL4C5PAFFVVO/action/author_attestation","sign_citation":"https://pith.science/pith/2IBXV7ZELM75NWKL4C5PAFFVVO/action/citation_signature","submit_replication":"https://pith.science/pith/2IBXV7ZELM75NWKL4C5PAFFVVO/action/replication_record"}},"created_at":"2026-07-05T11:22:23.488282+00:00","updated_at":"2026-07-05T11:22:23.488282+00:00"}