{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7PW5POZ7ILJ6JZGMNLRIKDELZL","short_pith_number":"pith:7PW5POZ7","schema_version":"1.0","canonical_sha256":"fbedd7bb3f42d3e4e4cc6ae2850c8bcae070e4ab9409c319261d81811c04ce6f","source":{"kind":"arxiv","id":"1911.01927","version":1},"attestation_state":"computed","paper":{"title":"Simple Communication Complexity Separation from Quantum State Antidistinguishability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jonathan Barrett, Vojt\\v{e}ch Havl\\'i\\v{c}ek","submitted_at":"2019-11-05T16:41:42Z","abstract_excerpt":"A set of $n$ pure quantum states is called antidististinguishable if there exists an $n$-outcome measurement that never outputs the outcome `$k$' on the $k$-th quantum state. We describe sets of quantum states for which any subset of three states is antidistinguishable and use this to produce a two-player communication task that can be solved with $\\log d$ qubits, but requires one-way communication of at least $\\log (4/3) (d-1) - 1 \\approx 0.415 (d-1) - 1$ classical bits. The advantages of the approach are that the proof is simple and self-contained -- not needing, for example, to rely on hard"},"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":"1911.01927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-11-05T16:41:42Z","cross_cats_sorted":[],"title_canon_sha256":"da6fcb8f92f4a903b4505a39d797f1660ca5c9e4efbfcae2fadc34e536d50620","abstract_canon_sha256":"5a1f6fbb4e075977d813e52aec8d9e35f1cac50c4e600665b01672d3c6504d20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:50:08.707988Z","signature_b64":"PAP8ABGlCDdZQstyyUJBA2BeIqeev8ZP2aCyicTUDcog91G/nPdWlk/aFznrUXHhsGttpfqaSgc0G4pvDrzFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbedd7bb3f42d3e4e4cc6ae2850c8bcae070e4ab9409c319261d81811c04ce6f","last_reissued_at":"2026-07-05T00:50:08.707536Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:50:08.707536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple Communication Complexity Separation from Quantum State Antidistinguishability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jonathan Barrett, Vojt\\v{e}ch Havl\\'i\\v{c}ek","submitted_at":"2019-11-05T16:41:42Z","abstract_excerpt":"A set of $n$ pure quantum states is called antidististinguishable if there exists an $n$-outcome measurement that never outputs the outcome `$k$' on the $k$-th quantum state. We describe sets of quantum states for which any subset of three states is antidistinguishable and use this to produce a two-player communication task that can be solved with $\\log d$ qubits, but requires one-way communication of at least $\\log (4/3) (d-1) - 1 \\approx 0.415 (d-1) - 1$ classical bits. The advantages of the approach are that the proof is simple and self-contained -- not needing, for example, to rely on hard"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.01927","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/1911.01927/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":"1911.01927","created_at":"2026-07-05T00:50:08.707593+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.01927v1","created_at":"2026-07-05T00:50:08.707593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.01927","created_at":"2026-07-05T00:50:08.707593+00:00"},{"alias_kind":"pith_short_12","alias_value":"7PW5POZ7ILJ6","created_at":"2026-07-05T00:50:08.707593+00:00"},{"alias_kind":"pith_short_16","alias_value":"7PW5POZ7ILJ6JZGM","created_at":"2026-07-05T00:50:08.707593+00:00"},{"alias_kind":"pith_short_8","alias_value":"7PW5POZ7","created_at":"2026-07-05T00:50:08.707593+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.26605","citing_title":"All pure entangled states can lead to fully nonlocal correlations","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7PW5POZ7ILJ6JZGMNLRIKDELZL","json":"https://pith.science/pith/7PW5POZ7ILJ6JZGMNLRIKDELZL.json","graph_json":"https://pith.science/api/pith-number/7PW5POZ7ILJ6JZGMNLRIKDELZL/graph.json","events_json":"https://pith.science/api/pith-number/7PW5POZ7ILJ6JZGMNLRIKDELZL/events.json","paper":"https://pith.science/paper/7PW5POZ7"},"agent_actions":{"view_html":"https://pith.science/pith/7PW5POZ7ILJ6JZGMNLRIKDELZL","download_json":"https://pith.science/pith/7PW5POZ7ILJ6JZGMNLRIKDELZL.json","view_paper":"https://pith.science/paper/7PW5POZ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.01927&json=true","fetch_graph":"https://pith.science/api/pith-number/7PW5POZ7ILJ6JZGMNLRIKDELZL/graph.json","fetch_events":"https://pith.science/api/pith-number/7PW5POZ7ILJ6JZGMNLRIKDELZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7PW5POZ7ILJ6JZGMNLRIKDELZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7PW5POZ7ILJ6JZGMNLRIKDELZL/action/storage_attestation","attest_author":"https://pith.science/pith/7PW5POZ7ILJ6JZGMNLRIKDELZL/action/author_attestation","sign_citation":"https://pith.science/pith/7PW5POZ7ILJ6JZGMNLRIKDELZL/action/citation_signature","submit_replication":"https://pith.science/pith/7PW5POZ7ILJ6JZGMNLRIKDELZL/action/replication_record"}},"created_at":"2026-07-05T00:50:08.707593+00:00","updated_at":"2026-07-05T00:50:08.707593+00:00"}