Search
Abstract
Communication complexity is a fundamental aspect of information science, concerned with the amount of communication required to solve a problem distributed among multiple parties. The standard quantification of one-way communication complexity relies on the minimal dimension of the communicated systems. In this paper, we measure the communication complexity of a task by the minimal distinguishability required to accomplish it, while leaving the dimension of the communicated systems unconstrained. Distinguishability is defined as the maximum probability of correctly guessing the sender's input from the message, quantifying the message's distinctiveness relative to the sender's input. This measure becomes especially relevant when maintaining the confidentiality of the sender's input is essential. After establishing the generic framework, we focus on three relevant families of communication complexity tasks—the random access codes, equality problems defined by graphs, and the pair-distinguishability tasks. We derive general lower bounds on the minimal classical distinguishability as a function of the success metric of these tasks. We demonstrate that quantum communication outperforms classical communication presenting explicit protocols and utilizing semidefinite programming methods. In particular, we demonstrate unbounded quantum advantage for random access codes and Hadamard graph-based equality problems. Specifically, we show that the classical-to-quantum ratio of minimal distinguishability required to achieve the same success metric escalates polynomially and exponentially with the complexity of these tasks, reaching arbitrarily large values.
Citations
-
0
CrossRef
-
0
Web of Science
-
0
Scopus
Cite as
Full text
- Publication version
- Accepted or Published Version
- DOI:
- Digital Object Identifier (open in new tab) 10.1103/PhysRewResearch.6.043269
- License
-
open in new tab
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach
- Published in:
-
Physical Review Research
no. 6,
ISSN: - Language:
- English
- Publication year:
- 2024
- Bibliographic description:
- Chaturvedi A., Satyaki M., Saha D.: Unbounded quantum advantage in communication complexity measured by distinguishability// Physical Review Research -,iss. 043269 (2024), s.1-13
- DOI:
- Digital Object Identifier (open in new tab) 10.1103/physrewresearch.6.043269
- Sources of funding:
-
- Free publication
- Verified by:
- Gdańsk University of Technology
seen 1 times
Recommended for you
Increased Certification of Semi-device Independent Random Numbers using Many Inputs and More Postprocessing
- P. A. Mironowicz,
- A. Tavakoli,
- A. Hameedi
- + 3 authors
No Quantum Realization of Extremal No-Signaling Boxes
- R. Ramanathan,
- J. Tuziemski,
- M. Horodecki
- + 1 authors
Complementarity between entanglement-assisted and quantum distributed random access code
- A. Hameedi,
- D. Saha,
- P. A. Mironowicz
- + 2 authors