{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PHQNRRUD4HHCNKX3UXQR6QQP6V","short_pith_number":"pith:PHQNRRUD","schema_version":"1.0","canonical_sha256":"79e0d8c683e1ce26aafba5e11f420ff56f0ca538e8ffb2112c4fb82933fcf782","source":{"kind":"arxiv","id":"1404.5320","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1404.5320","created_at":"2026-05-18T02:25:18.948933+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.5320v2","created_at":"2026-05-18T02:25:18.948933+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5320","created_at":"2026-05-18T02:25:18.948933+00:00"},{"alias_kind":"pith_short_12","alias_value":"PHQNRRUD4HHC","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PHQNRRUD4HHCNKX3","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PHQNRRUD","created_at":"2026-05-18T12:28:43.426989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2409.00433","citing_title":"High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2602.11457","citing_title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","ref_index":71,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PHQNRRUD4HHCNKX3UXQR6QQP6V","json":"https://pith.science/pith/PHQNRRUD4HHCNKX3UXQR6QQP6V.json","graph_json":"https://pith.science/api/pith-number/PHQNRRUD4HHCNKX3UXQR6QQP6V/graph.json","events_json":"https://pith.science/api/pith-number/PHQNRRUD4HHCNKX3UXQR6QQP6V/events.json","paper":"https://pith.science/paper/PHQNRRUD"},"agent_actions":{"view_html":"https://pith.science/pith/PHQNRRUD4HHCNKX3UXQR6QQP6V","download_json":"https://pith.science/pith/PHQNRRUD4HHCNKX3UXQR6QQP6V.json","view_paper":"https://pith.science/paper/PHQNRRUD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.5320&json=true","fetch_graph":"https://pith.science/api/pith-number/PHQNRRUD4HHCNKX3UXQR6QQP6V/graph.json","fetch_events":"https://pith.science/api/pith-number/PHQNRRUD4HHCNKX3UXQR6QQP6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PHQNRRUD4HHCNKX3UXQR6QQP6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PHQNRRUD4HHCNKX3UXQR6QQP6V/action/storage_attestation","attest_author":"https://pith.science/pith/PHQNRRUD4HHCNKX3UXQR6QQP6V/action/author_attestation","sign_citation":"https://pith.science/pith/PHQNRRUD4HHCNKX3UXQR6QQP6V/action/citation_signature","submit_replication":"https://pith.science/pith/PHQNRRUD4HHCNKX3UXQR6QQP6V/action/replication_record"}},"created_at":"2026-05-18T02:25:18.948933+00:00","updated_at":"2026-05-18T02:25:18.948933+00:00"}