{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:O5QPUBN72S6QNO652DTVONMCNX","short_pith_number":"pith:O5QPUBN7","schema_version":"1.0","canonical_sha256":"7760fa05bfd4bd06bbddd0e75735826ddb217f5d6cce3b5d7d919c2378493b9b","source":{"kind":"arxiv","id":"1605.07007","version":3},"attestation_state":"computed","paper":{"title":"Non-Uniform Code Concatenation for Universal Fault-Tolerant Quantum Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eesa Nikahd, Mehdi Sedighi, Morteza Saheb Zamani","submitted_at":"2016-05-23T13:24:41Z","abstract_excerpt":"Using transversal gates is a straightforward and efficient technique for fault-tolerant quantum computing. Since transversal gates alone cannot be computationally universal, they must be combined with other approaches such as magic state distillation, code switching or code concatenation in order to achieve universality. In this paper we propose an alternative approach for universal fault-tolerant quantum computing mainly based on the code concatenation approach proposed in [PRL 112, 010505 (2014)] but in a non-uniform fashion. The proposed approach is described based on non-uniform concatenat"},"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":"1605.07007","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-05-23T13:24:41Z","cross_cats_sorted":[],"title_canon_sha256":"80b766cccff82050d45534d970ed614fd4d550cd7b1dcda0a29c3d2225cdc067","abstract_canon_sha256":"559f3dd74f413c24b7eb99978cd0bab608cbe114ff48a57c72b925da1bbc1346"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:53.282425Z","signature_b64":"jqnRIGl3OTpJTnD+9LJTDRDU9cyE6jU8Ar/r44dtqXDZuZH4aIK7pSVrsoLoLQEmDCvlFbWp7DxieXuMNz4lCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7760fa05bfd4bd06bbddd0e75735826ddb217f5d6cce3b5d7d919c2378493b9b","last_reissued_at":"2026-05-18T00:33:53.281893Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:53.281893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Uniform Code Concatenation for Universal Fault-Tolerant Quantum Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eesa Nikahd, Mehdi Sedighi, Morteza Saheb Zamani","submitted_at":"2016-05-23T13:24:41Z","abstract_excerpt":"Using transversal gates is a straightforward and efficient technique for fault-tolerant quantum computing. Since transversal gates alone cannot be computationally universal, they must be combined with other approaches such as magic state distillation, code switching or code concatenation in order to achieve universality. In this paper we propose an alternative approach for universal fault-tolerant quantum computing mainly based on the code concatenation approach proposed in [PRL 112, 010505 (2014)] but in a non-uniform fashion. The proposed approach is described based on non-uniform concatenat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07007","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":""},"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":"1605.07007","created_at":"2026-05-18T00:33:53.281975+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.07007v3","created_at":"2026-05-18T00:33:53.281975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07007","created_at":"2026-05-18T00:33:53.281975+00:00"},{"alias_kind":"pith_short_12","alias_value":"O5QPUBN72S6Q","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"O5QPUBN72S6QNO65","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"O5QPUBN7","created_at":"2026-05-18T12:30:36.002864+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O5QPUBN72S6QNO652DTVONMCNX","json":"https://pith.science/pith/O5QPUBN72S6QNO652DTVONMCNX.json","graph_json":"https://pith.science/api/pith-number/O5QPUBN72S6QNO652DTVONMCNX/graph.json","events_json":"https://pith.science/api/pith-number/O5QPUBN72S6QNO652DTVONMCNX/events.json","paper":"https://pith.science/paper/O5QPUBN7"},"agent_actions":{"view_html":"https://pith.science/pith/O5QPUBN72S6QNO652DTVONMCNX","download_json":"https://pith.science/pith/O5QPUBN72S6QNO652DTVONMCNX.json","view_paper":"https://pith.science/paper/O5QPUBN7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.07007&json=true","fetch_graph":"https://pith.science/api/pith-number/O5QPUBN72S6QNO652DTVONMCNX/graph.json","fetch_events":"https://pith.science/api/pith-number/O5QPUBN72S6QNO652DTVONMCNX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O5QPUBN72S6QNO652DTVONMCNX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O5QPUBN72S6QNO652DTVONMCNX/action/storage_attestation","attest_author":"https://pith.science/pith/O5QPUBN72S6QNO652DTVONMCNX/action/author_attestation","sign_citation":"https://pith.science/pith/O5QPUBN72S6QNO652DTVONMCNX/action/citation_signature","submit_replication":"https://pith.science/pith/O5QPUBN72S6QNO652DTVONMCNX/action/replication_record"}},"created_at":"2026-05-18T00:33:53.281975+00:00","updated_at":"2026-05-18T00:33:53.281975+00:00"}