{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YD3UDZXT4KOJ3MUYDVLU2XYLJH","short_pith_number":"pith:YD3UDZXT","schema_version":"1.0","canonical_sha256":"c0f741e6f3e29c9db2981d574d5f0b49e9a27dceb4208fa80dfae03fa6a96a06","source":{"kind":"arxiv","id":"2507.12326","version":1},"attestation_state":"computed","paper":{"title":"On approximate quantum error correction for symmetric noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gereon Ko{\\ss}mann, Julius A. Zeiss, Mario Berta, Omar Fawzi","submitted_at":"2025-07-16T15:20:07Z","abstract_excerpt":"We revisit the extendability-based semi-definite programming hierarchy introduced by Berta et al. [Mathematical Programming, 1 - 49 (2021)], which provides converging outer bounds on the optimal fidelity of approximate quantum error correction (AQEC). As our first contribution, we introduce a measurement-based rounding scheme that extracts inner sequences of certifiably good encoder-decoder pairs from this outer hierarchy. To address the computational complexity of evaluating fixed levels of the hierarchy, we investigate the use of symmetry-based dimension reduction. In particular, we combine "},"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":"2507.12326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-07-16T15:20:07Z","cross_cats_sorted":[],"title_canon_sha256":"e494b658bf0f4b47153f4178fef17bdcfb737177543e95e4235eabdeb906c008","abstract_canon_sha256":"87bbe3588aa663a9888b1439cefb7b9cf7ec8c3831c440922a5069703cb86bd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:18.394560Z","signature_b64":"NcK8GRNX2dUnB69ytZ9/t2ImW2UTMjaGMOU6Cy9fokKkq4laLF2ZvCBcDLRzqV6CUjeyGKtrQ6E7terfKemoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0f741e6f3e29c9db2981d574d5f0b49e9a27dceb4208fa80dfae03fa6a96a06","last_reissued_at":"2026-07-05T11:38:18.393965Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:18.393965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On approximate quantum error correction for symmetric noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gereon Ko{\\ss}mann, Julius A. Zeiss, Mario Berta, Omar Fawzi","submitted_at":"2025-07-16T15:20:07Z","abstract_excerpt":"We revisit the extendability-based semi-definite programming hierarchy introduced by Berta et al. [Mathematical Programming, 1 - 49 (2021)], which provides converging outer bounds on the optimal fidelity of approximate quantum error correction (AQEC). As our first contribution, we introduce a measurement-based rounding scheme that extracts inner sequences of certifiably good encoder-decoder pairs from this outer hierarchy. To address the computational complexity of evaluating fixed levels of the hierarchy, we investigate the use of symmetry-based dimension reduction. In particular, we combine "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.12326","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/2507.12326/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":"2507.12326","created_at":"2026-07-05T11:38:18.394047+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.12326v1","created_at":"2026-07-05T11:38:18.394047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.12326","created_at":"2026-07-05T11:38:18.394047+00:00"},{"alias_kind":"pith_short_12","alias_value":"YD3UDZXT4KOJ","created_at":"2026-07-05T11:38:18.394047+00:00"},{"alias_kind":"pith_short_16","alias_value":"YD3UDZXT4KOJ3MUY","created_at":"2026-07-05T11:38:18.394047+00:00"},{"alias_kind":"pith_short_8","alias_value":"YD3UDZXT","created_at":"2026-07-05T11:38:18.394047+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.23689","citing_title":"Fixed points in de Finetti hierarchies","ref_index":56,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YD3UDZXT4KOJ3MUYDVLU2XYLJH","json":"https://pith.science/pith/YD3UDZXT4KOJ3MUYDVLU2XYLJH.json","graph_json":"https://pith.science/api/pith-number/YD3UDZXT4KOJ3MUYDVLU2XYLJH/graph.json","events_json":"https://pith.science/api/pith-number/YD3UDZXT4KOJ3MUYDVLU2XYLJH/events.json","paper":"https://pith.science/paper/YD3UDZXT"},"agent_actions":{"view_html":"https://pith.science/pith/YD3UDZXT4KOJ3MUYDVLU2XYLJH","download_json":"https://pith.science/pith/YD3UDZXT4KOJ3MUYDVLU2XYLJH.json","view_paper":"https://pith.science/paper/YD3UDZXT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.12326&json=true","fetch_graph":"https://pith.science/api/pith-number/YD3UDZXT4KOJ3MUYDVLU2XYLJH/graph.json","fetch_events":"https://pith.science/api/pith-number/YD3UDZXT4KOJ3MUYDVLU2XYLJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YD3UDZXT4KOJ3MUYDVLU2XYLJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YD3UDZXT4KOJ3MUYDVLU2XYLJH/action/storage_attestation","attest_author":"https://pith.science/pith/YD3UDZXT4KOJ3MUYDVLU2XYLJH/action/author_attestation","sign_citation":"https://pith.science/pith/YD3UDZXT4KOJ3MUYDVLU2XYLJH/action/citation_signature","submit_replication":"https://pith.science/pith/YD3UDZXT4KOJ3MUYDVLU2XYLJH/action/replication_record"}},"created_at":"2026-07-05T11:38:18.394047+00:00","updated_at":"2026-07-05T11:38:18.394047+00:00"}