{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YSBQYTOM7WKGXTOSMLYLOQNO4Z","short_pith_number":"pith:YSBQYTOM","schema_version":"1.0","canonical_sha256":"c4830c4dccfd946bcdd262f0b741aee65caa85244548f344cd138a35bcabdbeb","source":{"kind":"arxiv","id":"1403.2975","version":3},"attestation_state":"computed","paper":{"title":"Optimal ancilla-free Clifford+T approximation of z-rotations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Neil J. Ross, Peter Selinger","submitted_at":"2014-03-12T15:37:00Z","abstract_excerpt":"We consider the problem of approximating arbitrary single-qubit z-rotations by ancilla-free Clifford+T circuits, up to given epsilon. We present a fast new probabilistic algorithm for solving this problem optimally, i.e., for finding the shortest possible circuit whatsoever for the given problem instance. The algorithm requires a factoring oracle (such as a quantum computer). Even in the absence of a factoring oracle, the algorithm is still near-optimal under a mild number-theoretic hypothesis. In this case, the algorithm finds a solution of T-count m + O(log(log(1/epsilon))), where m is the T"},"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":"1403.2975","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-03-12T15:37:00Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"34c73eccc1977d140fa0e0143cc70c717810b5ee2d40d4d9666a390d8b857f38","abstract_canon_sha256":"c3f0b370c1b9eafcd57ed003fd75c8266dae00d2669f18b654c43f82bb3a2fce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:32.300607Z","signature_b64":"oVY3sBX89/jdjaS77yoJXq08gOQOruBumM1JZSBtrTNp9LxVEyiPVCDvcUnG35NhwNHKTHcvjjnfo+MM3YM6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4830c4dccfd946bcdd262f0b741aee65caa85244548f344cd138a35bcabdbeb","last_reissued_at":"2026-05-18T00:18:32.300000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:32.300000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal ancilla-free Clifford+T approximation of z-rotations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Neil J. Ross, Peter Selinger","submitted_at":"2014-03-12T15:37:00Z","abstract_excerpt":"We consider the problem of approximating arbitrary single-qubit z-rotations by ancilla-free Clifford+T circuits, up to given epsilon. We present a fast new probabilistic algorithm for solving this problem optimally, i.e., for finding the shortest possible circuit whatsoever for the given problem instance. The algorithm requires a factoring oracle (such as a quantum computer). Even in the absence of a factoring oracle, the algorithm is still near-optimal under a mild number-theoretic hypothesis. In this case, the algorithm finds a solution of T-count m + O(log(log(1/epsilon))), where m is the T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2975","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":"1403.2975","created_at":"2026-05-18T00:18:32.300092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.2975v3","created_at":"2026-05-18T00:18:32.300092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2975","created_at":"2026-05-18T00:18:32.300092+00:00"},{"alias_kind":"pith_short_12","alias_value":"YSBQYTOM7WKG","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YSBQYTOM7WKGXTOS","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YSBQYTOM","created_at":"2026-05-18T12:28:57.508820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":21,"internal_anchor_count":6,"sample":[{"citing_arxiv_id":"2401.15829","citing_title":"Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice","ref_index":39,"is_internal_anchor":true},{"citing_arxiv_id":"2406.17995","citing_title":"Managing Classical Processing Requirements for Quantum Error Correction","ref_index":50,"is_internal_anchor":true},{"citing_arxiv_id":"2604.26792","citing_title":"Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators","ref_index":53,"is_internal_anchor":true},{"citing_arxiv_id":"2508.06236","citing_title":"Space and Time Cost of Continuous Rotations in Surface Codes","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2509.07279","citing_title":"Recursive algorithm for constructing antisymmetric fermionic states in first quantization mapping","ref_index":41,"is_internal_anchor":true},{"citing_arxiv_id":"2605.14042","citing_title":"C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution","ref_index":40,"is_internal_anchor":true},{"citing_arxiv_id":"2603.29091","citing_title":"Ether of Orbifolds","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12066","citing_title":"Benchmarking and Resource Analysis for Augmented-Lagrangian Quantum Hamiltonian Descent","ref_index":73,"is_internal_anchor":false},{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":239,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26792","citing_title":"Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25094","citing_title":"INJEQT: Improved Magic-State Injection Protocol for Fault-Tolerant Quantum Extractor Architectures","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04758","citing_title":"Quantum Magic in early FTQC: From Diagonal Clifford Hierarchy No-Go Theorems to Architecture Design Blueprints","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01367","citing_title":"From Characterization To Construction: Generative Quantum Circuit Synthesis from Gate Set Tomography Data","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20013","citing_title":"Assessing System Capabilities and Bottlenecks of an Early Fault-Tolerant Bicycle Architecture","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19481","citing_title":"Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture","ref_index":210,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11409","citing_title":"When T-Depth Misleads: Predicting Fault-Tolerant Quantum Execution Slowdown under Magic-State Delivery Constraints","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07983","citing_title":"Price and Payoff: Non-Determinism in Fault Tolerant Quantum Computation","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12560","citing_title":"Design automation and space-time reduction for surface-code logical operations using a SAT-based EDA kernel compatible with general encodings","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15099","citing_title":"O3LS: Optimizing Lattice Surgery via Automatic Layout Searching and Loose Scheduling","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19735","citing_title":"Architecting Early Fault Tolerant Neutral Atoms Systems with Quantum Advantage","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04049","citing_title":"FTPrimitiveBench: A Benchmark Suite For Logical Computation Under Hardware-Motivated and Biased Noise Models","ref_index":72,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YSBQYTOM7WKGXTOSMLYLOQNO4Z","json":"https://pith.science/pith/YSBQYTOM7WKGXTOSMLYLOQNO4Z.json","graph_json":"https://pith.science/api/pith-number/YSBQYTOM7WKGXTOSMLYLOQNO4Z/graph.json","events_json":"https://pith.science/api/pith-number/YSBQYTOM7WKGXTOSMLYLOQNO4Z/events.json","paper":"https://pith.science/paper/YSBQYTOM"},"agent_actions":{"view_html":"https://pith.science/pith/YSBQYTOM7WKGXTOSMLYLOQNO4Z","download_json":"https://pith.science/pith/YSBQYTOM7WKGXTOSMLYLOQNO4Z.json","view_paper":"https://pith.science/paper/YSBQYTOM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.2975&json=true","fetch_graph":"https://pith.science/api/pith-number/YSBQYTOM7WKGXTOSMLYLOQNO4Z/graph.json","fetch_events":"https://pith.science/api/pith-number/YSBQYTOM7WKGXTOSMLYLOQNO4Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YSBQYTOM7WKGXTOSMLYLOQNO4Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YSBQYTOM7WKGXTOSMLYLOQNO4Z/action/storage_attestation","attest_author":"https://pith.science/pith/YSBQYTOM7WKGXTOSMLYLOQNO4Z/action/author_attestation","sign_citation":"https://pith.science/pith/YSBQYTOM7WKGXTOSMLYLOQNO4Z/action/citation_signature","submit_replication":"https://pith.science/pith/YSBQYTOM7WKGXTOSMLYLOQNO4Z/action/replication_record"}},"created_at":"2026-05-18T00:18:32.300092+00:00","updated_at":"2026-05-18T00:18:32.300092+00:00"}