{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FVSWLXV4BMTHQVFLB7QHBRPWBQ","short_pith_number":"pith:FVSWLXV4","schema_version":"1.0","canonical_sha256":"2d6565debc0b267854ab0fe070c5f60c172be92483c43783fb696240dc632c56","source":{"kind":"arxiv","id":"2411.17519","version":1},"attestation_state":"computed","paper":{"title":"High-Performance and Scalable Fault-Tolerant Quantum Computation with Lattice Surgery on a 2.5D Architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"quant-ph","authors_text":"Hiroshi Nakamura, Shuhei Tamate, Taku Saito, Teruo Tanimoto, Yasunari Suzuki, Yosuke Ueno, Yutaka Tabuchi","submitted_at":"2024-11-26T15:27:59Z","abstract_excerpt":"Due to the high error rate of a qubit, detecting and correcting errors on it is essential for fault-tolerant quantum computing (FTQC). Among several FTQC techniques, lattice surgery (LS) using surface code (SC) is currently promising. To demonstrate practical quantum advantage as early as possible, it is indispensable to propose a high-performance and low-overhead FTQC architecture specialized for a given FTQC scheme based on detailed analysis.\n  In this study, we first categorize the factors, or hazards, that degrade LS-based FTQC performance and propose a performance evaluation methodology t"},"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":"2411.17519","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-26T15:27:59Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"9d4039770e07d97e7ed0a2613b9f634c688f7edaf1f4dcb18c2a97032dd9d349","abstract_canon_sha256":"6ba0066d4b436c514b8aa4d6badfec48b3d71d0dfdc7c939c86665d0ef1b1e59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:48.232004Z","signature_b64":"gPJYHGc7e5qbwZmGUkYNQMDkY3VUpTy3z7f4pVvJh5N3OJ8KtWKcaMsIwiyRjRWgAcWxPeV0LpNDvAjqgfxDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d6565debc0b267854ab0fe070c5f60c172be92483c43783fb696240dc632c56","last_reissued_at":"2026-07-05T09:40:48.231446Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:48.231446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-Performance and Scalable Fault-Tolerant Quantum Computation with Lattice Surgery on a 2.5D Architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"quant-ph","authors_text":"Hiroshi Nakamura, Shuhei Tamate, Taku Saito, Teruo Tanimoto, Yasunari Suzuki, Yosuke Ueno, Yutaka Tabuchi","submitted_at":"2024-11-26T15:27:59Z","abstract_excerpt":"Due to the high error rate of a qubit, detecting and correcting errors on it is essential for fault-tolerant quantum computing (FTQC). Among several FTQC techniques, lattice surgery (LS) using surface code (SC) is currently promising. To demonstrate practical quantum advantage as early as possible, it is indispensable to propose a high-performance and low-overhead FTQC architecture specialized for a given FTQC scheme based on detailed analysis.\n  In this study, we first categorize the factors, or hazards, that degrade LS-based FTQC performance and propose a performance evaluation methodology t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17519","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/2411.17519/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":"2411.17519","created_at":"2026-07-05T09:40:48.231528+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.17519v1","created_at":"2026-07-05T09:40:48.231528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17519","created_at":"2026-07-05T09:40:48.231528+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVSWLXV4BMTH","created_at":"2026-07-05T09:40:48.231528+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVSWLXV4BMTHQVFL","created_at":"2026-07-05T09:40:48.231528+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVSWLXV4","created_at":"2026-07-05T09:40:48.231528+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21192","citing_title":"Bounded-depth spacetime lattice surgery for resource-efficient fault-tolerant quantum computation","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2511.06758","citing_title":"Dense packing of the surface code: code deformation procedures and hook-error-avoiding gate scheduling","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19855","citing_title":"Toward designing workload-aware Surface Code Architectures","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15099","citing_title":"O3LS: Optimizing Lattice Surgery via Automatic Layout Searching and Loose Scheduling","ref_index":50,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FVSWLXV4BMTHQVFLB7QHBRPWBQ","json":"https://pith.science/pith/FVSWLXV4BMTHQVFLB7QHBRPWBQ.json","graph_json":"https://pith.science/api/pith-number/FVSWLXV4BMTHQVFLB7QHBRPWBQ/graph.json","events_json":"https://pith.science/api/pith-number/FVSWLXV4BMTHQVFLB7QHBRPWBQ/events.json","paper":"https://pith.science/paper/FVSWLXV4"},"agent_actions":{"view_html":"https://pith.science/pith/FVSWLXV4BMTHQVFLB7QHBRPWBQ","download_json":"https://pith.science/pith/FVSWLXV4BMTHQVFLB7QHBRPWBQ.json","view_paper":"https://pith.science/paper/FVSWLXV4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.17519&json=true","fetch_graph":"https://pith.science/api/pith-number/FVSWLXV4BMTHQVFLB7QHBRPWBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/FVSWLXV4BMTHQVFLB7QHBRPWBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVSWLXV4BMTHQVFLB7QHBRPWBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVSWLXV4BMTHQVFLB7QHBRPWBQ/action/storage_attestation","attest_author":"https://pith.science/pith/FVSWLXV4BMTHQVFLB7QHBRPWBQ/action/author_attestation","sign_citation":"https://pith.science/pith/FVSWLXV4BMTHQVFLB7QHBRPWBQ/action/citation_signature","submit_replication":"https://pith.science/pith/FVSWLXV4BMTHQVFLB7QHBRPWBQ/action/replication_record"}},"created_at":"2026-07-05T09:40:48.231528+00:00","updated_at":"2026-07-05T09:40:48.231528+00:00"}