{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:T636MVV4LGNMIBYLZSGOIQ4AHI","short_pith_number":"pith:T636MVV4","canonical_record":{"source":{"id":"1409.3552","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-09-11T19:39:44Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"be10325fd3a2251cbe6268687e13d213ad1ba7b8960dfcc732b43268b9bca835","abstract_canon_sha256":"baebdbf38b2fdd58e0120857ce227d02c3143ea177a098fe3932e2c52a8d0191"},"schema_version":"1.0"},"canonical_sha256":"9fb7e656bc599ac4070bcc8ce443803a18def8aa744a927a29b9d8c8682eac2b","source":{"kind":"arxiv","id":"1409.3552","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3552","created_at":"2026-05-18T01:55:33Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3552v2","created_at":"2026-05-18T01:55:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3552","created_at":"2026-05-18T01:55:33Z"},{"alias_kind":"pith_short_12","alias_value":"T636MVV4LGNM","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"T636MVV4LGNMIBYL","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"T636MVV4","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:T636MVV4LGNMIBYLZSGOIQ4AHI","target":"record","payload":{"canonical_record":{"source":{"id":"1409.3552","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-09-11T19:39:44Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"be10325fd3a2251cbe6268687e13d213ad1ba7b8960dfcc732b43268b9bca835","abstract_canon_sha256":"baebdbf38b2fdd58e0120857ce227d02c3143ea177a098fe3932e2c52a8d0191"},"schema_version":"1.0"},"canonical_sha256":"9fb7e656bc599ac4070bcc8ce443803a18def8aa744a927a29b9d8c8682eac2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:33.644134Z","signature_b64":"yUrWRIea6A3DF/jzN+S90vkGszAFJ6rBS+cW93LJC+rT6EuwPTOBbPS0H/bp/LGRrbp2IJC9BTn0IezBZ0AKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fb7e656bc599ac4070bcc8ce443803a18def8aa744a927a29b9d8c8682eac2b","last_reissued_at":"2026-05-18T01:55:33.643518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:33.643518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.3552","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-18T01:55:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YlZqzAKuzR0U4B151M3uITihk3W/JlfnurGneaSmRmM2Qxy/T8HnZxWGGPhB5tQe1Th5TGEYdlcrseT50LczBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:20:25.218409Z"},"content_sha256":"cb90276fd5ba66d0ee18ab2c5bef912fc59057d3d9e2221255b6b62301de945c","schema_version":"1.0","event_id":"sha256:cb90276fd5ba66d0ee18ab2c5bef912fc59057d3d9e2221255b6b62301de945c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:T636MVV4LGNMIBYLZSGOIQ4AHI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient synthesis of probabilistic quantum circuits with fallback","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-09-11T19:39:44Z","abstract_excerpt":"Recently it has been shown that Repeat-Until-Success (RUS) circuits can approximate a given single-qubit unitary with an expected number of $T$ gates of about $1/3$ of what is required by optimal, deterministic, ancilla-free decompositions over the Clifford+$T$ gate set. In this work, we introduce a more general and conceptually simpler circuit decomposition method that allows for synthesis into protocols that probabilistically implement quantum circuits over several universal gate sets including, but not restricted to, the Clifford+$T$ gate set. The protocol, which we call Probabilistic Quant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3552","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-18T01:55:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8+ssMl/ouqzjhU1Q1kqILA/o4xUeoHeVwKR+DcoSuzi1EN8sU8NUpQjG1Qnlgpf6M9cUnGYj3DSrsFRqb0pdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:20:25.219102Z"},"content_sha256":"7bd40db900a7b23a0240eaa61a13e4247e23931bfc921e021cc6b85017c6571e","schema_version":"1.0","event_id":"sha256:7bd40db900a7b23a0240eaa61a13e4247e23931bfc921e021cc6b85017c6571e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T636MVV4LGNMIBYLZSGOIQ4AHI/bundle.json","state_url":"https://pith.science/pith/T636MVV4LGNMIBYLZSGOIQ4AHI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T636MVV4LGNMIBYLZSGOIQ4AHI/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-25T23:20:25Z","links":{"resolver":"https://pith.science/pith/T636MVV4LGNMIBYLZSGOIQ4AHI","bundle":"https://pith.science/pith/T636MVV4LGNMIBYLZSGOIQ4AHI/bundle.json","state":"https://pith.science/pith/T636MVV4LGNMIBYLZSGOIQ4AHI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T636MVV4LGNMIBYLZSGOIQ4AHI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:T636MVV4LGNMIBYLZSGOIQ4AHI","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":"baebdbf38b2fdd58e0120857ce227d02c3143ea177a098fe3932e2c52a8d0191","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-09-11T19:39:44Z","title_canon_sha256":"be10325fd3a2251cbe6268687e13d213ad1ba7b8960dfcc732b43268b9bca835"},"schema_version":"1.0","source":{"id":"1409.3552","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3552","created_at":"2026-05-18T01:55:33Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3552v2","created_at":"2026-05-18T01:55:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3552","created_at":"2026-05-18T01:55:33Z"},{"alias_kind":"pith_short_12","alias_value":"T636MVV4LGNM","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"T636MVV4LGNMIBYL","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"T636MVV4","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:7bd40db900a7b23a0240eaa61a13e4247e23931bfc921e021cc6b85017c6571e","target":"graph","created_at":"2026-05-18T01:55:33Z","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 has been shown that Repeat-Until-Success (RUS) circuits can approximate a given single-qubit unitary with an expected number of $T$ gates of about $1/3$ of what is required by optimal, deterministic, ancilla-free decompositions over the Clifford+$T$ gate set. In this work, we introduce a more general and conceptually simpler circuit decomposition method that allows for synthesis into protocols that probabilistically implement quantum circuits over several universal gate sets including, but not restricted to, the Clifford+$T$ gate set. The protocol, which we call Probabilistic Quant","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-09-11T19:39:44Z","title":"Efficient synthesis of probabilistic quantum circuits with fallback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3552","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:cb90276fd5ba66d0ee18ab2c5bef912fc59057d3d9e2221255b6b62301de945c","target":"record","created_at":"2026-05-18T01:55:33Z","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":"baebdbf38b2fdd58e0120857ce227d02c3143ea177a098fe3932e2c52a8d0191","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-09-11T19:39:44Z","title_canon_sha256":"be10325fd3a2251cbe6268687e13d213ad1ba7b8960dfcc732b43268b9bca835"},"schema_version":"1.0","source":{"id":"1409.3552","kind":"arxiv","version":2}},"canonical_sha256":"9fb7e656bc599ac4070bcc8ce443803a18def8aa744a927a29b9d8c8682eac2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fb7e656bc599ac4070bcc8ce443803a18def8aa744a927a29b9d8c8682eac2b","first_computed_at":"2026-05-18T01:55:33.643518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:33.643518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yUrWRIea6A3DF/jzN+S90vkGszAFJ6rBS+cW93LJC+rT6EuwPTOBbPS0H/bp/LGRrbp2IJC9BTn0IezBZ0AKAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:33.644134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.3552","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb90276fd5ba66d0ee18ab2c5bef912fc59057d3d9e2221255b6b62301de945c","sha256:7bd40db900a7b23a0240eaa61a13e4247e23931bfc921e021cc6b85017c6571e"],"state_sha256":"4a8ee06d147fdc925ef4e0bd15dadca702b6c607f3e602ab91c9b8b4b51995e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QuVVTpLnvobjdjtz4ZDY8TLulZe3xFUVMpQ98g0ho/pvk3D4u7C9xRKBYxzqae2PBCw9OJqObT2d4GLMUpzmAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:20:25.223821Z","bundle_sha256":"d0ceff194a73a476f66bb137698cbba6358834eed9ec5e3e18bb084cd0e89c3d"}}