{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JORXI44GU34GVZTNZP2QSAPS5C","short_pith_number":"pith:JORXI44G","schema_version":"1.0","canonical_sha256":"4ba3747386a6f86ae66dcbf50901f2e8bae2acba2a28a8e48a0273b583a288a2","source":{"kind":"arxiv","id":"1407.8202","version":1},"attestation_state":"computed","paper":{"title":"Efficient Approximation of Quantum Channel Capacities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"David Sutter, Peyman Mohajerin Esfahani, Renato Renner, Tobias Sutter","submitted_at":"2014-07-30T20:23:09Z","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"},"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":"1407.8202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-07-30T20:23:09Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c00adac469cbc6c9bdc5f3573a181638de27610070ec64ee8880edd0b2e2b7f6","abstract_canon_sha256":"97d6e3c65ee3871851122aaf620461888f1f349dcb9b1fd81b7a119baecc948f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:14.919702Z","signature_b64":"Oa/Qu+9mmWUMWVZe34Ell39XRRN24TrPGeUPp0mh783cozx2xs/SNmXye1JX8DAMI4IswsUXXTwAR7uA5whaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ba3747386a6f86ae66dcbf50901f2e8bae2acba2a28a8e48a0273b583a288a2","last_reissued_at":"2026-05-18T01:22:14.919043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:14.919043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Approximation of Quantum Channel Capacities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"David Sutter, Peyman Mohajerin Esfahani, Renato Renner, Tobias Sutter","submitted_at":"2014-07-30T20:23:09Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.8202","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":"1407.8202","created_at":"2026-05-18T01:22:14.919137+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.8202v1","created_at":"2026-05-18T01:22:14.919137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.8202","created_at":"2026-05-18T01:22:14.919137+00:00"},{"alias_kind":"pith_short_12","alias_value":"JORXI44GU34G","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"JORXI44GU34GVZTN","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"JORXI44G","created_at":"2026-05-18T12:28:35.611951+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/JORXI44GU34GVZTNZP2QSAPS5C","json":"https://pith.science/pith/JORXI44GU34GVZTNZP2QSAPS5C.json","graph_json":"https://pith.science/api/pith-number/JORXI44GU34GVZTNZP2QSAPS5C/graph.json","events_json":"https://pith.science/api/pith-number/JORXI44GU34GVZTNZP2QSAPS5C/events.json","paper":"https://pith.science/paper/JORXI44G"},"agent_actions":{"view_html":"https://pith.science/pith/JORXI44GU34GVZTNZP2QSAPS5C","download_json":"https://pith.science/pith/JORXI44GU34GVZTNZP2QSAPS5C.json","view_paper":"https://pith.science/paper/JORXI44G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.8202&json=true","fetch_graph":"https://pith.science/api/pith-number/JORXI44GU34GVZTNZP2QSAPS5C/graph.json","fetch_events":"https://pith.science/api/pith-number/JORXI44GU34GVZTNZP2QSAPS5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JORXI44GU34GVZTNZP2QSAPS5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JORXI44GU34GVZTNZP2QSAPS5C/action/storage_attestation","attest_author":"https://pith.science/pith/JORXI44GU34GVZTNZP2QSAPS5C/action/author_attestation","sign_citation":"https://pith.science/pith/JORXI44GU34GVZTNZP2QSAPS5C/action/citation_signature","submit_replication":"https://pith.science/pith/JORXI44GU34GVZTNZP2QSAPS5C/action/replication_record"}},"created_at":"2026-05-18T01:22:14.919137+00:00","updated_at":"2026-05-18T01:22:14.919137+00:00"}