{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PHQNRRUD4HHCNKX3UXQR6QQP6V","short_pith_number":"pith:PHQNRRUD","canonical_record":{"source":{"id":"1404.5320","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-04-21T20:24:57Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"fdafb8a0846d52f5ef98f9e04190a0f75f5f8929b21cd74130f6234e422e2359","abstract_canon_sha256":"ae23a246adb1f54b6a12be4ac1c667c54287205ea6f2fb15bdd95078ac64dd22"},"schema_version":"1.0"},"canonical_sha256":"79e0d8c683e1ce26aafba5e11f420ff56f0ca538e8ffb2112c4fb82933fcf782","source":{"kind":"arxiv","id":"1404.5320","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5320","created_at":"2026-05-18T02:25:18Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5320v2","created_at":"2026-05-18T02:25:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5320","created_at":"2026-05-18T02:25:18Z"},{"alias_kind":"pith_short_12","alias_value":"PHQNRRUD4HHC","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PHQNRRUD4HHCNKX3","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PHQNRRUD","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PHQNRRUD4HHCNKX3UXQR6QQP6V","target":"record","payload":{"canonical_record":{"source":{"id":"1404.5320","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-04-21T20:24:57Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"fdafb8a0846d52f5ef98f9e04190a0f75f5f8929b21cd74130f6234e422e2359","abstract_canon_sha256":"ae23a246adb1f54b6a12be4ac1c667c54287205ea6f2fb15bdd95078ac64dd22"},"schema_version":"1.0"},"canonical_sha256":"79e0d8c683e1ce26aafba5e11f420ff56f0ca538e8ffb2112c4fb82933fcf782","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:18.949221Z","signature_b64":"qecQzeNaAzoTtEWCtdcvs0s/i+8ouzHGUqH5iUkXzf/JihEZJ9o3GUVfTJx9QfEBrQfZcqhj5UzM1O1qOsliAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79e0d8c683e1ce26aafba5e11f420ff56f0ca538e8ffb2112c4fb82933fcf782","last_reissued_at":"2026-05-18T02:25:18.948877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:18.948877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.5320","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:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OFfksLnMSVbIgM44JmiH0I7dc3v1pP0pDfsDN76EPAT/FG+uvvu9jNXJ8xWr8JiUkEwbxXx2UzPe8y1MKb7PCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:03:54.685500Z"},"content_sha256":"6cfc2d15b0d12b138b342739d53773f6561a73e75841be0914216da1b70d23c7","schema_version":"1.0","event_id":"sha256:6cfc2d15b0d12b138b342739d53773f6561a73e75841be0914216da1b70d23c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PHQNRRUD4HHCNKX3UXQR6QQP6V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient synthesis of universal Repeat-Until-Success circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Alex Bocharov, Krysta M. Svore, Martin Roetteler","submitted_at":"2014-04-21T20:24:57Z","abstract_excerpt":"Recently, it was shown that Repeat-Until-Success (RUS) circuits can achieve a $2.5$ times reduction in expected $T$-count over ancilla-free techniques for single-qubit unitary decomposition. However, the previously best known algorithm to synthesize RUS circuits requires exponential classical runtime. In this paper we present an algorithm to synthesize an RUS circuit to approximate any given single-qubit unitary within precision $\\varepsilon$ in probabilistically polynomial classical runtime. Our synthesis approach uses the Clifford+$T$ basis, plus one ancilla qubit and measurement. We provide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5320","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:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m8X1HzsTtZY0HhSmIxyExZCOm+pGdqyRHKO2BGg1Nf7sTsfRyaBY7VedSKn3oezHqDSuUDptroUs/Egh9cYbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:03:54.686923Z"},"content_sha256":"b6bf96f98e62ca1600cc6a054e862ff5380f2885217eb1da3f8035c2f64876c2","schema_version":"1.0","event_id":"sha256:b6bf96f98e62ca1600cc6a054e862ff5380f2885217eb1da3f8035c2f64876c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PHQNRRUD4HHCNKX3UXQR6QQP6V/bundle.json","state_url":"https://pith.science/pith/PHQNRRUD4HHCNKX3UXQR6QQP6V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PHQNRRUD4HHCNKX3UXQR6QQP6V/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-06-05T18:03:54Z","links":{"resolver":"https://pith.science/pith/PHQNRRUD4HHCNKX3UXQR6QQP6V","bundle":"https://pith.science/pith/PHQNRRUD4HHCNKX3UXQR6QQP6V/bundle.json","state":"https://pith.science/pith/PHQNRRUD4HHCNKX3UXQR6QQP6V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PHQNRRUD4HHCNKX3UXQR6QQP6V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PHQNRRUD4HHCNKX3UXQR6QQP6V","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":"ae23a246adb1f54b6a12be4ac1c667c54287205ea6f2fb15bdd95078ac64dd22","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-04-21T20:24:57Z","title_canon_sha256":"fdafb8a0846d52f5ef98f9e04190a0f75f5f8929b21cd74130f6234e422e2359"},"schema_version":"1.0","source":{"id":"1404.5320","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5320","created_at":"2026-05-18T02:25:18Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5320v2","created_at":"2026-05-18T02:25:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5320","created_at":"2026-05-18T02:25:18Z"},{"alias_kind":"pith_short_12","alias_value":"PHQNRRUD4HHC","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PHQNRRUD4HHCNKX3","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PHQNRRUD","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:b6bf96f98e62ca1600cc6a054e862ff5380f2885217eb1da3f8035c2f64876c2","target":"graph","created_at":"2026-05-18T02:25:18Z","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":"Recently, it was shown that Repeat-Until-Success (RUS) circuits can achieve a $2.5$ times reduction in expected $T$-count over ancilla-free techniques for single-qubit unitary decomposition. However, the previously best known algorithm to synthesize RUS circuits requires exponential classical runtime. In this paper we present an algorithm to synthesize an RUS circuit to approximate any given single-qubit unitary within precision $\\varepsilon$ in probabilistically polynomial classical runtime. Our synthesis approach uses the Clifford+$T$ basis, plus one ancilla qubit and measurement. We provide","authors_text":"Alex Bocharov, Krysta M. Svore, Martin Roetteler","cross_cats":["cs.ET"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-04-21T20:24:57Z","title":"Efficient synthesis of universal Repeat-Until-Success circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5320","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:6cfc2d15b0d12b138b342739d53773f6561a73e75841be0914216da1b70d23c7","target":"record","created_at":"2026-05-18T02:25:18Z","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":"ae23a246adb1f54b6a12be4ac1c667c54287205ea6f2fb15bdd95078ac64dd22","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-04-21T20:24:57Z","title_canon_sha256":"fdafb8a0846d52f5ef98f9e04190a0f75f5f8929b21cd74130f6234e422e2359"},"schema_version":"1.0","source":{"id":"1404.5320","kind":"arxiv","version":2}},"canonical_sha256":"79e0d8c683e1ce26aafba5e11f420ff56f0ca538e8ffb2112c4fb82933fcf782","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79e0d8c683e1ce26aafba5e11f420ff56f0ca538e8ffb2112c4fb82933fcf782","first_computed_at":"2026-05-18T02:25:18.948877Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:18.948877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qecQzeNaAzoTtEWCtdcvs0s/i+8ouzHGUqH5iUkXzf/JihEZJ9o3GUVfTJx9QfEBrQfZcqhj5UzM1O1qOsliAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:18.949221Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5320","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cfc2d15b0d12b138b342739d53773f6561a73e75841be0914216da1b70d23c7","sha256:b6bf96f98e62ca1600cc6a054e862ff5380f2885217eb1da3f8035c2f64876c2"],"state_sha256":"2d8d6467a65ee42f5629f6df995d4f8d5f71060b8171185b11deb24fbf939948"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2fVTLRPa34gH+gRy6gwSmQzX6llnttC0H3Bomas6N0OHXe76FlKIwckjWeRKOCwLPEhJhaaSRXz7QilUWuU6CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T18:03:54.692933Z","bundle_sha256":"7d6f8c041bcec709f460b164caa5c99238b15556feaf5333e7b7f924770798ae"}}