{"paper":{"title":"Convex approximations of quantum channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Massimiliano F. Sacchi, Tito Sacchi","submitted_at":"2017-09-12T12:32:06Z","abstract_excerpt":"We address the problem of optimally approximating the action of a desired and unavailable quantum channel $\\Phi $ having at our disposal a single use of a given set of other channels $\\{\\Psi_i \\}$. The problem is recast to look for the least distinguishable channel from $\\Phi $ among the convex set $\\sum_i p_i \\Psi_i$, and the corresponding optimal weights $\\{ p_i \\}$ provide the optimal convex mixing of the available channels $\\{\\Psi_i \\}$. For single-qubit channels we study specifically the cases where the available convex set corresponds to covariant channels or to Pauli channels, and the d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03805","kind":"arxiv","version":1},"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"}