{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JORXI44GU34GVZTNZP2QSAPS5C","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"97d6e3c65ee3871851122aaf620461888f1f349dcb9b1fd81b7a119baecc948f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-07-30T20:23:09Z","title_canon_sha256":"c00adac469cbc6c9bdc5f3573a181638de27610070ec64ee8880edd0b2e2b7f6"},"schema_version":"1.0","source":{"id":"1407.8202","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.8202","created_at":"2026-05-18T01:22:14Z"},{"alias_kind":"arxiv_version","alias_value":"1407.8202v1","created_at":"2026-05-18T01:22:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.8202","created_at":"2026-05-18T01:22:14Z"},{"alias_kind":"pith_short_12","alias_value":"JORXI44GU34G","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JORXI44GU34GVZTN","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JORXI44G","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:1814bd439dab15bba1effcf4ab1edc9faf1f6fd157f7208b98aa5bab39456a82","target":"graph","created_at":"2026-05-18T01:22:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We propose an iterative method for approximating the capacity of classical-quantum channels with a discrete input alphabet and a finite dimensional output, possibly under additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and lower bounds for the capacity. To provide an $\\varepsilon$-close estimate to the capacity, the presented algorithm requires $O(\\tfrac{(N \\vee M) M^3 \\log(N)^{1/2}}{\\varepsilon})$, where $N$ denotes the input alphabet size and $M$ the output dimension. We then generalize the method for the task of approximatin","authors_text":"David Sutter, Peyman Mohajerin Esfahani, Renato Renner, Tobias Sutter","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-07-30T20:23:09Z","title":"Efficient Approximation of Quantum Channel Capacities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.8202","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:284ad40b1ba6b1cac6f8f97f3470df881191c525aa1c2f47986597a8d79ffede","target":"record","created_at":"2026-05-18T01:22:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"97d6e3c65ee3871851122aaf620461888f1f349dcb9b1fd81b7a119baecc948f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-07-30T20:23:09Z","title_canon_sha256":"c00adac469cbc6c9bdc5f3573a181638de27610070ec64ee8880edd0b2e2b7f6"},"schema_version":"1.0","source":{"id":"1407.8202","kind":"arxiv","version":1}},"canonical_sha256":"4ba3747386a6f86ae66dcbf50901f2e8bae2acba2a28a8e48a0273b583a288a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ba3747386a6f86ae66dcbf50901f2e8bae2acba2a28a8e48a0273b583a288a2","first_computed_at":"2026-05-18T01:22:14.919043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:14.919043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Oa/Qu+9mmWUMWVZe34Ell39XRRN24TrPGeUPp0mh783cozx2xs/SNmXye1JX8DAMI4IswsUXXTwAR7uA5whaDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:14.919702Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.8202","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:284ad40b1ba6b1cac6f8f97f3470df881191c525aa1c2f47986597a8d79ffede","sha256:1814bd439dab15bba1effcf4ab1edc9faf1f6fd157f7208b98aa5bab39456a82"],"state_sha256":"ec5aaee1030912fd47978094d3465518bf04ed6b493efa5d42295ae70d92cf81"}