{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:O2VW3734TEGEPYIXQI6LN3UVT4","short_pith_number":"pith:O2VW3734","schema_version":"1.0","canonical_sha256":"76ab6dff7c990c47e117823cb6ee959f2185279ca5c6eda6ec81cf915a9f560f","source":{"kind":"arxiv","id":"2403.16054","version":3},"attestation_state":"computed","paper":{"title":"Many-hypercube codes: High-rate quantum error-correcting codes for high-performance fault-tolerant quantum computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hayato Goto","submitted_at":"2024-03-24T07:46:26Z","abstract_excerpt":"Standard approaches to quantum error correction for fault-tolerant quantum computing are based on encoding a single logical qubit into many physical ones, resulting in asymptotically zero encoding rates and therefore huge resource overheads. To overcome this issue, high-rate quantum codes, such as quantum low-density parity-check codes, have been studied over the past decade. In this case, however, it is difficult to perform logical gates in parallel while maintaining low overheads. Here we propose concatenated high-rate small-size quantum error-detecting codes as a new family of high-rate qua"},"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":"2403.16054","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-03-24T07:46:26Z","cross_cats_sorted":[],"title_canon_sha256":"ef3acfb4a7554a44e0e0ee1865c60f613d6835af8e50f59dbbe444b08b707da9","abstract_canon_sha256":"e6fc212b57bd1813f1cf35bca72a2bdefc6f6a4b3043258f832a1e380b6ef961"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:03:19.183625Z","signature_b64":"3jjQr5qKoCE4/C9R2Oi23gwCSO7gdSfwujJrBDIMIQgcV9GPsdcdN/5gFD9y3TFQy4ooASeivGAEIZ8MfWhnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76ab6dff7c990c47e117823cb6ee959f2185279ca5c6eda6ec81cf915a9f560f","last_reissued_at":"2026-07-05T09:03:19.183145Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:03:19.183145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Many-hypercube codes: High-rate quantum error-correcting codes for high-performance fault-tolerant quantum computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hayato Goto","submitted_at":"2024-03-24T07:46:26Z","abstract_excerpt":"Standard approaches to quantum error correction for fault-tolerant quantum computing are based on encoding a single logical qubit into many physical ones, resulting in asymptotically zero encoding rates and therefore huge resource overheads. To overcome this issue, high-rate quantum codes, such as quantum low-density parity-check codes, have been studied over the past decade. In this case, however, it is difficult to perform logical gates in parallel while maintaining low overheads. Here we propose concatenated high-rate small-size quantum error-detecting codes as a new family of high-rate qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.16054","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/2403.16054/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":"2403.16054","created_at":"2026-07-05T09:03:19.183204+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.16054v3","created_at":"2026-07-05T09:03:19.183204+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.16054","created_at":"2026-07-05T09:03:19.183204+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2VW3734TEGE","created_at":"2026-07-05T09:03:19.183204+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2VW3734TEGEPYIX","created_at":"2026-07-05T09:03:19.183204+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2VW3734","created_at":"2026-07-05T09:03:19.183204+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.17339","citing_title":"Fault-Tolerant Cut-Cat State Syndrome Extraction for Quantum Codes","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O2VW3734TEGEPYIXQI6LN3UVT4","json":"https://pith.science/pith/O2VW3734TEGEPYIXQI6LN3UVT4.json","graph_json":"https://pith.science/api/pith-number/O2VW3734TEGEPYIXQI6LN3UVT4/graph.json","events_json":"https://pith.science/api/pith-number/O2VW3734TEGEPYIXQI6LN3UVT4/events.json","paper":"https://pith.science/paper/O2VW3734"},"agent_actions":{"view_html":"https://pith.science/pith/O2VW3734TEGEPYIXQI6LN3UVT4","download_json":"https://pith.science/pith/O2VW3734TEGEPYIXQI6LN3UVT4.json","view_paper":"https://pith.science/paper/O2VW3734","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.16054&json=true","fetch_graph":"https://pith.science/api/pith-number/O2VW3734TEGEPYIXQI6LN3UVT4/graph.json","fetch_events":"https://pith.science/api/pith-number/O2VW3734TEGEPYIXQI6LN3UVT4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2VW3734TEGEPYIXQI6LN3UVT4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2VW3734TEGEPYIXQI6LN3UVT4/action/storage_attestation","attest_author":"https://pith.science/pith/O2VW3734TEGEPYIXQI6LN3UVT4/action/author_attestation","sign_citation":"https://pith.science/pith/O2VW3734TEGEPYIXQI6LN3UVT4/action/citation_signature","submit_replication":"https://pith.science/pith/O2VW3734TEGEPYIXQI6LN3UVT4/action/replication_record"}},"created_at":"2026-07-05T09:03:19.183204+00:00","updated_at":"2026-07-05T09:03:19.183204+00:00"}