aiqbench analysis
This research advances one-sided device-independent quantum key distribution by introducing new mathematical tools to calculate secure key rates under asymmetric trust models. By comparing extensions of the NPA hierarchy and applying the Generalized Entropy Accumulation Theorem, the study reveals that characterizing a specific party significantly impacts performance without following a universal ordering. These findings provide a practical benchmark for optimizing QKD protocols against general attacks with arbitrary device memory.
Computing key rates for one-sided device-independent quantum key distribution
arXiv:2608.25915v1 Announce Type: new Abstract: The defining feature of one-sided device-independent quantum key distribution is its asymmetric trust model in which only one party is characterized. This scenario sets an interesting middle ground between high key rates achievable by characterizing devices and the security of full device-independence. Here, we provide new tools, methods, and benchmarks for calculating key rates in this setting. To achieve this, we develop and compare two extensions of the NPA hierarchy and derive finite-size security bounds against general attacks with arbitrary device memory. The latter is based on the Generalized Entropy Accumulation Theorem. We then investigate the performance of various protocols: the BB84 protocol both with and without losses, a qutrit mutually unbiased bases protocol, and protocols based on Bell inequalties such as CHSH and $I_{3322}$. We find that the choice of which party is characterized can strongly affects the key rate, surprisingly without a universal ordering. Our work thus offers a general toolbox for calculating key rates for one-sided device-independent QKD protocols.
Abstract:The defining feature of one-sided device-independent quantum key distribution is its asymmetric trust model in which only one party is characterized. This scenario sets an interesting middle ground between high key rates achievable by characterizing devices and the security of full device-independence. Here, we provide new tools, methods, and benchmarks for calculating key rates in this setting. To achieve this, we develop and compare two extensions of the NPA hierarchy and derive finite-size security bounds against general attacks with arbitrary device memory. The latter is based on the Generalized Entropy Accumulation Theorem. We then investigate the performance of various protocols: the BB84 protocol both with and without losses, a qutrit mutually unbiased bases protocol, and protocols based on Bell inequalties such as CHSH and $I_{3322}$. We find that the choice of which party is characterized can strongly affects the key rate, surprisingly without a universal ordering. Our work thus offers a general toolbox for calculating key rates for one-sided device-independent QKD protocols.
Quantum Physics (quant-ph); Mathematical Physics (math-ph); Optimization and Control (math.OC)
arXiv:2608.25915 [quant-ph]
(or arXiv:2608.25915v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2608.25915 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 263 words
Related coverage

Lattice-Based Cryptography Explained
Quantum Zeitgeist · Aug 15, 2026

News
Quantum Computing Report · Jun 7, 2026

AI and Quantum Computing Briefing
livetradingnews.com · Aug 4, 2026

Chris Ballance, The British Quantum Entrepreneur Who Put Ion Traps On A Chip
Quantum Zeitgeist · Aug 5, 2026