{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TFAYOD6WMKUCQD56MCQI2B2JVO","short_pith_number":"pith:TFAYOD6W","schema_version":"1.0","canonical_sha256":"9941870fd662a8280fbe60a08d0749aba3cbdaa63fe879ab0e57ca10bae6a5cb","source":{"kind":"arxiv","id":"1412.5608","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.5608","created_at":"2026-05-18T01:12:38.157241+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.5608v4","created_at":"2026-05-18T01:12:38.157241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5608","created_at":"2026-05-18T01:12:38.157241+00:00"},{"alias_kind":"pith_short_12","alias_value":"TFAYOD6WMKUC","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TFAYOD6WMKUCQD56","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TFAYOD6W","created_at":"2026-05-18T12:28:49.207871+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TFAYOD6WMKUCQD56MCQI2B2JVO","json":"https://pith.science/pith/TFAYOD6WMKUCQD56MCQI2B2JVO.json","graph_json":"https://pith.science/api/pith-number/TFAYOD6WMKUCQD56MCQI2B2JVO/graph.json","events_json":"https://pith.science/api/pith-number/TFAYOD6WMKUCQD56MCQI2B2JVO/events.json","paper":"https://pith.science/paper/TFAYOD6W"},"agent_actions":{"view_html":"https://pith.science/pith/TFAYOD6WMKUCQD56MCQI2B2JVO","download_json":"https://pith.science/pith/TFAYOD6WMKUCQD56MCQI2B2JVO.json","view_paper":"https://pith.science/paper/TFAYOD6W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.5608&json=true","fetch_graph":"https://pith.science/api/pith-number/TFAYOD6WMKUCQD56MCQI2B2JVO/graph.json","fetch_events":"https://pith.science/api/pith-number/TFAYOD6WMKUCQD56MCQI2B2JVO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TFAYOD6WMKUCQD56MCQI2B2JVO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TFAYOD6WMKUCQD56MCQI2B2JVO/action/storage_attestation","attest_author":"https://pith.science/pith/TFAYOD6WMKUCQD56MCQI2B2JVO/action/author_attestation","sign_citation":"https://pith.science/pith/TFAYOD6WMKUCQD56MCQI2B2JVO/action/citation_signature","submit_replication":"https://pith.science/pith/TFAYOD6WMKUCQD56MCQI2B2JVO/action/replication_record"}},"created_at":"2026-05-18T01:12:38.157241+00:00","updated_at":"2026-05-18T01:12:38.157241+00:00"}