Multipartite Hardy paradox unlocks device-independent key sharing
Ranendu Adhikary, Mriganka Mandal

TL;DR
This paper presents a novel device-independent quantum key distribution protocol using the multipartite Hardy paradox, enabling secure, flexible, and high-rate key sharing among multiple parties based on measurement settings.
Contribution
It introduces a settings-based multipartite key distribution method certified by Hardy paradox violation, allowing pairwise keys with higher rates than the N-party key.
Findings
Achieves positive key rate from measurement settings.
Enables any two parties to generate a secret key with higher rate than the N-party key.
Establishes a new paradigm for device-independent conference key agreement.
Abstract
We introduce a device-independent quantum key distribution protocol for N parties, using the multipartite Hardy paradox to certify genuine multipartite nonlocality. Unlike traditional multipartite protocols that extract the key from measurement outcomes, our approach generates the shared secret key directly from the parties' choices of measurement settings. This settings-based method, certified by the maximal violation of the multipartite Hardy paradox, achieves a positive key rate and offers a fresh perspective on secure key distribution. Notably, the Hardy paradox enables any two parties to create a secret key with a rate much higher than the N-party key, due to more robust pairwise correlations. This unique capability, inherent to the multipartite Hardy paradox, allows for tailored key distribution within the group, enhancing flexibility. Our work establishes a new paradigm for…
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.
