{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:GTGKIL27SYPSK7LDN4KMPGJ36X","short_pith_number":"pith:GTGKIL27","schema_version":"1.0","canonical_sha256":"34cca42f5f961f257d636f14c7993bf5c8a8f294690ff9aa33cea618c022de0e","source":{"kind":"arxiv","id":"2209.06673","version":2},"attestation_state":"computed","paper":{"title":"Fault-Tolerant Preparation of Quantum Polar Codes Encoding One Logical Qubit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Ashutosh Goswami, Mehdi Mhalla, Valentin Savin","submitted_at":"2022-09-14T14:30:09Z","abstract_excerpt":"This paper explores a new approach to fault-tolerant quantum computing (FTQC), relying on quantum polar codes. We consider quantum polar codes of Calderbank-Shor-Steane type, encoding one logical qubit, which we refer to as $\\mathcal{Q}_1$ codes. First, we show that a subfamily of $\\mathcal{Q}_1$ codes is equivalent to the well-known family of Shor codes. Moreover, we show that $\\mathcal{Q}_1$ codes significantly outperform Shor codes, of the same length and minimum distance. Second, we consider the fault-tolerant preparation of $\\mathcal{Q}_1$ code states. We give a recursive procedure to pre"},"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":"2209.06673","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-09-14T14:30:09Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3965dc6cba19eea40221d75d41d263bd2434ff330deef9d8bf55e93efc48187e","abstract_canon_sha256":"8eeca4adddad4ead1fb2a29f149d01550d5d4c0c17738a75082dc01096456b23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:32:22.609226Z","signature_b64":"SY0DEdiOlySWM5TfuNYvbhpb2hQ6WvqMomjbPfmkdCm3N8/bUBNRLCPEELnZM9aPAtDGkCixPH5RE2Xoe6ceBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34cca42f5f961f257d636f14c7993bf5c8a8f294690ff9aa33cea618c022de0e","last_reissued_at":"2026-07-05T10:32:22.608326Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:32:22.608326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-Tolerant Preparation of Quantum Polar Codes Encoding One Logical Qubit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Ashutosh Goswami, Mehdi Mhalla, Valentin Savin","submitted_at":"2022-09-14T14:30:09Z","abstract_excerpt":"This paper explores a new approach to fault-tolerant quantum computing (FTQC), relying on quantum polar codes. We consider quantum polar codes of Calderbank-Shor-Steane type, encoding one logical qubit, which we refer to as $\\mathcal{Q}_1$ codes. First, we show that a subfamily of $\\mathcal{Q}_1$ codes is equivalent to the well-known family of Shor codes. Moreover, we show that $\\mathcal{Q}_1$ codes significantly outperform Shor codes, of the same length and minimum distance. Second, we consider the fault-tolerant preparation of $\\mathcal{Q}_1$ code states. We give a recursive procedure to pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.06673","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/2209.06673/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":"2209.06673","created_at":"2026-07-05T10:32:22.608451+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.06673v2","created_at":"2026-07-05T10:32:22.608451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.06673","created_at":"2026-07-05T10:32:22.608451+00:00"},{"alias_kind":"pith_short_12","alias_value":"GTGKIL27SYPS","created_at":"2026-07-05T10:32:22.608451+00:00"},{"alias_kind":"pith_short_16","alias_value":"GTGKIL27SYPSK7LD","created_at":"2026-07-05T10:32:22.608451+00:00"},{"alias_kind":"pith_short_8","alias_value":"GTGKIL27","created_at":"2026-07-05T10:32:22.608451+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2304.04743","citing_title":"Improved Logical Error Rate via List Decoding of Quantum Polar Codes","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GTGKIL27SYPSK7LDN4KMPGJ36X","json":"https://pith.science/pith/GTGKIL27SYPSK7LDN4KMPGJ36X.json","graph_json":"https://pith.science/api/pith-number/GTGKIL27SYPSK7LDN4KMPGJ36X/graph.json","events_json":"https://pith.science/api/pith-number/GTGKIL27SYPSK7LDN4KMPGJ36X/events.json","paper":"https://pith.science/paper/GTGKIL27"},"agent_actions":{"view_html":"https://pith.science/pith/GTGKIL27SYPSK7LDN4KMPGJ36X","download_json":"https://pith.science/pith/GTGKIL27SYPSK7LDN4KMPGJ36X.json","view_paper":"https://pith.science/paper/GTGKIL27","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.06673&json=true","fetch_graph":"https://pith.science/api/pith-number/GTGKIL27SYPSK7LDN4KMPGJ36X/graph.json","fetch_events":"https://pith.science/api/pith-number/GTGKIL27SYPSK7LDN4KMPGJ36X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GTGKIL27SYPSK7LDN4KMPGJ36X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GTGKIL27SYPSK7LDN4KMPGJ36X/action/storage_attestation","attest_author":"https://pith.science/pith/GTGKIL27SYPSK7LDN4KMPGJ36X/action/author_attestation","sign_citation":"https://pith.science/pith/GTGKIL27SYPSK7LDN4KMPGJ36X/action/citation_signature","submit_replication":"https://pith.science/pith/GTGKIL27SYPSK7LDN4KMPGJ36X/action/replication_record"}},"created_at":"2026-07-05T10:32:22.608451+00:00","updated_at":"2026-07-05T10:32:22.608451+00:00"}