EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Unbounded quantum advantage in communication complexity measured by distinguishability

Satyaki Manna, Anubhav Chaturvedi, Debashis Saha

Physical Review Research · 12.12.2024 · 6 (4)

DOI: 10.1103/physrevresearch.6.043269 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Physical Review Research, online erschienen am 12.12.2024. Verfasst von Satyaki Manna und 2 weiteren Autor:innen. Die Arbeit wurde bisher 12-mal zitiert (Crossref) und nennt 36 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Narodowe Centrum Nauki.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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 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 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. Published by the American Physical Society 2024

Förderung

  • Narodowe Centrum Nauki

Zitieren

APA

Manna, S., Chaturvedi, A., & Saha, D. (2024). Unbounded quantum advantage in communication complexity measured by distinguishability. Physical Review Research, 6(4). https://doi.org/10.1103/physrevresearch.6.043269

Vancouver

Manna S, Chaturvedi A, Saha D. Unbounded quantum advantage in communication complexity measured by distinguishability. Physical Review Research. 2024;6(4). doi:10.1103/physrevresearch.6.043269

BibTeX
@article{Manna2024,
  author = {Manna, Satyaki and Chaturvedi, Anubhav and Saha, Debashis},
  title = {Unbounded quantum advantage in communication complexity measured by distinguishability},
  journal = {Physical Review Research},
  year = {2024},
  volume = {6},
  number = {4},
  doi = {10.1103/physrevresearch.6.043269}
}
Kostenlos starten →