Pith. sign in

Quantum communication complexity advantage implies violation of a Bell inequality

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
abstract

We obtain a general connection between a quantum advantage in communication complexity and non-locality. We show that given any protocol offering a (sufficiently large) quantum advantage in communication complexity, there exists a way of obtaining measurement statistics which violate some Bell inequality. Our main tool is port-based teleportation. If the gap between quantum and classical communication complexity can grow arbitrarily large, the ratio of the quantum value to the classical value of the Bell quantity becomes unbounded with the increase in the number of inputs and outputs.

fields

quant-ph 2

years

2025 1 2024 1

verdicts

UNVERDICTED 2

representative citing papers

A resource theory of asynchronous quantum information processing

quant-ph · 2025-04-17 · unverdicted · novelty 7.0

Introduces resource theories for asynchronous port-based teleportation with free classical and quantum pre-processing, computes tight fidelity bounds for isotropic, graph, and symmetrized EPR states, and proves the strongest model equals any one-way protocol in surpassing the classical teleportation

citing papers explorer

Showing 2 of 2 citing papers.

  • A resource theory of asynchronous quantum information processing quant-ph · 2025-04-17 · unverdicted · none · ref 56 · internal anchor

    Introduces resource theories for asynchronous port-based teleportation with free classical and quantum pre-processing, computes tight fidelity bounds for isotropic, graph, and symmetrized EPR states, and proves the strongest model equals any one-way protocol in surpassing the classical teleportation

  • Multicopy quantum state teleportation with application to storage and retrieval of quantum programs quant-ph · 2024-09-16 · unverdicted · none · ref 24 · internal anchor

    Maximal success probability for multicopy teleportation without receiver correction is p(d,k)=k/[d(k-1+d)], attained by explicit protocol using group representation theory, with application to enhanced quantum program storage/retrieval.