{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:APJ66BGJDBVSHGKP4M4A7DZVC4","short_pith_number":"pith:APJ66BGJ","schema_version":"1.0","canonical_sha256":"03d3ef04c9186b23994fe3380f8f351703480a004b2d1386d259389be7571ebd","source":{"kind":"arxiv","id":"2409.14765","version":2},"attestation_state":"computed","paper":{"title":"Compare the Pair: Rotated vs. Unrotated Surface Codes at Equal Logical Error Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anthony Ryan O'Rourke, Simon Devitt","submitted_at":"2024-09-23T07:27:20Z","abstract_excerpt":"Practical quantum computers will require resource-efficient error-correcting codes. The rotated surface code uses approximately half the number of qubits as the unrotated surface code to create a logical qubit with the same error-correcting distance. However, instead of distance, a more useful qubit-saving metric would be based on logical error rates. In this work we find the well-below-threshold scaling of logical to physical error rates under circuit-level noise for both codes at high odd and even distances, then compare the number of qubits used by each code to achieve equal logical error r"},"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":"2409.14765","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-09-23T07:27:20Z","cross_cats_sorted":[],"title_canon_sha256":"417ce95abf4f39d9477513cf262ff6b4679206cf2c5de8a2ad0e3ac748ff77c4","abstract_canon_sha256":"e7b308b6984e367deae0366718322fa35eba7d89defe62a3492657e10811552e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:19:12.299839Z","signature_b64":"j3jD7WrzgZBj97gculeY3K4V8cMhDQ0J3+roqg7d8gYX6A1sklgh2VTYuJqxkXfDNyTBOL0UUSzn1GlhBI60Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03d3ef04c9186b23994fe3380f8f351703480a004b2d1386d259389be7571ebd","last_reissued_at":"2026-07-05T09:19:12.299358Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:19:12.299358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compare the Pair: Rotated vs. Unrotated Surface Codes at Equal Logical Error Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anthony Ryan O'Rourke, Simon Devitt","submitted_at":"2024-09-23T07:27:20Z","abstract_excerpt":"Practical quantum computers will require resource-efficient error-correcting codes. The rotated surface code uses approximately half the number of qubits as the unrotated surface code to create a logical qubit with the same error-correcting distance. However, instead of distance, a more useful qubit-saving metric would be based on logical error rates. In this work we find the well-below-threshold scaling of logical to physical error rates under circuit-level noise for both codes at high odd and even distances, then compare the number of qubits used by each code to achieve equal logical error r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.14765","kind":"arxiv","version":2},"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/2409.14765/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":"2409.14765","created_at":"2026-07-05T09:19:12.299417+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.14765v2","created_at":"2026-07-05T09:19:12.299417+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.14765","created_at":"2026-07-05T09:19:12.299417+00:00"},{"alias_kind":"pith_short_12","alias_value":"APJ66BGJDBVS","created_at":"2026-07-05T09:19:12.299417+00:00"},{"alias_kind":"pith_short_16","alias_value":"APJ66BGJDBVSHGKP","created_at":"2026-07-05T09:19:12.299417+00:00"},{"alias_kind":"pith_short_8","alias_value":"APJ66BGJ","created_at":"2026-07-05T09:19:12.299417+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.14670","citing_title":"Computing logical error thresholds with the Pauli Frame Sparse Representation","ref_index":76,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11318","citing_title":"Spatial overhead reduction for 2D hypergraph product codes","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03951","citing_title":"Factoring $2048$ bit RSA integers with a half-million-qubit modular atomic processor","ref_index":83,"is_internal_anchor":false},{"citing_arxiv_id":"2602.11457","citing_title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","ref_index":66,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/APJ66BGJDBVSHGKP4M4A7DZVC4","json":"https://pith.science/pith/APJ66BGJDBVSHGKP4M4A7DZVC4.json","graph_json":"https://pith.science/api/pith-number/APJ66BGJDBVSHGKP4M4A7DZVC4/graph.json","events_json":"https://pith.science/api/pith-number/APJ66BGJDBVSHGKP4M4A7DZVC4/events.json","paper":"https://pith.science/paper/APJ66BGJ"},"agent_actions":{"view_html":"https://pith.science/pith/APJ66BGJDBVSHGKP4M4A7DZVC4","download_json":"https://pith.science/pith/APJ66BGJDBVSHGKP4M4A7DZVC4.json","view_paper":"https://pith.science/paper/APJ66BGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.14765&json=true","fetch_graph":"https://pith.science/api/pith-number/APJ66BGJDBVSHGKP4M4A7DZVC4/graph.json","fetch_events":"https://pith.science/api/pith-number/APJ66BGJDBVSHGKP4M4A7DZVC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/APJ66BGJDBVSHGKP4M4A7DZVC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/APJ66BGJDBVSHGKP4M4A7DZVC4/action/storage_attestation","attest_author":"https://pith.science/pith/APJ66BGJDBVSHGKP4M4A7DZVC4/action/author_attestation","sign_citation":"https://pith.science/pith/APJ66BGJDBVSHGKP4M4A7DZVC4/action/citation_signature","submit_replication":"https://pith.science/pith/APJ66BGJDBVSHGKP4M4A7DZVC4/action/replication_record"}},"created_at":"2026-07-05T09:19:12.299417+00:00","updated_at":"2026-07-05T09:19:12.299417+00:00"}