{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TFAYOD6WMKUCQD56MCQI2B2JVO","short_pith_number":"pith:TFAYOD6W","canonical_record":{"source":{"id":"1412.5608","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-12-17T21:01:07Z","cross_cats_sorted":[],"title_canon_sha256":"c42f72767e054a3d5e1db1a4f2ca4ee9d66e5eb931d8adf2c7d10ae3ebd0cec8","abstract_canon_sha256":"5847d7ad1e98ae3f0a38de655f5a15147d0206908ce1e75cbea77066dfd4fa33"},"schema_version":"1.0"},"canonical_sha256":"9941870fd662a8280fbe60a08d0749aba3cbdaa63fe879ab0e57ca10bae6a5cb","source":{"kind":"arxiv","id":"1412.5608","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.5608","created_at":"2026-05-18T01:12:38Z"},{"alias_kind":"arxiv_version","alias_value":"1412.5608v4","created_at":"2026-05-18T01:12:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5608","created_at":"2026-05-18T01:12:38Z"},{"alias_kind":"pith_short_12","alias_value":"TFAYOD6WMKUC","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TFAYOD6WMKUCQD56","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TFAYOD6W","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TFAYOD6WMKUCQD56MCQI2B2JVO","target":"record","payload":{"canonical_record":{"source":{"id":"1412.5608","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-12-17T21:01:07Z","cross_cats_sorted":[],"title_canon_sha256":"c42f72767e054a3d5e1db1a4f2ca4ee9d66e5eb931d8adf2c7d10ae3ebd0cec8","abstract_canon_sha256":"5847d7ad1e98ae3f0a38de655f5a15147d0206908ce1e75cbea77066dfd4fa33"},"schema_version":"1.0"},"canonical_sha256":"9941870fd662a8280fbe60a08d0749aba3cbdaa63fe879ab0e57ca10bae6a5cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:38.157532Z","signature_b64":"Ud3haCvgWx6tpcnuGv44bk4lFFdniIwn40m6x8LUcuvkWcboQ3EbWnwU5x09TMjoN2FszQ7nFoiuvW5mrNckBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9941870fd662a8280fbe60a08d0749aba3cbdaa63fe879ab0e57ca10bae6a5cb","last_reissued_at":"2026-05-18T01:12:38.157182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:38.157182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.5608","source_version":4,"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:12:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kCCcOnO0V7ldbZMKOvE1T3yfpWp13nwihbjabrr8hV7VIBNlLbyE43DOmq+/M+y99BbSzUN9TyclKBORhIOKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:35:03.619835Z"},"content_sha256":"e6ff670550ad33f2d407c2417b9680c57be9a79f5f62fc9e75d0bf450bcaf89f","schema_version":"1.0","event_id":"sha256:e6ff670550ad33f2d407c2417b9680c57be9a79f5f62fc9e75d0bf450bcaf89f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TFAYOD6WMKUCQD56MCQI2B2JVO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Approximation of Diagonal Unitaries over the Clifford+T Basis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alex Bocharov, Jonathan Welch, Krysta M. Svore","submitted_at":"2014-12-17T21:01:07Z","abstract_excerpt":"We present an algorithm for the approximate decomposition of diagonal operators, focusing specifically on decompositions over the Clifford+$T$ basis, that minimize the number of phase-rotation gates in the synthesized approximation circuit. The equivalent $T$-count of the synthesized circuit is bounded by $k \\, C_0 \\log_2(1/\\varepsilon) + E(n,k)$, where $k$ is the number of distinct phases in the diagonal $n$-qubit unitary, $\\varepsilon$ is the desired precision, $C_0$ is a quality factor of the implementation method ($1<C_0<4$), and $E(n,k)$ is the total entanglement cost (in $T$ gates). We d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5608","kind":"arxiv","version":4},"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:12:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ttGFikBvPNbbcO98A4J6CdpkIOxOgrgfskLfF2A/trHmmRbQD8YhTXVn2H3ppos2BBOxJa8P9o5BkXcxROwdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:35:03.620184Z"},"content_sha256":"6f06ee722d291143b626c1ac265ec392a3cae2b08912e71a8fbb03ef1dc3d28f","schema_version":"1.0","event_id":"sha256:6f06ee722d291143b626c1ac265ec392a3cae2b08912e71a8fbb03ef1dc3d28f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TFAYOD6WMKUCQD56MCQI2B2JVO/bundle.json","state_url":"https://pith.science/pith/TFAYOD6WMKUCQD56MCQI2B2JVO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TFAYOD6WMKUCQD56MCQI2B2JVO/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-28T14:35:03Z","links":{"resolver":"https://pith.science/pith/TFAYOD6WMKUCQD56MCQI2B2JVO","bundle":"https://pith.science/pith/TFAYOD6WMKUCQD56MCQI2B2JVO/bundle.json","state":"https://pith.science/pith/TFAYOD6WMKUCQD56MCQI2B2JVO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TFAYOD6WMKUCQD56MCQI2B2JVO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TFAYOD6WMKUCQD56MCQI2B2JVO","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":"5847d7ad1e98ae3f0a38de655f5a15147d0206908ce1e75cbea77066dfd4fa33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-12-17T21:01:07Z","title_canon_sha256":"c42f72767e054a3d5e1db1a4f2ca4ee9d66e5eb931d8adf2c7d10ae3ebd0cec8"},"schema_version":"1.0","source":{"id":"1412.5608","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.5608","created_at":"2026-05-18T01:12:38Z"},{"alias_kind":"arxiv_version","alias_value":"1412.5608v4","created_at":"2026-05-18T01:12:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5608","created_at":"2026-05-18T01:12:38Z"},{"alias_kind":"pith_short_12","alias_value":"TFAYOD6WMKUC","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TFAYOD6WMKUCQD56","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TFAYOD6W","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:6f06ee722d291143b626c1ac265ec392a3cae2b08912e71a8fbb03ef1dc3d28f","target":"graph","created_at":"2026-05-18T01:12: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":"We present an algorithm for the approximate decomposition of diagonal operators, focusing specifically on decompositions over the Clifford+$T$ basis, that minimize the number of phase-rotation gates in the synthesized approximation circuit. The equivalent $T$-count of the synthesized circuit is bounded by $k \\, C_0 \\log_2(1/\\varepsilon) + E(n,k)$, where $k$ is the number of distinct phases in the diagonal $n$-qubit unitary, $\\varepsilon$ is the desired precision, $C_0$ is a quality factor of the implementation method ($1<C_0<4$), and $E(n,k)$ is the total entanglement cost (in $T$ gates). We d","authors_text":"Alex Bocharov, Jonathan Welch, Krysta M. Svore","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-12-17T21:01:07Z","title":"Efficient Approximation of Diagonal Unitaries over the Clifford+T Basis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5608","kind":"arxiv","version":4},"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:e6ff670550ad33f2d407c2417b9680c57be9a79f5f62fc9e75d0bf450bcaf89f","target":"record","created_at":"2026-05-18T01:12: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":"5847d7ad1e98ae3f0a38de655f5a15147d0206908ce1e75cbea77066dfd4fa33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-12-17T21:01:07Z","title_canon_sha256":"c42f72767e054a3d5e1db1a4f2ca4ee9d66e5eb931d8adf2c7d10ae3ebd0cec8"},"schema_version":"1.0","source":{"id":"1412.5608","kind":"arxiv","version":4}},"canonical_sha256":"9941870fd662a8280fbe60a08d0749aba3cbdaa63fe879ab0e57ca10bae6a5cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9941870fd662a8280fbe60a08d0749aba3cbdaa63fe879ab0e57ca10bae6a5cb","first_computed_at":"2026-05-18T01:12:38.157182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:38.157182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ud3haCvgWx6tpcnuGv44bk4lFFdniIwn40m6x8LUcuvkWcboQ3EbWnwU5x09TMjoN2FszQ7nFoiuvW5mrNckBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:38.157532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.5608","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6ff670550ad33f2d407c2417b9680c57be9a79f5f62fc9e75d0bf450bcaf89f","sha256:6f06ee722d291143b626c1ac265ec392a3cae2b08912e71a8fbb03ef1dc3d28f"],"state_sha256":"6a8cb9165f7be36037d416fdc4c16f3073c94f8f815349b9cd3dd9bac9a66216"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DsA0syOxYUU/Z0SB0saLRWgoK18a7/oSnjLJXlRDJi/dmf1eFHgFq8Hd0r7TGgtT7WAASSXawK6Sv3bY2yMKAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:35:03.622140Z","bundle_sha256":"2d338277e97d0e1a0efd4622c32a295ad53069e5114f25c1341221cd2ba87d36"}}