{"paper":{"title":"Probabilistic Super Dense Coding","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A. K. Pati, P. Agrawal, P. Parashar","submitted_at":"2004-12-06T10:24:38Z","abstract_excerpt":"We explore the possibility of performing super dense coding with non-maximally entangled states as a resource. Using this we find that one can send two classical bits in a probabilistic manner by sending a qubit. We generalize our scheme to higher dimensions and show that one can communicate 2log_2 d classical bits by sending a d-dimensional quantum state with a certain probability of success. The success probability in super dense coding is related to the success probability of distinguishing non-orthogonal states. The optimal average success probabilities are explicitly calculated. We consid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0412039","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"}