{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BKR4JGSA2GYLC4TMGEPZWNP6QG","short_pith_number":"pith:BKR4JGSA","schema_version":"1.0","canonical_sha256":"0aa3c49a40d1b0b1726c311f9b35fe818d510c081337d2a2902f4a6db89e2fbf","source":{"kind":"arxiv","id":"2401.02022","version":2},"attestation_state":"computed","paper":{"title":"The Near-optimal Performance of Quantum Error Correction Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gideon Lee, Guo Zheng, Liang Jiang, Wenhao He","submitted_at":"2024-01-04T01:44:53Z","abstract_excerpt":"The Knill-Laflamme (KL) conditions distinguish exact quantum error correction codes, and it has played a critical role in the discovery of state-of-the-art codes. However, the family of exact codes is a very restrictive one and does not necessarily contain the best-performing codes. Therefore, it is desirable to develop a generalized and quantitative performance metric. In this Letter, we derive the near-optimal channel fidelity, a concise and optimization-free metric for arbitrary codes and noise. The metric provides a narrow two-sided bound to the optimal code performance, and it can be eval"},"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":"2401.02022","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-01-04T01:44:53Z","cross_cats_sorted":[],"title_canon_sha256":"5da00fe8af80548e40a82951021a3a8c64980e48dcb75f3645f1800939146782","abstract_canon_sha256":"a6e5fd203f14c2cc0afd36ccd397bfce6737eba1290d277560d8f2b1b5606678"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:34:09.628152Z","signature_b64":"GxvEGasjZnuLY9uDTMT2NO7g148ZYfQtXoUDy5W6ofQf2gnXCBzh+qqi04UVAzPW5byBSbPW0PIyGU90uEkDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0aa3c49a40d1b0b1726c311f9b35fe818d510c081337d2a2902f4a6db89e2fbf","last_reissued_at":"2026-07-05T08:34:09.627628Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:34:09.627628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Near-optimal Performance of Quantum Error Correction Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gideon Lee, Guo Zheng, Liang Jiang, Wenhao He","submitted_at":"2024-01-04T01:44:53Z","abstract_excerpt":"The Knill-Laflamme (KL) conditions distinguish exact quantum error correction codes, and it has played a critical role in the discovery of state-of-the-art codes. However, the family of exact codes is a very restrictive one and does not necessarily contain the best-performing codes. Therefore, it is desirable to develop a generalized and quantitative performance metric. In this Letter, we derive the near-optimal channel fidelity, a concise and optimization-free metric for arbitrary codes and noise. The metric provides a narrow two-sided bound to the optimal code performance, and it can be eval"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.02022","kind":"arxiv","version":2},"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/2401.02022/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":"2401.02022","created_at":"2026-07-05T08:34:09.627691+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.02022v2","created_at":"2026-07-05T08:34:09.627691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.02022","created_at":"2026-07-05T08:34:09.627691+00:00"},{"alias_kind":"pith_short_12","alias_value":"BKR4JGSA2GYL","created_at":"2026-07-05T08:34:09.627691+00:00"},{"alias_kind":"pith_short_16","alias_value":"BKR4JGSA2GYLC4TM","created_at":"2026-07-05T08:34:09.627691+00:00"},{"alias_kind":"pith_short_8","alias_value":"BKR4JGSA","created_at":"2026-07-05T08:34:09.627691+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23777","citing_title":"Connecting Quantum Tomography and Quantum Retrodiction","ref_index":69,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BKR4JGSA2GYLC4TMGEPZWNP6QG","json":"https://pith.science/pith/BKR4JGSA2GYLC4TMGEPZWNP6QG.json","graph_json":"https://pith.science/api/pith-number/BKR4JGSA2GYLC4TMGEPZWNP6QG/graph.json","events_json":"https://pith.science/api/pith-number/BKR4JGSA2GYLC4TMGEPZWNP6QG/events.json","paper":"https://pith.science/paper/BKR4JGSA"},"agent_actions":{"view_html":"https://pith.science/pith/BKR4JGSA2GYLC4TMGEPZWNP6QG","download_json":"https://pith.science/pith/BKR4JGSA2GYLC4TMGEPZWNP6QG.json","view_paper":"https://pith.science/paper/BKR4JGSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.02022&json=true","fetch_graph":"https://pith.science/api/pith-number/BKR4JGSA2GYLC4TMGEPZWNP6QG/graph.json","fetch_events":"https://pith.science/api/pith-number/BKR4JGSA2GYLC4TMGEPZWNP6QG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BKR4JGSA2GYLC4TMGEPZWNP6QG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BKR4JGSA2GYLC4TMGEPZWNP6QG/action/storage_attestation","attest_author":"https://pith.science/pith/BKR4JGSA2GYLC4TMGEPZWNP6QG/action/author_attestation","sign_citation":"https://pith.science/pith/BKR4JGSA2GYLC4TMGEPZWNP6QG/action/citation_signature","submit_replication":"https://pith.science/pith/BKR4JGSA2GYLC4TMGEPZWNP6QG/action/replication_record"}},"created_at":"2026-07-05T08:34:09.627691+00:00","updated_at":"2026-07-05T08:34:09.627691+00:00"}