{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FWORLPE5IXAFWWDWUKZ5K5V3VD","short_pith_number":"pith:FWORLPE5","schema_version":"1.0","canonical_sha256":"2d9d15bc9d45c05b5876a2b3d576bba8cac2a8e142297758ad6efef55ba24b32","source":{"kind":"arxiv","id":"2203.02127","version":1},"attestation_state":"computed","paper":{"title":"A hierarchy of efficient bounds on quantum capacities exploiting symmetry","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ala Shayeghi, Hoang Ta, Omar Fawzi","submitted_at":"2022-03-04T04:34:15Z","abstract_excerpt":"Optimal rates for achieving an information processing task are often characterized in terms of regularized information measures. In many cases of quantum tasks, we do not know how to compute such quantities. Here, we exploit the symmetries in the recently introduced $D^{\\#}$ in order to obtain a hierarchy of semidefinite programming bounds on various regularized quantities. As applications, we give a general procedure to give efficient bounds on the regularized Umegaki channel divergence as well as the classical capacity and two-way assisted quantum capacity of quantum channels. In particular,"},"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":"2203.02127","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-03-04T04:34:15Z","cross_cats_sorted":[],"title_canon_sha256":"bf67d839bd046d8ab27f4237582dd65f3f230bed8c6c709793ed12a40ba7093e","abstract_canon_sha256":"c8f26f7a62907a8237a2c8cf5517a7b7ca4121fb18b543992de13d3ac7738ab4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:44:04.189940Z","signature_b64":"Fe1MPl6F+NW2Q1OAIWKY44ALhQc7lPAPhaDu7+hx7/LJN/IJw5qJ+WleUQZo74Nw/gSBJAwGnQbgAy1vpGZfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d9d15bc9d45c05b5876a2b3d576bba8cac2a8e142297758ad6efef55ba24b32","last_reissued_at":"2026-07-05T06:44:04.189525Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:44:04.189525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A hierarchy of efficient bounds on quantum capacities exploiting symmetry","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ala Shayeghi, Hoang Ta, Omar Fawzi","submitted_at":"2022-03-04T04:34:15Z","abstract_excerpt":"Optimal rates for achieving an information processing task are often characterized in terms of regularized information measures. In many cases of quantum tasks, we do not know how to compute such quantities. Here, we exploit the symmetries in the recently introduced $D^{\\#}$ in order to obtain a hierarchy of semidefinite programming bounds on various regularized quantities. As applications, we give a general procedure to give efficient bounds on the regularized Umegaki channel divergence as well as the classical capacity and two-way assisted quantum capacity of quantum channels. In particular,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.02127","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.02127/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2203.02127","created_at":"2026-07-05T06:44:04.189584+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.02127v1","created_at":"2026-07-05T06:44:04.189584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.02127","created_at":"2026-07-05T06:44:04.189584+00:00"},{"alias_kind":"pith_short_12","alias_value":"FWORLPE5IXAF","created_at":"2026-07-05T06:44:04.189584+00:00"},{"alias_kind":"pith_short_16","alias_value":"FWORLPE5IXAFWWDW","created_at":"2026-07-05T06:44:04.189584+00:00"},{"alias_kind":"pith_short_8","alias_value":"FWORLPE5","created_at":"2026-07-05T06:44:04.189584+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/FWORLPE5IXAFWWDWUKZ5K5V3VD","json":"https://pith.science/pith/FWORLPE5IXAFWWDWUKZ5K5V3VD.json","graph_json":"https://pith.science/api/pith-number/FWORLPE5IXAFWWDWUKZ5K5V3VD/graph.json","events_json":"https://pith.science/api/pith-number/FWORLPE5IXAFWWDWUKZ5K5V3VD/events.json","paper":"https://pith.science/paper/FWORLPE5"},"agent_actions":{"view_html":"https://pith.science/pith/FWORLPE5IXAFWWDWUKZ5K5V3VD","download_json":"https://pith.science/pith/FWORLPE5IXAFWWDWUKZ5K5V3VD.json","view_paper":"https://pith.science/paper/FWORLPE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.02127&json=true","fetch_graph":"https://pith.science/api/pith-number/FWORLPE5IXAFWWDWUKZ5K5V3VD/graph.json","fetch_events":"https://pith.science/api/pith-number/FWORLPE5IXAFWWDWUKZ5K5V3VD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FWORLPE5IXAFWWDWUKZ5K5V3VD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FWORLPE5IXAFWWDWUKZ5K5V3VD/action/storage_attestation","attest_author":"https://pith.science/pith/FWORLPE5IXAFWWDWUKZ5K5V3VD/action/author_attestation","sign_citation":"https://pith.science/pith/FWORLPE5IXAFWWDWUKZ5K5V3VD/action/citation_signature","submit_replication":"https://pith.science/pith/FWORLPE5IXAFWWDWUKZ5K5V3VD/action/replication_record"}},"created_at":"2026-07-05T06:44:04.189584+00:00","updated_at":"2026-07-05T06:44:04.189584+00:00"}