{"paper":{"title":"Criteria for universality of quantum gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.GR","math.MP"],"primary_cat":"quant-ph","authors_text":"Adam Sawicki, Katarzyna Karnas","submitted_at":"2016-10-03T13:39:39Z","abstract_excerpt":"We consider the problem of deciding if a set of quantum one-qudit gates $\\mathcal{S}=\\{U_1,\\ldots,U_n\\}$ is universal. We provide the compact form criteria leading to a simple algorithm that allows deciding universality of any given set of gates in a finite number of steps. Moreover, for a non-universal $\\mathcal{S}$ our criteria indicate what type of gates can be added to $\\mathcal{S}$ to turn it into a universal set."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00547","kind":"arxiv","version":6},"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"}