{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3H7IZSXGYMFJPOL5LVLH5HCR3W","short_pith_number":"pith:3H7IZSXG","schema_version":"1.0","canonical_sha256":"d9fe8ccae6c30a97b97d5d567e9c51dd93f0e7cd3c4e5eb5f990014c047440ef","source":{"kind":"arxiv","id":"1310.7290","version":1},"attestation_state":"computed","paper":{"title":"Logic Synthesis for Fault-Tolerant Quantum Computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"N. Cody Jones","submitted_at":"2013-10-28T01:58:44Z","abstract_excerpt":"Efficient constructions for quantum logic are essential since quantum computation is experimentally challenging. This thesis develops quantum logic synthesis as a paradigm for reducing the resource overhead in fault-tolerant quantum computing. The model for error correction considered here is the surface code. After developing the theory behind general logic synthesis, the resource costs of magic-state distillation for the $T = \\exp(i \\pi (I-Z)/8)$ gate are quantitatively analyzed. The resource costs for a relatively new protocol distilling multi-qubit Fourier states are calculated for the fir"},"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":"1310.7290","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-28T01:58:44Z","cross_cats_sorted":[],"title_canon_sha256":"32f2927c4c12a3a227e0e0f0650f30a9da414397972a2aab41c0012a80c03395","abstract_canon_sha256":"4d2f718fc16b44f5711e9aa98a7fa2e8e9dac3963da2130bd40177a7c666fb91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:45.761356Z","signature_b64":"rYpJfM6TDDi5MgXp0X7Kux1CssYgYPLB18oGSQ3tjy+t0dwRgvlbtBhouHciShG5y/dAOb9hgiWIhdjNAkCJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9fe8ccae6c30a97b97d5d567e9c51dd93f0e7cd3c4e5eb5f990014c047440ef","last_reissued_at":"2026-05-18T03:08:45.760623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:45.760623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logic Synthesis for Fault-Tolerant Quantum Computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"N. Cody Jones","submitted_at":"2013-10-28T01:58:44Z","abstract_excerpt":"Efficient constructions for quantum logic are essential since quantum computation is experimentally challenging. This thesis develops quantum logic synthesis as a paradigm for reducing the resource overhead in fault-tolerant quantum computing. The model for error correction considered here is the surface code. After developing the theory behind general logic synthesis, the resource costs of magic-state distillation for the $T = \\exp(i \\pi (I-Z)/8)$ gate are quantitatively analyzed. The resource costs for a relatively new protocol distilling multi-qubit Fourier states are calculated for the fir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7290","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":""},"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":"1310.7290","created_at":"2026-05-18T03:08:45.760730+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.7290v1","created_at":"2026-05-18T03:08:45.760730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7290","created_at":"2026-05-18T03:08:45.760730+00:00"},{"alias_kind":"pith_short_12","alias_value":"3H7IZSXGYMFJ","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3H7IZSXGYMFJPOL5","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3H7IZSXG","created_at":"2026-05-18T12:27:32.513160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.15297","citing_title":"Towards Deploying Optimistic Quantum Fourier Transforms: An Architecture-Algorithm Co-Design Study","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3H7IZSXGYMFJPOL5LVLH5HCR3W","json":"https://pith.science/pith/3H7IZSXGYMFJPOL5LVLH5HCR3W.json","graph_json":"https://pith.science/api/pith-number/3H7IZSXGYMFJPOL5LVLH5HCR3W/graph.json","events_json":"https://pith.science/api/pith-number/3H7IZSXGYMFJPOL5LVLH5HCR3W/events.json","paper":"https://pith.science/paper/3H7IZSXG"},"agent_actions":{"view_html":"https://pith.science/pith/3H7IZSXGYMFJPOL5LVLH5HCR3W","download_json":"https://pith.science/pith/3H7IZSXGYMFJPOL5LVLH5HCR3W.json","view_paper":"https://pith.science/paper/3H7IZSXG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.7290&json=true","fetch_graph":"https://pith.science/api/pith-number/3H7IZSXGYMFJPOL5LVLH5HCR3W/graph.json","fetch_events":"https://pith.science/api/pith-number/3H7IZSXGYMFJPOL5LVLH5HCR3W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3H7IZSXGYMFJPOL5LVLH5HCR3W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3H7IZSXGYMFJPOL5LVLH5HCR3W/action/storage_attestation","attest_author":"https://pith.science/pith/3H7IZSXGYMFJPOL5LVLH5HCR3W/action/author_attestation","sign_citation":"https://pith.science/pith/3H7IZSXGYMFJPOL5LVLH5HCR3W/action/citation_signature","submit_replication":"https://pith.science/pith/3H7IZSXGYMFJPOL5LVLH5HCR3W/action/replication_record"}},"created_at":"2026-05-18T03:08:45.760730+00:00","updated_at":"2026-05-18T03:08:45.760730+00:00"}