On relating one-way classical and quantum communication complexities
Naresh Goud Boddu, Rahul Jain, Han-Hsuan Lin

TL;DR
This paper investigates the relationship between one-way classical and quantum communication complexities, providing bounds and comparisons under various distributional and function conditions.
Contribution
It establishes new bounds relating classical and quantum one-way communication complexities for partial functions with different input distributions.
Findings
Classical complexity bounded by quantum complexity for product distributions.
Quantum to classical complexity relation for non-product distributions with binary outputs.
Introduces bounds involving the complexity measure CS(f) for non-product distributions.
Abstract
Communication complexity is the amount of communication needed to compute a function when the function inputs are distributed over multiple parties. In its simplest form, one-way communication complexity, Alice and Bob compute a function , where is given to Alice and is given to Bob, and only one message from Alice to Bob is allowed. A fundamental question in quantum information is the relationship between one-way quantum and classical communication complexities, i.e., how much shorter the message can be if Alice is sending a quantum state instead of bit strings? We make some progress towards this question with the following results. Let be a partial function and be a distribution with support contained in . Denote . Let …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Computability, Logic, AI Algorithms
