{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:H25N4FYA3IOCXSNF4RWOJLFUIR","short_pith_number":"pith:H25N4FYA","schema_version":"1.0","canonical_sha256":"3ebade1700da1c2bc9a5e46ce4acb444687b44c7bbc06c21f84d3137d2cc3966","source":{"kind":"arxiv","id":"1210.4626","version":3},"attestation_state":"computed","paper":{"title":"Time-optimal quantum computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Austin G. Fowler","submitted_at":"2012-10-17T05:08:53Z","abstract_excerpt":"Given any quantum error correcting code permitting universal fault-tolerant quantum computation and transversal measurement of logical X and Z, we describe how to perform time-optimal quantum computation, meaning the execution of an arbitrary Clifford circuit followed by a layer of independent T gates and any necessary feedforward measurement determined corrective S gates all in the time of a single physical measurement. We assume fast classical processing and classical communication, and argue the reasonableness of this assumption. This enables fault-tolerant quantum computation to be perform"},"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":"1210.4626","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-17T05:08:53Z","cross_cats_sorted":[],"title_canon_sha256":"a1776621ba2f76ccafc6096244eddebd93e77bd2c0cd4e4f22a74fed267fc6e2","abstract_canon_sha256":"65cc84595f060cdf2c0fb47e121736a82a5776938f0497cbc387c3cf47dfd932"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:37.895279Z","signature_b64":"vJFBSsrTr7QHP2k5YzBkTQ1QMK5NT5edzipeYi4Ezt753ZhWBubFEsuHY8uJcVJCzKkhsWyXNZeVIl8lZzdWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ebade1700da1c2bc9a5e46ce4acb444687b44c7bbc06c21f84d3137d2cc3966","last_reissued_at":"2026-05-18T03:34:37.894501Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:37.894501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time-optimal quantum computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Austin G. Fowler","submitted_at":"2012-10-17T05:08:53Z","abstract_excerpt":"Given any quantum error correcting code permitting universal fault-tolerant quantum computation and transversal measurement of logical X and Z, we describe how to perform time-optimal quantum computation, meaning the execution of an arbitrary Clifford circuit followed by a layer of independent T gates and any necessary feedforward measurement determined corrective S gates all in the time of a single physical measurement. We assume fast classical processing and classical communication, and argue the reasonableness of this assumption. This enables fault-tolerant quantum computation to be perform"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4626","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":"1210.4626","created_at":"2026-05-18T03:34:37.894628+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.4626v3","created_at":"2026-05-18T03:34:37.894628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4626","created_at":"2026-05-18T03:34:37.894628+00:00"},{"alias_kind":"pith_short_12","alias_value":"H25N4FYA3IOC","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"H25N4FYA3IOCXSNF","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"H25N4FYA","created_at":"2026-05-18T12:27:06.952714+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":5,"sample":[{"citing_arxiv_id":"2605.23738","citing_title":"Optimizing Parallel Execution of Commuting Pauli Product Rotations","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2401.15829","citing_title":"Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice","ref_index":28,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15297","citing_title":"Towards Deploying Optimistic Quantum Fourier Transforms: An Architecture-Algorithm Co-Design Study","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2603.28627","citing_title":"Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits","ref_index":41,"is_internal_anchor":true},{"citing_arxiv_id":"2603.28846","citing_title":"Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations","ref_index":94,"is_internal_anchor":true},{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13158","citing_title":"Fast measurement of neutral atoms with a multi-atom gate","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03854","citing_title":"Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H25N4FYA3IOCXSNF4RWOJLFUIR","json":"https://pith.science/pith/H25N4FYA3IOCXSNF4RWOJLFUIR.json","graph_json":"https://pith.science/api/pith-number/H25N4FYA3IOCXSNF4RWOJLFUIR/graph.json","events_json":"https://pith.science/api/pith-number/H25N4FYA3IOCXSNF4RWOJLFUIR/events.json","paper":"https://pith.science/paper/H25N4FYA"},"agent_actions":{"view_html":"https://pith.science/pith/H25N4FYA3IOCXSNF4RWOJLFUIR","download_json":"https://pith.science/pith/H25N4FYA3IOCXSNF4RWOJLFUIR.json","view_paper":"https://pith.science/paper/H25N4FYA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.4626&json=true","fetch_graph":"https://pith.science/api/pith-number/H25N4FYA3IOCXSNF4RWOJLFUIR/graph.json","fetch_events":"https://pith.science/api/pith-number/H25N4FYA3IOCXSNF4RWOJLFUIR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H25N4FYA3IOCXSNF4RWOJLFUIR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H25N4FYA3IOCXSNF4RWOJLFUIR/action/storage_attestation","attest_author":"https://pith.science/pith/H25N4FYA3IOCXSNF4RWOJLFUIR/action/author_attestation","sign_citation":"https://pith.science/pith/H25N4FYA3IOCXSNF4RWOJLFUIR/action/citation_signature","submit_replication":"https://pith.science/pith/H25N4FYA3IOCXSNF4RWOJLFUIR/action/replication_record"}},"created_at":"2026-05-18T03:34:37.894628+00:00","updated_at":"2026-05-18T03:34:37.894628+00:00"}