A direct product theorem for quantum communication complexity with applications to device-independent QKD

We give a direct product theorem for the entanglement-assisted interactive quantum communication complexity in terms of the quantum partition bound for product distributions. The quantum partition or efficiency bound is a lower bound on communication complexity, a non-distributional version of which...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings / annual Symposium on Foundations of Computer Science S. 1285 - 1295
Hauptverfasser:	Jain, Rahul, Kundu, Srijita
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.02.2022
Schlagworte:	Boolean functions communication complexity Complexity theory Computer science device-independence direct product Games non-local games Protocols quantum cryptography Quantum entanglement quantum key distribution Qubit
ISSN:	2575-8454
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!