{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SBCBJ3XZCEHQANDEIUUKBJXNV5","short_pith_number":"pith:SBCBJ3XZ","schema_version":"1.0","canonical_sha256":"904414eef9110f0034644528a0a6edaf4922c6d35f545c83f34769e260ac373f","source":{"kind":"arxiv","id":"1212.6253","version":2},"attestation_state":"computed","paper":{"title":"Efficient Clifford+T approximation of single-qubit operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Peter Selinger","submitted_at":"2012-12-26T20:52:00Z","abstract_excerpt":"We give an efficient randomized algorithm for approximating an arbitrary element of $SU(2)$ by a product of Clifford+$T$ operators, up to any given error threshold $\\epsilon>0$. Under a mild hypothesis on the distribution of primes, the algorithm's expected runtime is polynomial in $\\log(1/\\epsilon)$. If the operator to be approximated is a $z$-rotation, the resulting gate sequence has $T$-count $K+4\\log_2(1/\\epsilon)$, where $K$ is approximately equal to $10$. We also prove a worst-case lower bound of $K+4\\log_2(1/\\epsilon)$, where $K=-9$, so that our algorithm is within an additive constant "},"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":"1212.6253","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-12-26T20:52:00Z","cross_cats_sorted":[],"title_canon_sha256":"2787e7da0dac09e22829ff2095154c2064ff3858d82e8832310b1cf9b35afbae","abstract_canon_sha256":"ceb98a6e88e458c68173cb2496f86075ebc5a0c7a2e89dcbc2d45771a9bae522"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:05.315330Z","signature_b64":"0ao8rcCvGKcL+b98yDEaTORVKdEgeoPiYLfxbAPHHFXb5BsaA/XmcQrlYlNazkRUCf7pjy8Xu6x38PMBBQl8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"904414eef9110f0034644528a0a6edaf4922c6d35f545c83f34769e260ac373f","last_reissued_at":"2026-05-18T02:25:05.314949Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:05.314949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Clifford+T approximation of single-qubit operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Peter Selinger","submitted_at":"2012-12-26T20:52:00Z","abstract_excerpt":"We give an efficient randomized algorithm for approximating an arbitrary element of $SU(2)$ by a product of Clifford+$T$ operators, up to any given error threshold $\\epsilon>0$. Under a mild hypothesis on the distribution of primes, the algorithm's expected runtime is polynomial in $\\log(1/\\epsilon)$. If the operator to be approximated is a $z$-rotation, the resulting gate sequence has $T$-count $K+4\\log_2(1/\\epsilon)$, where $K$ is approximately equal to $10$. We also prove a worst-case lower bound of $K+4\\log_2(1/\\epsilon)$, where $K=-9$, so that our algorithm is within an additive constant "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6253","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":"1212.6253","created_at":"2026-05-18T02:25:05.315005+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.6253v2","created_at":"2026-05-18T02:25:05.315005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6253","created_at":"2026-05-18T02:25:05.315005+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBCBJ3XZCEHQ","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBCBJ3XZCEHQANDE","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBCBJ3XZ","created_at":"2026-05-18T12:27:20.899486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.14921","citing_title":"Split-Evolution Quantum Phase Estimation for Particle-Conserving Hamiltonians","ref_index":63,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SBCBJ3XZCEHQANDEIUUKBJXNV5","json":"https://pith.science/pith/SBCBJ3XZCEHQANDEIUUKBJXNV5.json","graph_json":"https://pith.science/api/pith-number/SBCBJ3XZCEHQANDEIUUKBJXNV5/graph.json","events_json":"https://pith.science/api/pith-number/SBCBJ3XZCEHQANDEIUUKBJXNV5/events.json","paper":"https://pith.science/paper/SBCBJ3XZ"},"agent_actions":{"view_html":"https://pith.science/pith/SBCBJ3XZCEHQANDEIUUKBJXNV5","download_json":"https://pith.science/pith/SBCBJ3XZCEHQANDEIUUKBJXNV5.json","view_paper":"https://pith.science/paper/SBCBJ3XZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.6253&json=true","fetch_graph":"https://pith.science/api/pith-number/SBCBJ3XZCEHQANDEIUUKBJXNV5/graph.json","fetch_events":"https://pith.science/api/pith-number/SBCBJ3XZCEHQANDEIUUKBJXNV5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBCBJ3XZCEHQANDEIUUKBJXNV5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBCBJ3XZCEHQANDEIUUKBJXNV5/action/storage_attestation","attest_author":"https://pith.science/pith/SBCBJ3XZCEHQANDEIUUKBJXNV5/action/author_attestation","sign_citation":"https://pith.science/pith/SBCBJ3XZCEHQANDEIUUKBJXNV5/action/citation_signature","submit_replication":"https://pith.science/pith/SBCBJ3XZCEHQANDEIUUKBJXNV5/action/replication_record"}},"created_at":"2026-05-18T02:25:05.315005+00:00","updated_at":"2026-05-18T02:25:05.315005+00:00"}