{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SBCBJ3XZCEHQANDEIUUKBJXNV5","short_pith_number":"pith:SBCBJ3XZ","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"},"canonical_sha256":"904414eef9110f0034644528a0a6edaf4922c6d35f545c83f34769e260ac373f","source":{"kind":"arxiv","id":"1212.6253","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6253","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6253v2","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6253","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"pith_short_12","alias_value":"SBCBJ3XZCEHQ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SBCBJ3XZCEHQANDE","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SBCBJ3XZ","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SBCBJ3XZCEHQANDEIUUKBJXNV5","target":"record","payload":{"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"},"canonical_sha256":"904414eef9110f0034644528a0a6edaf4922c6d35f545c83f34769e260ac373f","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"},"source_kind":"arxiv","source_id":"1212.6253","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:25:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TsCOc9q6moRn8zZnc/tYzo3KRsoAVh0mlpGKr1ChrXTk+vXssZIyFt/BIdnIf2EWWkg800W48QZha1U6vspQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:33:18.273410Z"},"content_sha256":"07a28c8dda289cdcf57bf3ead44ebe8721b90aa62e977d383c1a0480e8f59cef","schema_version":"1.0","event_id":"sha256:07a28c8dda289cdcf57bf3ead44ebe8721b90aa62e977d383c1a0480e8f59cef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SBCBJ3XZCEHQANDEIUUKBJXNV5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:25:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2u7abjmVt9TO/UskP+hr+jiE9Baei9Lltp3cCV6QwLJzXwWxYGX3AiTi2aj+UO7GMiUScTV3XlEcGHdv3dFcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:33:18.274046Z"},"content_sha256":"43736f8de8e1ea1269fbb23351789c6064123ab8ccfb43e2e18f9d1c0d08dfcc","schema_version":"1.0","event_id":"sha256:43736f8de8e1ea1269fbb23351789c6064123ab8ccfb43e2e18f9d1c0d08dfcc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBCBJ3XZCEHQANDEIUUKBJXNV5/bundle.json","state_url":"https://pith.science/pith/SBCBJ3XZCEHQANDEIUUKBJXNV5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBCBJ3XZCEHQANDEIUUKBJXNV5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T22:33:18Z","links":{"resolver":"https://pith.science/pith/SBCBJ3XZCEHQANDEIUUKBJXNV5","bundle":"https://pith.science/pith/SBCBJ3XZCEHQANDEIUUKBJXNV5/bundle.json","state":"https://pith.science/pith/SBCBJ3XZCEHQANDEIUUKBJXNV5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBCBJ3XZCEHQANDEIUUKBJXNV5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SBCBJ3XZCEHQANDEIUUKBJXNV5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ceb98a6e88e458c68173cb2496f86075ebc5a0c7a2e89dcbc2d45771a9bae522","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-12-26T20:52:00Z","title_canon_sha256":"2787e7da0dac09e22829ff2095154c2064ff3858d82e8832310b1cf9b35afbae"},"schema_version":"1.0","source":{"id":"1212.6253","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6253","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6253v2","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6253","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"pith_short_12","alias_value":"SBCBJ3XZCEHQ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SBCBJ3XZCEHQANDE","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SBCBJ3XZ","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:43736f8de8e1ea1269fbb23351789c6064123ab8ccfb43e2e18f9d1c0d08dfcc","target":"graph","created_at":"2026-05-18T02:25:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Peter Selinger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-12-26T20:52:00Z","title":"Efficient Clifford+T approximation of single-qubit operators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6253","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:07a28c8dda289cdcf57bf3ead44ebe8721b90aa62e977d383c1a0480e8f59cef","target":"record","created_at":"2026-05-18T02:25:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ceb98a6e88e458c68173cb2496f86075ebc5a0c7a2e89dcbc2d45771a9bae522","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-12-26T20:52:00Z","title_canon_sha256":"2787e7da0dac09e22829ff2095154c2064ff3858d82e8832310b1cf9b35afbae"},"schema_version":"1.0","source":{"id":"1212.6253","kind":"arxiv","version":2}},"canonical_sha256":"904414eef9110f0034644528a0a6edaf4922c6d35f545c83f34769e260ac373f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"904414eef9110f0034644528a0a6edaf4922c6d35f545c83f34769e260ac373f","first_computed_at":"2026-05-18T02:25:05.314949Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:05.314949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0ao8rcCvGKcL+b98yDEaTORVKdEgeoPiYLfxbAPHHFXb5BsaA/XmcQrlYlNazkRUCf7pjy8Xu6x38PMBBQl8Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:05.315330Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.6253","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07a28c8dda289cdcf57bf3ead44ebe8721b90aa62e977d383c1a0480e8f59cef","sha256:43736f8de8e1ea1269fbb23351789c6064123ab8ccfb43e2e18f9d1c0d08dfcc"],"state_sha256":"d3c0562eba57b520e82ba855ffdbfca25e3edb1e46c9494419b19de8e01822fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cdY4d2a6dhxxYD/xgRLh/fytoq6v528zF/OsefwPUdVy35/K65BjxCDaww79ieloRPK2sGWrT4+TJWfcMieCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:33:18.277530Z","bundle_sha256":"1438e77abab4f62a8bb1f27ce2fe0535bb7339fe167f27bea294ac56c2f0a858"}}