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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Proceedings / annual Symposium on Foundations of Computer Science s. 1285 - 1295
Hlavní autori:	Jain, Rahul, Kundu, Srijita
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.02.2022
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!