发表机构
The University of Texas at Arlington（阿灵顿得克萨斯大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
研究量子擦除信道上信息论安全的量子态不经意传输，提出有限块长界并证明恶意与诚实但好奇情形容量相同。
AI 中文摘要
我们研究了在信息论安全保证下，量子擦除信道上的量子态不经意传输。具体而言，Alice持有两个量子系统，Bob希望恢复其中一个，双方可使用独立的信道使用和认证的公开经典通信，且初始不共享纠缠。我们同时考虑了诚实但好奇和恶意行为。我们建立了有限块长逆界和可达界，并在诚实但好奇情形下二者匹配。恶意情形下的构造结合了交互式哈希与对Bob是否收到选定信道输出的测试，并将每个输入分布在多个量子比特上，使得擦除能对不诚实接收者隐藏整个输入，即使输入与外部参考纠缠。我们还推导了固定误差渐近展开，并表明恶意和诚实但好奇情形具有相同的容量。
英文摘要
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.
