{"paper":{"title":"New one shot quantum protocols with application to communication complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Ala Shayeghi, Anurag Anshu, Penghui Yao, Priyanka Mukhopadhyay, Rahul Jain","submitted_at":"2014-04-04T20:45:09Z","abstract_excerpt":"In this paper we present the following quantum compression protocol:\n  P : Let $\\rho,\\sigma$ be quantum states such that $S(\\rho || \\sigma) = \\text{Tr} (\\rho \\log \\rho - \\rho \\log \\sigma)$, the relative entropy between $\\rho$ and $\\sigma$, is finite. Alice gets to know the eigen-decomposition of $\\rho$. Bob gets to know the eigen-decomposition of $\\sigma$. Both Alice and Bob know $S(\\rho || \\sigma)$ and an error parameter $\\epsilon$. Alice and Bob use shared entanglement and after communication of $\\mathcal{O}((S(\\rho || \\sigma)+1)/\\epsilon^4)$ bits from Alice to Bob, Bob ends up with a quantu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1366","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":""},"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"}