{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:A5B4Z2TKYCFYVGUFGP32R5OVXS","short_pith_number":"pith:A5B4Z2TK","schema_version":"1.0","canonical_sha256":"0743ccea6ac08b8a9a8533f7a8f5d5bc91300c19c11b255551d6eb012fe7686b","source":{"kind":"arxiv","id":"1803.02834","version":4},"attestation_state":"computed","paper":{"title":"Fundamental limits to quantum channel discrimination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.other","physics.optics"],"primary_cat":"quant-ph","authors_text":"Cosmo Lupo, Jason L. Pereira, Riccardo Laurenza, Stefano Pirandola","submitted_at":"2018-03-07T19:00:02Z","abstract_excerpt":"What is the ultimate performance for discriminating two arbitrary quantum channels acting on a finite-dimensional Hilbert space? Here we address this basic question by deriving a general and fundamental lower bound. More precisely, we investigate the symmetric discrimination of two arbitrary qudit channels by means of the most general protocols based on adaptive (feedback-assisted) quantum operations. In this general scenario, we first show how port-based teleportation can be used to simplify these adaptive protocols into a much simpler non-adaptive form, designing a new type of teleportation "},"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":"1803.02834","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-03-07T19:00:02Z","cross_cats_sorted":["cond-mat.other","physics.optics"],"title_canon_sha256":"bb974b18364652b661e94b0c7b8050da427660400d1642360a6c56a00f05e7a8","abstract_canon_sha256":"7a6a6150e0974500d3b2b5d6833ce6b3c2385f34f8ab93b50e725cc389eeeecb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:18.408270Z","signature_b64":"JlFqrCJcyAbSexhycZg4SWq+SwY2DpkdkafBtB5WIM0LCWdY3vFaX+NmZtpHhGn3Xl3gptRfbENO6GlyO/OeBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0743ccea6ac08b8a9a8533f7a8f5d5bc91300c19c11b255551d6eb012fe7686b","last_reissued_at":"2026-07-04T23:52:18.407827Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:18.407827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fundamental limits to quantum channel discrimination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.other","physics.optics"],"primary_cat":"quant-ph","authors_text":"Cosmo Lupo, Jason L. Pereira, Riccardo Laurenza, Stefano Pirandola","submitted_at":"2018-03-07T19:00:02Z","abstract_excerpt":"What is the ultimate performance for discriminating two arbitrary quantum channels acting on a finite-dimensional Hilbert space? Here we address this basic question by deriving a general and fundamental lower bound. More precisely, we investigate the symmetric discrimination of two arbitrary qudit channels by means of the most general protocols based on adaptive (feedback-assisted) quantum operations. In this general scenario, we first show how port-based teleportation can be used to simplify these adaptive protocols into a much simpler non-adaptive form, designing a new type of teleportation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02834","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/1803.02834/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":"1803.02834","created_at":"2026-07-04T23:52:18.407881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.02834v4","created_at":"2026-07-04T23:52:18.407881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02834","created_at":"2026-07-04T23:52:18.407881+00:00"},{"alias_kind":"pith_short_12","alias_value":"A5B4Z2TKYCFY","created_at":"2026-07-04T23:52:18.407881+00:00"},{"alias_kind":"pith_short_16","alias_value":"A5B4Z2TKYCFYVGUF","created_at":"2026-07-04T23:52:18.407881+00:00"},{"alias_kind":"pith_short_8","alias_value":"A5B4Z2TK","created_at":"2026-07-04T23:52:18.407881+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.31519","citing_title":"Entanglement in quantum channel discrimination: sometimes less is more","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2504.12945","citing_title":"A resource theory of asynchronous quantum information processing","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A5B4Z2TKYCFYVGUFGP32R5OVXS","json":"https://pith.science/pith/A5B4Z2TKYCFYVGUFGP32R5OVXS.json","graph_json":"https://pith.science/api/pith-number/A5B4Z2TKYCFYVGUFGP32R5OVXS/graph.json","events_json":"https://pith.science/api/pith-number/A5B4Z2TKYCFYVGUFGP32R5OVXS/events.json","paper":"https://pith.science/paper/A5B4Z2TK"},"agent_actions":{"view_html":"https://pith.science/pith/A5B4Z2TKYCFYVGUFGP32R5OVXS","download_json":"https://pith.science/pith/A5B4Z2TKYCFYVGUFGP32R5OVXS.json","view_paper":"https://pith.science/paper/A5B4Z2TK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.02834&json=true","fetch_graph":"https://pith.science/api/pith-number/A5B4Z2TKYCFYVGUFGP32R5OVXS/graph.json","fetch_events":"https://pith.science/api/pith-number/A5B4Z2TKYCFYVGUFGP32R5OVXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A5B4Z2TKYCFYVGUFGP32R5OVXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A5B4Z2TKYCFYVGUFGP32R5OVXS/action/storage_attestation","attest_author":"https://pith.science/pith/A5B4Z2TKYCFYVGUFGP32R5OVXS/action/author_attestation","sign_citation":"https://pith.science/pith/A5B4Z2TKYCFYVGUFGP32R5OVXS/action/citation_signature","submit_replication":"https://pith.science/pith/A5B4Z2TKYCFYVGUFGP32R5OVXS/action/replication_record"}},"created_at":"2026-07-04T23:52:18.407881+00:00","updated_at":"2026-07-04T23:52:18.407881+00:00"}