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.
Classical and quantum partition bound and detector inefficiency
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
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.