{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PIFFJNIYB2G47XACVJHJQ64ORP","short_pith_number":"pith:PIFFJNIY","schema_version":"1.0","canonical_sha256":"7a0a54b5180e8dcfdc02aa4e987b8e8bf172d61b2ed50f06667024049aaa935a","source":{"kind":"arxiv","id":"1110.5944","version":2},"attestation_state":"computed","paper":{"title":"Communication cost of classically simulating a quantum channel with subsequent rank-1 projective measurement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math-ph","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"Alberto Montina","submitted_at":"2011-10-26T23:09:03Z","abstract_excerpt":"A process of preparation, transmission and subsequent projective measurement of a qubit can be simulated by a classical model with only two bits of communication and some amount of shared randomness. However no model for n qubits with a finite amount of classical communication is known at present. A lower bound for the communication cost can provide useful hints for a generalization. It is known for example that the amount of communication must be greater than c 2^n, where c~0.01. The proof uses a quite elaborate theorem of communication complexity. Using a mathematical conjecture known as the"},"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":"1110.5944","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-10-26T23:09:03Z","cross_cats_sorted":["cs.IT","math-ph","math.IT","math.MP"],"title_canon_sha256":"4f48b3f72d73dbced25c915efdf78913daa28278c1c6eda7114b76b8ad1f1986","abstract_canon_sha256":"982b647e5904d71f9767212852a15e6f3ffa96e1a17f38d4e2ae6864cfe31fef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:38.149745Z","signature_b64":"p0MSt/u5s72JmU2V3BN+rO/kdC444tU8LjWley49+D2LVpfgr1vPYI7a2448MWh7WO+lYKgDSeM9YeFVHGSsCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a0a54b5180e8dcfdc02aa4e987b8e8bf172d61b2ed50f06667024049aaa935a","last_reissued_at":"2026-05-18T04:05:38.149273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:38.149273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication cost of classically simulating a quantum channel with subsequent rank-1 projective measurement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math-ph","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"Alberto Montina","submitted_at":"2011-10-26T23:09:03Z","abstract_excerpt":"A process of preparation, transmission and subsequent projective measurement of a qubit can be simulated by a classical model with only two bits of communication and some amount of shared randomness. However no model for n qubits with a finite amount of classical communication is known at present. A lower bound for the communication cost can provide useful hints for a generalization. It is known for example that the amount of communication must be greater than c 2^n, where c~0.01. The proof uses a quite elaborate theorem of communication complexity. Using a mathematical conjecture known as the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5944","kind":"arxiv","version":2},"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":"1110.5944","created_at":"2026-05-18T04:05:38.149337+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.5944v2","created_at":"2026-05-18T04:05:38.149337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5944","created_at":"2026-05-18T04:05:38.149337+00:00"},{"alias_kind":"pith_short_12","alias_value":"PIFFJNIYB2G4","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PIFFJNIYB2G47XAC","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PIFFJNIY","created_at":"2026-05-18T12:26:39.201973+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/PIFFJNIYB2G47XACVJHJQ64ORP","json":"https://pith.science/pith/PIFFJNIYB2G47XACVJHJQ64ORP.json","graph_json":"https://pith.science/api/pith-number/PIFFJNIYB2G47XACVJHJQ64ORP/graph.json","events_json":"https://pith.science/api/pith-number/PIFFJNIYB2G47XACVJHJQ64ORP/events.json","paper":"https://pith.science/paper/PIFFJNIY"},"agent_actions":{"view_html":"https://pith.science/pith/PIFFJNIYB2G47XACVJHJQ64ORP","download_json":"https://pith.science/pith/PIFFJNIYB2G47XACVJHJQ64ORP.json","view_paper":"https://pith.science/paper/PIFFJNIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.5944&json=true","fetch_graph":"https://pith.science/api/pith-number/PIFFJNIYB2G47XACVJHJQ64ORP/graph.json","fetch_events":"https://pith.science/api/pith-number/PIFFJNIYB2G47XACVJHJQ64ORP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PIFFJNIYB2G47XACVJHJQ64ORP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PIFFJNIYB2G47XACVJHJQ64ORP/action/storage_attestation","attest_author":"https://pith.science/pith/PIFFJNIYB2G47XACVJHJQ64ORP/action/author_attestation","sign_citation":"https://pith.science/pith/PIFFJNIYB2G47XACVJHJQ64ORP/action/citation_signature","submit_replication":"https://pith.science/pith/PIFFJNIYB2G47XACVJHJQ64ORP/action/replication_record"}},"created_at":"2026-05-18T04:05:38.149337+00:00","updated_at":"2026-05-18T04:05:38.149337+00:00"}