{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VZQWQS2POSGFHI33BIXMIEEEPO","short_pith_number":"pith:VZQWQS2P","schema_version":"1.0","canonical_sha256":"ae61684b4f748c53a37b0a2ec410847bb3e5ca4d3d3b4e3ca9d7a2dc6dc0d3ee","source":{"kind":"arxiv","id":"1610.03309","version":2},"attestation_state":"computed","paper":{"title":"A Low-Overhead Hybrid Approach for Universal Fault-Tolerant Quantum Computation","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-10-11T12:49:49Z","abstract_excerpt":"As there is no quantum error correction code with universal set of transversal gates, several approaches have been proposed which, in combination of transversal gates, make universal fault-tolerant quantum computation possible. Magic state distillation, code switching, code concatenation and pieceable fault-tolerance are well-known examples of such approaches. However, the overhead of these approaches is one of the main bottlenecks for large-scale quantum computation. In this paper, a hybrid approach is proposed which combines the code concatenation technique with the other mentioned approache"},"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":"1610.03309","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-10-11T12:49:49Z","cross_cats_sorted":[],"title_canon_sha256":"97418577a536817c2bd11f5f4da01f7668baa4c347dea96fbcab79171ba3242f","abstract_canon_sha256":"c5d96f775092f0ff963d2d30312c8c8ecd1f62347c805e002615b13e4f9d7467"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:35.278038Z","signature_b64":"U5gx5TTmYtF8KG3kcMMDcPngZoWqXfzbW5rSGJiAuwWCd9HWqppO5WOsXA9mPy9I0sAW0LdDEiCefb2W8c9QAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae61684b4f748c53a37b0a2ec410847bb3e5ca4d3d3b4e3ca9d7a2dc6dc0d3ee","last_reissued_at":"2026-05-18T00:44:35.277309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:35.277309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Low-Overhead Hybrid Approach for Universal Fault-Tolerant Quantum Computation","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-10-11T12:49:49Z","abstract_excerpt":"As there is no quantum error correction code with universal set of transversal gates, several approaches have been proposed which, in combination of transversal gates, make universal fault-tolerant quantum computation possible. Magic state distillation, code switching, code concatenation and pieceable fault-tolerance are well-known examples of such approaches. However, the overhead of these approaches is one of the main bottlenecks for large-scale quantum computation. In this paper, a hybrid approach is proposed which combines the code concatenation technique with the other mentioned approache"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03309","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":""},"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":"1610.03309","created_at":"2026-05-18T00:44:35.277460+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.03309v2","created_at":"2026-05-18T00:44:35.277460+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03309","created_at":"2026-05-18T00:44:35.277460+00:00"},{"alias_kind":"pith_short_12","alias_value":"VZQWQS2POSGF","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VZQWQS2POSGFHI33","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VZQWQS2P","created_at":"2026-05-18T12:30:48.956258+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.01880","citing_title":"Magic states are rarely the best resource to optimize: An analytical tool for qubit resource estimation in concatenated codes","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VZQWQS2POSGFHI33BIXMIEEEPO","json":"https://pith.science/pith/VZQWQS2POSGFHI33BIXMIEEEPO.json","graph_json":"https://pith.science/api/pith-number/VZQWQS2POSGFHI33BIXMIEEEPO/graph.json","events_json":"https://pith.science/api/pith-number/VZQWQS2POSGFHI33BIXMIEEEPO/events.json","paper":"https://pith.science/paper/VZQWQS2P"},"agent_actions":{"view_html":"https://pith.science/pith/VZQWQS2POSGFHI33BIXMIEEEPO","download_json":"https://pith.science/pith/VZQWQS2POSGFHI33BIXMIEEEPO.json","view_paper":"https://pith.science/paper/VZQWQS2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.03309&json=true","fetch_graph":"https://pith.science/api/pith-number/VZQWQS2POSGFHI33BIXMIEEEPO/graph.json","fetch_events":"https://pith.science/api/pith-number/VZQWQS2POSGFHI33BIXMIEEEPO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VZQWQS2POSGFHI33BIXMIEEEPO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VZQWQS2POSGFHI33BIXMIEEEPO/action/storage_attestation","attest_author":"https://pith.science/pith/VZQWQS2POSGFHI33BIXMIEEEPO/action/author_attestation","sign_citation":"https://pith.science/pith/VZQWQS2POSGFHI33BIXMIEEEPO/action/citation_signature","submit_replication":"https://pith.science/pith/VZQWQS2POSGFHI33BIXMIEEEPO/action/replication_record"}},"created_at":"2026-05-18T00:44:35.277460+00:00","updated_at":"2026-05-18T00:44:35.277460+00:00"}