Full Network Nonlocality Based Security In Quantum Key Distribution
Kaushiki Mukherjee

TL;DR
This paper demonstrates how full network nonlocality can enhance the security of quantum key distribution protocols, outperforming traditional Bell nonlocality-based methods by reducing quantum bit error rates.
Contribution
It introduces a four-partite network-based QKD protocol utilizing full network nonlocality and compares its security advantages over Bell-CHSH based protocols.
Findings
Full network nonlocality improves security over Bell nonlocality.
Quantum bit error rate can be reduced below 13.7% using full network nonlocality.
The proposed protocol is more secure than Bell-CHSH based QKD.
Abstract
In the last decade research of quantum nonlocality has moved beyond the regime of standard Bell nonlocality to consider network-based experimental set-ups involving multiple independent sources. Notion of full network nonlocality has emerged as some truly network phenomena that cannot be realized in traditional Bell experiments. Present work manifests utility of such form of truly network non-classicality in designing a four partite network-based entanglement assisted quantum key distribution protocol. To be more precise, security of the protocol relies upon full network nonlocality detection via violation of some suitable trilocal inequality. Based on the quantum bit error rate and violation of trilocal inequality, arbitrary two qubit entangled states are characterized in accordance with their utility in successfully executing the protocol. Intuitively, owing to connected structure of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Mechanics and Applications · Advanced Statistical Modeling Techniques
