aiqbench analysis
This research establishes finite-blocklength bounds for quantum-state oblivious transfer over erasure channels, demonstrating that malicious and honest-but-curious adversaries face identical capacity limits under information-theoretic security. By combining interactive hashing with specific qubit distribution strategies, the study ensures that erasures conceal entire inputs even when they are entangled with external references. These findings advance the theoretical foundations of secure quantum communication protocols in noisy environments.
Quantum-State Oblivious Transfer over Quantum Erasure Channels
arXiv:2610.04667v1 Announce Type: new Abstract: We study quantum-state oblivious transfer over the quantum erasure channel under information-theoretic security guarantees. Specifically, Alice holds two quantum systems, Bob wishes to recover one of them, and the parties have access to independent channel uses and authenticated public classical communication, with no initial shared entanglement. We consider both honest-but-curious and malicious behavior. We establish finite-blocklength converse and achievability bounds, which match in the honest-but-curious setting. The malicious setting construction combines interactive hashing with tests of whether Bob received selected channel outputs, and distributes each input across several qubits so that erasures conceal an entire input from a dishonest receiver, even when the inputs are entangled with an external reference. We also derive fixed-error asymptotic expansions and show that both malicious and honest-but-curious settings have the same capacity.
Abstract:We study quantum-state oblivious transfer over the quantum erasure channel under information-theoretic security guarantees. Specifically, Alice holds two quantum systems, Bob wishes to recover one of them, and the parties have access to independent channel uses and authenticated public classical communication, with no initial shared entanglement. We consider both honest-but-curious and malicious behavior. We establish finite-blocklength converse and achievability bounds, which match in the honest-but-curious setting. The malicious setting construction combines interactive hashing with tests of whether Bob received selected channel outputs, and distributes each input across several qubits so that erasures conceal an entire input from a dishonest receiver, even when the inputs are entangled with an external reference. We also derive fixed-error asymptotic expansions and show that both malicious and honest-but-curious settings have the same capacity.
Quantum Physics (quant-ph); Information Theory (cs.IT)
arXiv:2610.04667 [quant-ph]
(or arXiv:2610.04667v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2610.04667 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 · 225 words
Related coverage
QuMIMO Diversity over Discrete-Variable Free-Space Optical Channels
arXiv · Aug 17, 2026

0 + 0 > 0: AI Helps Prove an Impossible Quantum Paradox in Data Security
ixbt.com · Sep 10, 2026

Hu and Colleagues Present SurfNet for Fault-Tolerant Quantum Communication Networks
Quantum Zeitgeist · Jun 16, 2026

News
Quantum Computing Report · Jun 7, 2026