{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BYO3WQHXGDW2DNR62CLHGWJHQ4","short_pith_number":"pith:BYO3WQHX","schema_version":"1.0","canonical_sha256":"0e1dbb40f730eda1b63ed096735927872152875ca58adf79a91a417655c0855c","source":{"kind":"arxiv","id":"2503.04968","version":1},"attestation_state":"computed","paper":{"title":"Optimized noise-resilient surface code teleportation interfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Denis Sedov, Leonid P. Pryadko, Mohamed A. Shalby, Renyu Wang","submitted_at":"2025-03-06T21:00:28Z","abstract_excerpt":"Connecting two surface-code patches may require significantly higher noise at the interface. We show, via circuit-level simulations under a depolarizing noise model with idle errors, that surface codes remain fault tolerant despite substantially elevated interface error rates. Specifically, we compare three strategies -- direct noisy links, gate teleportation, and a CAT-state gadget -- for both rotated and unrotated surface codes, and demonstrate that careful design can mitigate hook errors in each case so that the full code distance is preserved for both $X$ and $Z$. Although these methods di"},"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":"2503.04968","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-03-06T21:00:28Z","cross_cats_sorted":[],"title_canon_sha256":"a3ca4a07b0658e55eceade57f89581c2ecf864e1846a1d535bc954a013f6debd","abstract_canon_sha256":"6b605fae14c23103502dd9aee9881e98620061add8600122ac8f1865b70f078e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:26:17.574124Z","signature_b64":"dVvO84KbyOUiXR9kxUlPhdPgkXlbcmRx9CU4Z6+vXOYj+vyRsEqiKlJ3bB+CU/Xr+ChhU/f2UUFJHkwhOS4ZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e1dbb40f730eda1b63ed096735927872152875ca58adf79a91a417655c0855c","last_reissued_at":"2026-07-05T10:26:17.573518Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:26:17.573518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimized noise-resilient surface code teleportation interfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Denis Sedov, Leonid P. Pryadko, Mohamed A. Shalby, Renyu Wang","submitted_at":"2025-03-06T21:00:28Z","abstract_excerpt":"Connecting two surface-code patches may require significantly higher noise at the interface. We show, via circuit-level simulations under a depolarizing noise model with idle errors, that surface codes remain fault tolerant despite substantially elevated interface error rates. Specifically, we compare three strategies -- direct noisy links, gate teleportation, and a CAT-state gadget -- for both rotated and unrotated surface codes, and demonstrate that careful design can mitigate hook errors in each case so that the full code distance is preserved for both $X$ and $Z$. Although these methods di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.04968","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/2503.04968/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":"2503.04968","created_at":"2026-07-05T10:26:17.573593+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.04968v1","created_at":"2026-07-05T10:26:17.573593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.04968","created_at":"2026-07-05T10:26:17.573593+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYO3WQHXGDW2","created_at":"2026-07-05T10:26:17.573593+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYO3WQHXGDW2DNR6","created_at":"2026-07-05T10:26:17.573593+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYO3WQHX","created_at":"2026-07-05T10:26:17.573593+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2603.06513","citing_title":"Remote Entanglement in Lattice Surgery: To Distill, or Not to Distill","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2504.05611","citing_title":"Transversal Fault Tolerant Distributed Quantum Computing Operations","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BYO3WQHXGDW2DNR62CLHGWJHQ4","json":"https://pith.science/pith/BYO3WQHXGDW2DNR62CLHGWJHQ4.json","graph_json":"https://pith.science/api/pith-number/BYO3WQHXGDW2DNR62CLHGWJHQ4/graph.json","events_json":"https://pith.science/api/pith-number/BYO3WQHXGDW2DNR62CLHGWJHQ4/events.json","paper":"https://pith.science/paper/BYO3WQHX"},"agent_actions":{"view_html":"https://pith.science/pith/BYO3WQHXGDW2DNR62CLHGWJHQ4","download_json":"https://pith.science/pith/BYO3WQHXGDW2DNR62CLHGWJHQ4.json","view_paper":"https://pith.science/paper/BYO3WQHX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.04968&json=true","fetch_graph":"https://pith.science/api/pith-number/BYO3WQHXGDW2DNR62CLHGWJHQ4/graph.json","fetch_events":"https://pith.science/api/pith-number/BYO3WQHXGDW2DNR62CLHGWJHQ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYO3WQHXGDW2DNR62CLHGWJHQ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYO3WQHXGDW2DNR62CLHGWJHQ4/action/storage_attestation","attest_author":"https://pith.science/pith/BYO3WQHXGDW2DNR62CLHGWJHQ4/action/author_attestation","sign_citation":"https://pith.science/pith/BYO3WQHXGDW2DNR62CLHGWJHQ4/action/citation_signature","submit_replication":"https://pith.science/pith/BYO3WQHXGDW2DNR62CLHGWJHQ4/action/replication_record"}},"created_at":"2026-07-05T10:26:17.573593+00:00","updated_at":"2026-07-05T10:26:17.573593+00:00"}