{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OM4ZBHMYOLT2Z4CKHOQ4XZOQJD","short_pith_number":"pith:OM4ZBHMY","canonical_record":{"source":{"id":"1612.02689","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-12-08T15:14:25Z","cross_cats_sorted":[],"title_canon_sha256":"4d84f4c7626df627471c26a3176bbfd5ffde6b995d8b431d56ec5dae7e7e1685","abstract_canon_sha256":"8c4892a8218faa53b320d0df4b102831eba197872e92dc5270a0f6d9bf3ab745"},"schema_version":"1.0"},"canonical_sha256":"7339909d9872e7acf04a3ba1cbe5d048c200546aa09561bfb658674d41dc48ec","source":{"kind":"arxiv","id":"1612.02689","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02689","created_at":"2026-05-18T00:46:38Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02689v3","created_at":"2026-05-18T00:46:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02689","created_at":"2026-05-18T00:46:38Z"},{"alias_kind":"pith_short_12","alias_value":"OM4ZBHMYOLT2","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OM4ZBHMYOLT2Z4CK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OM4ZBHMY","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OM4ZBHMYOLT2Z4CKHOQ4XZOQJD","target":"record","payload":{"canonical_record":{"source":{"id":"1612.02689","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-12-08T15:14:25Z","cross_cats_sorted":[],"title_canon_sha256":"4d84f4c7626df627471c26a3176bbfd5ffde6b995d8b431d56ec5dae7e7e1685","abstract_canon_sha256":"8c4892a8218faa53b320d0df4b102831eba197872e92dc5270a0f6d9bf3ab745"},"schema_version":"1.0"},"canonical_sha256":"7339909d9872e7acf04a3ba1cbe5d048c200546aa09561bfb658674d41dc48ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:38.623998Z","signature_b64":"BL/jZzDLtnM96DRqj6i9cITbiEMXO/dFRArjGHsb3Hmf0G6+csxAKIGQ/rLT2dgxsOhlkhDi5FCqepqdYECeBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7339909d9872e7acf04a3ba1cbe5d048c200546aa09561bfb658674d41dc48ec","last_reissued_at":"2026-05-18T00:46:38.623309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:38.623309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.02689","source_version":3,"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-18T00:46:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aGujyu/VqL5xEg8H8ZU9Xz6WN/wyBuA2KC2NEuno/pXyI9Elz3hwF32Uu6QRs/VGMv1FsOcme9UKxCjgM/1DAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:09:27.790193Z"},"content_sha256":"bc1848e953026c28d5e95f36824cae4a958ec7cc3d58579a9f51046482e9208d","schema_version":"1.0","event_id":"sha256:bc1848e953026c28d5e95f36824cae4a958ec7cc3d58579a9f51046482e9208d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OM4ZBHMYOLT2Z4CKHOQ4XZOQJD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shorter gate sequences for quantum computing by mixing unitaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Earl Campbell","submitted_at":"2016-12-08T15:14:25Z","abstract_excerpt":"Fault-tolerant quantum computers compose elements of a discrete gate set in order to approximate a target unitary. The problem of minimising the number of gates is known as gate-synthesis. The approximation error is a form of coherent noise, which can be significantly more damaging than comparable incoherent noise. We show how mixing over different gate sequences can convert this coherent noise into an incoherent form. As measured by diamond distance, the post-mixing noise is quadratically smaller than before mixing, with no additional resource cost. Equivalently, we can use a shorter gate seq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02689","kind":"arxiv","version":3},"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-18T00:46:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AiFD19OCX65Z2St1Irif8aihnbVZlhnGT1vtLO/e+a4z3cJWVpCi0OL0wm1ZBy9Jy2qQa6uXs/0CWA+/fPq3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:09:27.790981Z"},"content_sha256":"3baffdc2bb21ebce72a0d7fffa3ff11e5c37a6d47656a66d2e4cc7add25e9ddd","schema_version":"1.0","event_id":"sha256:3baffdc2bb21ebce72a0d7fffa3ff11e5c37a6d47656a66d2e4cc7add25e9ddd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OM4ZBHMYOLT2Z4CKHOQ4XZOQJD/bundle.json","state_url":"https://pith.science/pith/OM4ZBHMYOLT2Z4CKHOQ4XZOQJD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OM4ZBHMYOLT2Z4CKHOQ4XZOQJD/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-08-03T18:09:27Z","links":{"resolver":"https://pith.science/pith/OM4ZBHMYOLT2Z4CKHOQ4XZOQJD","bundle":"https://pith.science/pith/OM4ZBHMYOLT2Z4CKHOQ4XZOQJD/bundle.json","state":"https://pith.science/pith/OM4ZBHMYOLT2Z4CKHOQ4XZOQJD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OM4ZBHMYOLT2Z4CKHOQ4XZOQJD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OM4ZBHMYOLT2Z4CKHOQ4XZOQJD","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":"8c4892a8218faa53b320d0df4b102831eba197872e92dc5270a0f6d9bf3ab745","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-12-08T15:14:25Z","title_canon_sha256":"4d84f4c7626df627471c26a3176bbfd5ffde6b995d8b431d56ec5dae7e7e1685"},"schema_version":"1.0","source":{"id":"1612.02689","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02689","created_at":"2026-05-18T00:46:38Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02689v3","created_at":"2026-05-18T00:46:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02689","created_at":"2026-05-18T00:46:38Z"},{"alias_kind":"pith_short_12","alias_value":"OM4ZBHMYOLT2","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OM4ZBHMYOLT2Z4CK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OM4ZBHMY","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:3baffdc2bb21ebce72a0d7fffa3ff11e5c37a6d47656a66d2e4cc7add25e9ddd","target":"graph","created_at":"2026-05-18T00:46:38Z","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":"Fault-tolerant quantum computers compose elements of a discrete gate set in order to approximate a target unitary. The problem of minimising the number of gates is known as gate-synthesis. The approximation error is a form of coherent noise, which can be significantly more damaging than comparable incoherent noise. We show how mixing over different gate sequences can convert this coherent noise into an incoherent form. As measured by diamond distance, the post-mixing noise is quadratically smaller than before mixing, with no additional resource cost. Equivalently, we can use a shorter gate seq","authors_text":"Earl Campbell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-12-08T15:14:25Z","title":"Shorter gate sequences for quantum computing by mixing unitaries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02689","kind":"arxiv","version":3},"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:bc1848e953026c28d5e95f36824cae4a958ec7cc3d58579a9f51046482e9208d","target":"record","created_at":"2026-05-18T00:46:38Z","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":"8c4892a8218faa53b320d0df4b102831eba197872e92dc5270a0f6d9bf3ab745","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-12-08T15:14:25Z","title_canon_sha256":"4d84f4c7626df627471c26a3176bbfd5ffde6b995d8b431d56ec5dae7e7e1685"},"schema_version":"1.0","source":{"id":"1612.02689","kind":"arxiv","version":3}},"canonical_sha256":"7339909d9872e7acf04a3ba1cbe5d048c200546aa09561bfb658674d41dc48ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7339909d9872e7acf04a3ba1cbe5d048c200546aa09561bfb658674d41dc48ec","first_computed_at":"2026-05-18T00:46:38.623309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:38.623309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BL/jZzDLtnM96DRqj6i9cITbiEMXO/dFRArjGHsb3Hmf0G6+csxAKIGQ/rLT2dgxsOhlkhDi5FCqepqdYECeBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:38.623998Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.02689","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc1848e953026c28d5e95f36824cae4a958ec7cc3d58579a9f51046482e9208d","sha256:3baffdc2bb21ebce72a0d7fffa3ff11e5c37a6d47656a66d2e4cc7add25e9ddd"],"state_sha256":"3e45df44903ccc26eb02f55eb6ec201b95ceb7578fb4e35ddcc261d809cc9044"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UwzkIjSIf5UOqn7IOU5+noVzQmNEfjHCwajS3MiyDDTwUC7s0l5NIE6gYN+tmd5KN0NkBvyfznqWcbZdlzPFAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:09:27.796601Z","bundle_sha256":"8e42437b3c714f72280bc9137994e15f9000b18e1ee4af9ceb49dfb2d4ad5e3d"}}