{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NESJDPPSBJJN4IRD4VVYSXI6SF","short_pith_number":"pith:NESJDPPS","schema_version":"1.0","canonical_sha256":"692491bdf20a52de2223e56b895d1e914a826f6ecbd68bc535127b497feb6531","source":{"kind":"arxiv","id":"1103.0649","version":3},"attestation_state":"computed","paper":{"title":"Approximate simulation of quantum 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":"2011-03-03T11:02:30Z","abstract_excerpt":"In Ref. [1], we proved a duality between two optimizations problems. The primary one is, given two quantum channels M and N, to find a quantum channel R such that RN is optimally close to M as measured by the worst-case entanglement fidelity. The dual problem involves the information obtained by the environment through the so-called complementary channels M* and N*, and consists in finding a quantum channel R' such that R'M* is optimally close to N*. It turns out to be easier to find an approximate solution to the dual problem in certain important situations, notably when M is the identity cha"},"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":"1103.0649","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-03-03T11:02:30Z","cross_cats_sorted":[],"title_canon_sha256":"f0d3ff7cb6904351141de0e4367f5577577f8f4f8bba24a2f0fcf2b1e94e9e40","abstract_canon_sha256":"7c0b1f75b437ea8f3a109b95ea5a596d5bf358d21635f190e814b47576a1a93a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:45.994379Z","signature_b64":"5Um3DFQUSR8ONglxpE1dqt0UrfTSluRKV7SC8utRfeitGasS/jppGDV/lW3nEStwpjfXrt9w+8RrR7xtS9t7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"692491bdf20a52de2223e56b895d1e914a826f6ecbd68bc535127b497feb6531","last_reissued_at":"2026-05-18T04:14:45.993742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:45.993742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate simulation of quantum 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":"2011-03-03T11:02:30Z","abstract_excerpt":"In Ref. [1], we proved a duality between two optimizations problems. The primary one is, given two quantum channels M and N, to find a quantum channel R such that RN is optimally close to M as measured by the worst-case entanglement fidelity. The dual problem involves the information obtained by the environment through the so-called complementary channels M* and N*, and consists in finding a quantum channel R' such that R'M* is optimally close to N*. It turns out to be easier to find an approximate solution to the dual problem in certain important situations, notably when M is the identity cha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0649","kind":"arxiv","version":3},"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":"1103.0649","created_at":"2026-05-18T04:14:45.993841+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.0649v3","created_at":"2026-05-18T04:14:45.993841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0649","created_at":"2026-05-18T04:14:45.993841+00:00"},{"alias_kind":"pith_short_12","alias_value":"NESJDPPSBJJN","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NESJDPPSBJJN4IRD","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NESJDPPS","created_at":"2026-05-18T12:26:37.096874+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/NESJDPPSBJJN4IRD4VVYSXI6SF","json":"https://pith.science/pith/NESJDPPSBJJN4IRD4VVYSXI6SF.json","graph_json":"https://pith.science/api/pith-number/NESJDPPSBJJN4IRD4VVYSXI6SF/graph.json","events_json":"https://pith.science/api/pith-number/NESJDPPSBJJN4IRD4VVYSXI6SF/events.json","paper":"https://pith.science/paper/NESJDPPS"},"agent_actions":{"view_html":"https://pith.science/pith/NESJDPPSBJJN4IRD4VVYSXI6SF","download_json":"https://pith.science/pith/NESJDPPSBJJN4IRD4VVYSXI6SF.json","view_paper":"https://pith.science/paper/NESJDPPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.0649&json=true","fetch_graph":"https://pith.science/api/pith-number/NESJDPPSBJJN4IRD4VVYSXI6SF/graph.json","fetch_events":"https://pith.science/api/pith-number/NESJDPPSBJJN4IRD4VVYSXI6SF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NESJDPPSBJJN4IRD4VVYSXI6SF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NESJDPPSBJJN4IRD4VVYSXI6SF/action/storage_attestation","attest_author":"https://pith.science/pith/NESJDPPSBJJN4IRD4VVYSXI6SF/action/author_attestation","sign_citation":"https://pith.science/pith/NESJDPPSBJJN4IRD4VVYSXI6SF/action/citation_signature","submit_replication":"https://pith.science/pith/NESJDPPSBJJN4IRD4VVYSXI6SF/action/replication_record"}},"created_at":"2026-05-18T04:14:45.993841+00:00","updated_at":"2026-05-18T04:14:45.993841+00:00"}