{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:IVK5EXY3PQJHUYHMHGSBIDR4R3","short_pith_number":"pith:IVK5EXY3","schema_version":"1.0","canonical_sha256":"4555d25f1b7c127a60ec39a4140e3c8ec2f4cd4a2028bfdad7e49aca6de6bd2e","source":{"kind":"arxiv","id":"0907.5391","version":4},"attestation_state":"computed","paper":{"title":"General conditions for approximate quantum error correction and near-optimal recovery channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"C\\'edric B\\'eny, Ognyan Oreshkov","submitted_at":"2009-07-30T18:29:39Z","abstract_excerpt":"We derive necessary and sufficient conditions for the approximate correctability of a quantum code, generalizing the Knill-Laflamme conditions for exact error correction. Our measure of success of the recovery operation is the worst-case entanglement fidelity of the overall process. We show that the optimal recovery fidelity can be predicted exactly from a dual optimization problem on the environment causing the noise. We use this result to obtain an easy-to-calculate estimate of the optimal recovery fidelity as well as a way of constructing a class of near-optimal recovery channels that work "},"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":"0907.5391","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-07-30T18:29:39Z","cross_cats_sorted":[],"title_canon_sha256":"8db84fd4f4e1a51ba9cbb2a7d9b3f33914e6147ea5f585c6fcbd1ec8cadc926d","abstract_canon_sha256":"b2d27a046dc95613dc924de3b9adb0eb5c70085f3bb08e2394d5d76307b7b76b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:24:01.973929Z","signature_b64":"1Lzm1cFREzhaAeHxD4cUcgN5LlPHHlVjC4hZfL/9Me8bQ7Sk2d9LB2j/JAsnBdZIrG5zyxyc54PSwthZRlvQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4555d25f1b7c127a60ec39a4140e3c8ec2f4cd4a2028bfdad7e49aca6de6bd2e","last_reissued_at":"2026-07-04T17:24:01.973513Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:24:01.973513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"General conditions for approximate quantum error correction and near-optimal recovery channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"C\\'edric B\\'eny, Ognyan Oreshkov","submitted_at":"2009-07-30T18:29:39Z","abstract_excerpt":"We derive necessary and sufficient conditions for the approximate correctability of a quantum code, generalizing the Knill-Laflamme conditions for exact error correction. Our measure of success of the recovery operation is the worst-case entanglement fidelity of the overall process. We show that the optimal recovery fidelity can be predicted exactly from a dual optimization problem on the environment causing the noise. We use this result to obtain an easy-to-calculate estimate of the optimal recovery fidelity as well as a way of constructing a class of near-optimal recovery channels that work "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.5391","kind":"arxiv","version":4},"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/0907.5391/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":"0907.5391","created_at":"2026-07-04T17:24:01.973572+00:00"},{"alias_kind":"arxiv_version","alias_value":"0907.5391v4","created_at":"2026-07-04T17:24:01.973572+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.5391","created_at":"2026-07-04T17:24:01.973572+00:00"},{"alias_kind":"pith_short_12","alias_value":"IVK5EXY3PQJH","created_at":"2026-07-04T17:24:01.973572+00:00"},{"alias_kind":"pith_short_16","alias_value":"IVK5EXY3PQJHUYHM","created_at":"2026-07-04T17:24:01.973572+00:00"},{"alias_kind":"pith_short_8","alias_value":"IVK5EXY3","created_at":"2026-07-04T17:24:01.973572+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/IVK5EXY3PQJHUYHMHGSBIDR4R3","json":"https://pith.science/pith/IVK5EXY3PQJHUYHMHGSBIDR4R3.json","graph_json":"https://pith.science/api/pith-number/IVK5EXY3PQJHUYHMHGSBIDR4R3/graph.json","events_json":"https://pith.science/api/pith-number/IVK5EXY3PQJHUYHMHGSBIDR4R3/events.json","paper":"https://pith.science/paper/IVK5EXY3"},"agent_actions":{"view_html":"https://pith.science/pith/IVK5EXY3PQJHUYHMHGSBIDR4R3","download_json":"https://pith.science/pith/IVK5EXY3PQJHUYHMHGSBIDR4R3.json","view_paper":"https://pith.science/paper/IVK5EXY3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0907.5391&json=true","fetch_graph":"https://pith.science/api/pith-number/IVK5EXY3PQJHUYHMHGSBIDR4R3/graph.json","fetch_events":"https://pith.science/api/pith-number/IVK5EXY3PQJHUYHMHGSBIDR4R3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IVK5EXY3PQJHUYHMHGSBIDR4R3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IVK5EXY3PQJHUYHMHGSBIDR4R3/action/storage_attestation","attest_author":"https://pith.science/pith/IVK5EXY3PQJHUYHMHGSBIDR4R3/action/author_attestation","sign_citation":"https://pith.science/pith/IVK5EXY3PQJHUYHMHGSBIDR4R3/action/citation_signature","submit_replication":"https://pith.science/pith/IVK5EXY3PQJHUYHMHGSBIDR4R3/action/replication_record"}},"created_at":"2026-07-04T17:24:01.973572+00:00","updated_at":"2026-07-04T17:24:01.973572+00:00"}