Quantum-State Oblivious Transfer over Quantum Erasure Channels
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.
Related
- Joint Source-Channel Coding of Gaussian Sources over Block Erasure Channels: Nonasymptotic Bounds and Channel-Uniform Normal Approximations
- Rateless Nested Lattice Codes for Secure Cooperative V2X Broadcast over Fading and Erasure Channels
- Pretty good quantum state transfer via transcendental edge weights
- Quantum State Routing and Perfect State Transfer on Signed Graphs under Environmental Noise
- Controlling quantum state transfer in rooted products
BibTeX
@misc{chou2026quantumstate,
title = {{Quantum-State Oblivious Transfer over Quantum Erasure Channels}},
author = {Remi A. Chou},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.04667},
eprint = {2610.04667},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.04667},
}
RIS
TY - UNPB
TI - Quantum-State Oblivious Transfer over Quantum Erasure Channels
AU - Remi A. Chou
PY - 2026
DA - 2026/10/03
PB - arXiv
DO - 10.48550/arxiv.2610.04667
UR - https://arxiv.org/abs/2610.04667
AB - 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.
ER -