{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:GMWK4PL35KANJOXGMLPDNZZW33","short_pith_number":"pith:GMWK4PL3","schema_version":"1.0","canonical_sha256":"332cae3d7bea80d4bae662de36e736decf3f1565f8d393dbe75e9db56c3a7240","source":{"kind":"arxiv","id":"2012.11104","version":1},"attestation_state":"computed","paper":{"title":"Optimal single-shot discrimination of optical modes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Asaph Ho, Ignatius William Primaatmaja, Valerio Scarani","submitted_at":"2020-12-21T03:47:57Z","abstract_excerpt":"Retrieving classical information encoded in optical modes is at the heart of many quantum information processing tasks, especially in the field of quantum communication and sensing. Yet, despite its importance, the fundamental limits of optical mode discrimination have been studied only in few specific examples. Here we present a toolbox to find the optimal discrimination of any set of optical modes. The toolbox uses linear and semi-definite programming techniques, which provide rigorous (not heuristic) bounds, and which can be efficiently solved on standard computers. We study both probabilis"},"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":"2012.11104","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-12-21T03:47:57Z","cross_cats_sorted":[],"title_canon_sha256":"62737ffcd3791bf458c3d7075214b0b1b7a797d626cd36c2ba8df577d7cb4562","abstract_canon_sha256":"56a041c7ad7efaef0c732f6cbb43a0be7a373fe46f1fba4d3bc1a7da82446735"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:38:53.468637Z","signature_b64":"v1MJfYVrPvT+a0MJpVPTa1cSR7RO2dTE+XRkz7tT9WtR/a3tul0Vysacql4r3lenSI1YDKIgBmID8hbb7238Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"332cae3d7bea80d4bae662de36e736decf3f1565f8d393dbe75e9db56c3a7240","last_reissued_at":"2026-07-05T02:38:53.468180Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:38:53.468180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal single-shot discrimination of optical modes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Asaph Ho, Ignatius William Primaatmaja, Valerio Scarani","submitted_at":"2020-12-21T03:47:57Z","abstract_excerpt":"Retrieving classical information encoded in optical modes is at the heart of many quantum information processing tasks, especially in the field of quantum communication and sensing. Yet, despite its importance, the fundamental limits of optical mode discrimination have been studied only in few specific examples. Here we present a toolbox to find the optimal discrimination of any set of optical modes. The toolbox uses linear and semi-definite programming techniques, which provide rigorous (not heuristic) bounds, and which can be efficiently solved on standard computers. We study both probabilis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.11104","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/2012.11104/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":"2012.11104","created_at":"2026-07-05T02:38:53.468241+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.11104v1","created_at":"2026-07-05T02:38:53.468241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.11104","created_at":"2026-07-05T02:38:53.468241+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMWK4PL35KAN","created_at":"2026-07-05T02:38:53.468241+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMWK4PL35KANJOXG","created_at":"2026-07-05T02:38:53.468241+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMWK4PL3","created_at":"2026-07-05T02:38:53.468241+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/GMWK4PL35KANJOXGMLPDNZZW33","json":"https://pith.science/pith/GMWK4PL35KANJOXGMLPDNZZW33.json","graph_json":"https://pith.science/api/pith-number/GMWK4PL35KANJOXGMLPDNZZW33/graph.json","events_json":"https://pith.science/api/pith-number/GMWK4PL35KANJOXGMLPDNZZW33/events.json","paper":"https://pith.science/paper/GMWK4PL3"},"agent_actions":{"view_html":"https://pith.science/pith/GMWK4PL35KANJOXGMLPDNZZW33","download_json":"https://pith.science/pith/GMWK4PL35KANJOXGMLPDNZZW33.json","view_paper":"https://pith.science/paper/GMWK4PL3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.11104&json=true","fetch_graph":"https://pith.science/api/pith-number/GMWK4PL35KANJOXGMLPDNZZW33/graph.json","fetch_events":"https://pith.science/api/pith-number/GMWK4PL35KANJOXGMLPDNZZW33/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMWK4PL35KANJOXGMLPDNZZW33/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMWK4PL35KANJOXGMLPDNZZW33/action/storage_attestation","attest_author":"https://pith.science/pith/GMWK4PL35KANJOXGMLPDNZZW33/action/author_attestation","sign_citation":"https://pith.science/pith/GMWK4PL35KANJOXGMLPDNZZW33/action/citation_signature","submit_replication":"https://pith.science/pith/GMWK4PL35KANJOXGMLPDNZZW33/action/replication_record"}},"created_at":"2026-07-05T02:38:53.468241+00:00","updated_at":"2026-07-05T02:38:53.468241+00:00"}