Constructs relation problems with zero entanglement-assisted quantum communication complexity but Omega(n) complexity without shared entanglement via parallel repetition of suitable non-local games, refuting quantum Newman's theorem analog.
On the power of geometrically-local classical and quantum circuits.arXiv preprint arXiv:2310.01540
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Non-maximally entangled states exhibit full nonlocality under simple Schmidt coefficient conditions, and all pure entangled states can be activated to full nonlocality with multiple copies.
citing papers explorer
-
Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement
Constructs relation problems with zero entanglement-assisted quantum communication complexity but Omega(n) complexity without shared entanglement via parallel repetition of suitable non-local games, refuting quantum Newman's theorem analog.
-
All pure entangled states can lead to fully nonlocal correlations
Non-maximally entangled states exhibit full nonlocality under simple Schmidt coefficient conditions, and all pure entangled states can be activated to full nonlocality with multiple copies.