{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5AJ63XVZE3YB62EM4HBYQEKZJB","short_pith_number":"pith:5AJ63XVZ","schema_version":"1.0","canonical_sha256":"e813eddeb926f01f688ce1c3881159484e664e9cc4ce20f4a0c36895ace83814","source":{"kind":"arxiv","id":"1311.1074","version":2},"attestation_state":"computed","paper":{"title":"Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Paetznick, Krysta M. Svore","submitted_at":"2013-11-05T14:42:07Z","abstract_excerpt":"We present a decomposition technique that uses non-deterministic circuits to approximate an arbitrary single-qubit unitary to within distance $\\epsilon$ and requires significantly fewer non-Clifford gates than existing techniques. We develop \"Repeat-Until-Success\" (RUS) circuits and characterize unitaries that can be exactly represented as an RUS circuit. Our RUS circuits operate by conditioning on a given measurement outcome and using only a small number of non-Clifford gates and ancilla qubits. We construct an algorithm based on RUS circuits that approximates an arbitrary single-qubit $Z$-ax"},"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":"1311.1074","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-11-05T14:42:07Z","cross_cats_sorted":[],"title_canon_sha256":"a074d4b7c0b92b938b79e1401f206d9d9542698267ab42ef51826d721353f6e3","abstract_canon_sha256":"aa05e90c4b09b361999a9f82a5070cebca015e0ab1edfdd71bdb375dcb1893d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:48.579194Z","signature_b64":"wO/tivMRzwoF/2rfRgYMP/0GrHQIactKB6M9BWEv5uatKYJoxJeuC+6Fj8PHPcoLbX6rq4KOU3sQoNphj07FBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e813eddeb926f01f688ce1c3881159484e664e9cc4ce20f4a0c36895ace83814","last_reissued_at":"2026-05-18T02:39:48.578742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:48.578742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Paetznick, Krysta M. Svore","submitted_at":"2013-11-05T14:42:07Z","abstract_excerpt":"We present a decomposition technique that uses non-deterministic circuits to approximate an arbitrary single-qubit unitary to within distance $\\epsilon$ and requires significantly fewer non-Clifford gates than existing techniques. We develop \"Repeat-Until-Success\" (RUS) circuits and characterize unitaries that can be exactly represented as an RUS circuit. Our RUS circuits operate by conditioning on a given measurement outcome and using only a small number of non-Clifford gates and ancilla qubits. We construct an algorithm based on RUS circuits that approximates an arbitrary single-qubit $Z$-ax"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1074","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":"1311.1074","created_at":"2026-05-18T02:39:48.578809+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.1074v2","created_at":"2026-05-18T02:39:48.578809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1074","created_at":"2026-05-18T02:39:48.578809+00:00"},{"alias_kind":"pith_short_12","alias_value":"5AJ63XVZE3YB","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5AJ63XVZE3YB62EM","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5AJ63XVZ","created_at":"2026-05-18T12:27:34.582898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"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":70,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5AJ63XVZE3YB62EM4HBYQEKZJB","json":"https://pith.science/pith/5AJ63XVZE3YB62EM4HBYQEKZJB.json","graph_json":"https://pith.science/api/pith-number/5AJ63XVZE3YB62EM4HBYQEKZJB/graph.json","events_json":"https://pith.science/api/pith-number/5AJ63XVZE3YB62EM4HBYQEKZJB/events.json","paper":"https://pith.science/paper/5AJ63XVZ"},"agent_actions":{"view_html":"https://pith.science/pith/5AJ63XVZE3YB62EM4HBYQEKZJB","download_json":"https://pith.science/pith/5AJ63XVZE3YB62EM4HBYQEKZJB.json","view_paper":"https://pith.science/paper/5AJ63XVZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.1074&json=true","fetch_graph":"https://pith.science/api/pith-number/5AJ63XVZE3YB62EM4HBYQEKZJB/graph.json","fetch_events":"https://pith.science/api/pith-number/5AJ63XVZE3YB62EM4HBYQEKZJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5AJ63XVZE3YB62EM4HBYQEKZJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5AJ63XVZE3YB62EM4HBYQEKZJB/action/storage_attestation","attest_author":"https://pith.science/pith/5AJ63XVZE3YB62EM4HBYQEKZJB/action/author_attestation","sign_citation":"https://pith.science/pith/5AJ63XVZE3YB62EM4HBYQEKZJB/action/citation_signature","submit_replication":"https://pith.science/pith/5AJ63XVZE3YB62EM4HBYQEKZJB/action/replication_record"}},"created_at":"2026-05-18T02:39:48.578809+00:00","updated_at":"2026-05-18T02:39:48.578809+00:00"}