{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:P7KCHNTUSVUGQQZI3B6VH6AKRO","short_pith_number":"pith:P7KCHNTU","schema_version":"1.0","canonical_sha256":"7fd423b6749568684328d87d53f80a8baea174c07493e092734d6a5a7c828ead","source":{"kind":"arxiv","id":"1709.03805","version":1},"attestation_state":"computed","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"},"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":"1709.03805","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-12T12:32:06Z","cross_cats_sorted":[],"title_canon_sha256":"9a2ebeaf7d6c4f6d4705e33cdef5a584280e7226a5358b02f3b223499af207e9","abstract_canon_sha256":"fef9e82c8e7f721a2f714ac07c50b9136f418a238a129714dca3e273eef3e27f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:29.437476Z","signature_b64":"/iY9yi7EPdAQHTHOO3qZ6uSJzaBtvYtsGaY2pLf7xtAqCrTqJyCKs1rJ+XQEMkP0kOttAYLOW8EWV7B2KmRiDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fd423b6749568684328d87d53f80a8baea174c07493e092734d6a5a7c828ead","last_reissued_at":"2026-05-18T00:35:29.436918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:29.436918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.03805","created_at":"2026-05-18T00:35:29.437017+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.03805v1","created_at":"2026-05-18T00:35:29.437017+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03805","created_at":"2026-05-18T00:35:29.437017+00:00"},{"alias_kind":"pith_short_12","alias_value":"P7KCHNTUSVUG","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"P7KCHNTUSVUGQQZI","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"P7KCHNTU","created_at":"2026-05-18T12:31:37.085036+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/P7KCHNTUSVUGQQZI3B6VH6AKRO","json":"https://pith.science/pith/P7KCHNTUSVUGQQZI3B6VH6AKRO.json","graph_json":"https://pith.science/api/pith-number/P7KCHNTUSVUGQQZI3B6VH6AKRO/graph.json","events_json":"https://pith.science/api/pith-number/P7KCHNTUSVUGQQZI3B6VH6AKRO/events.json","paper":"https://pith.science/paper/P7KCHNTU"},"agent_actions":{"view_html":"https://pith.science/pith/P7KCHNTUSVUGQQZI3B6VH6AKRO","download_json":"https://pith.science/pith/P7KCHNTUSVUGQQZI3B6VH6AKRO.json","view_paper":"https://pith.science/paper/P7KCHNTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.03805&json=true","fetch_graph":"https://pith.science/api/pith-number/P7KCHNTUSVUGQQZI3B6VH6AKRO/graph.json","fetch_events":"https://pith.science/api/pith-number/P7KCHNTUSVUGQQZI3B6VH6AKRO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P7KCHNTUSVUGQQZI3B6VH6AKRO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P7KCHNTUSVUGQQZI3B6VH6AKRO/action/storage_attestation","attest_author":"https://pith.science/pith/P7KCHNTUSVUGQQZI3B6VH6AKRO/action/author_attestation","sign_citation":"https://pith.science/pith/P7KCHNTUSVUGQQZI3B6VH6AKRO/action/citation_signature","submit_replication":"https://pith.science/pith/P7KCHNTUSVUGQQZI3B6VH6AKRO/action/replication_record"}},"created_at":"2026-05-18T00:35:29.437017+00:00","updated_at":"2026-05-18T00:35:29.437017+00:00"}