{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZBYUZV3APLPXLQ33WPCS6DRQXI","short_pith_number":"pith:ZBYUZV3A","schema_version":"1.0","canonical_sha256":"c8714cd7607adf75c37bb3c52f0e30ba252c6f650daf2d43cf5bec9b5c69fda2","source":{"kind":"arxiv","id":"1311.3599","version":2},"attestation_state":"computed","paper":{"title":"Decomposition of quantum gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chi-Kwong Li, Diane Pelejo","submitted_at":"2013-11-14T18:28:37Z","abstract_excerpt":"A recurrence scheme is presented to decompose an $n$-qubit unitary gate to the product of no more than $N(N-1)/2$ single qubit gates with small number of controls, where $N = 2^n$. Detailed description of the recurrence steps and formulas for the number of $k$-controlled single qubit gates in the decomposition are given. Comparison of the result to a previous scheme is presented, and future research directions are discussed."},"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.3599","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-11-14T18:28:37Z","cross_cats_sorted":[],"title_canon_sha256":"aa3c45498e241ba637ca707774caf5a3e7aea9aa180b458303ebff6bbe330b56","abstract_canon_sha256":"ce48e2d65d718cbd0978ca5b5f17e97c7cd00f79be95c391ec3c2ea3d10de349"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:27.727432Z","signature_b64":"HEWWAVfZ/z7IzUnv+yYM+iZA9wTk95BDbyirdccvxZcw+1vlu4lEvKs2J+e3pC9r5mbTCcJeSpPoB+28/mE9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8714cd7607adf75c37bb3c52f0e30ba252c6f650daf2d43cf5bec9b5c69fda2","last_reissued_at":"2026-05-18T03:05:27.726825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:27.726825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposition of quantum gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chi-Kwong Li, Diane Pelejo","submitted_at":"2013-11-14T18:28:37Z","abstract_excerpt":"A recurrence scheme is presented to decompose an $n$-qubit unitary gate to the product of no more than $N(N-1)/2$ single qubit gates with small number of controls, where $N = 2^n$. Detailed description of the recurrence steps and formulas for the number of $k$-controlled single qubit gates in the decomposition are given. Comparison of the result to a previous scheme is presented, and future research directions are discussed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3599","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.3599","created_at":"2026-05-18T03:05:27.726918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.3599v2","created_at":"2026-05-18T03:05:27.726918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3599","created_at":"2026-05-18T03:05:27.726918+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBYUZV3APLPX","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBYUZV3APLPXLQ33","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBYUZV3A","created_at":"2026-05-18T12:28:09.283467+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2107.09809","citing_title":"Simulating quantum chaos on a quantum computer","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZBYUZV3APLPXLQ33WPCS6DRQXI","json":"https://pith.science/pith/ZBYUZV3APLPXLQ33WPCS6DRQXI.json","graph_json":"https://pith.science/api/pith-number/ZBYUZV3APLPXLQ33WPCS6DRQXI/graph.json","events_json":"https://pith.science/api/pith-number/ZBYUZV3APLPXLQ33WPCS6DRQXI/events.json","paper":"https://pith.science/paper/ZBYUZV3A"},"agent_actions":{"view_html":"https://pith.science/pith/ZBYUZV3APLPXLQ33WPCS6DRQXI","download_json":"https://pith.science/pith/ZBYUZV3APLPXLQ33WPCS6DRQXI.json","view_paper":"https://pith.science/paper/ZBYUZV3A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.3599&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBYUZV3APLPXLQ33WPCS6DRQXI/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBYUZV3APLPXLQ33WPCS6DRQXI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBYUZV3APLPXLQ33WPCS6DRQXI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBYUZV3APLPXLQ33WPCS6DRQXI/action/storage_attestation","attest_author":"https://pith.science/pith/ZBYUZV3APLPXLQ33WPCS6DRQXI/action/author_attestation","sign_citation":"https://pith.science/pith/ZBYUZV3APLPXLQ33WPCS6DRQXI/action/citation_signature","submit_replication":"https://pith.science/pith/ZBYUZV3APLPXLQ33WPCS6DRQXI/action/replication_record"}},"created_at":"2026-05-18T03:05:27.726918+00:00","updated_at":"2026-05-18T03:05:27.726918+00:00"}