发表机构
Freie Universität Berlin; Scuola Normale Superiore; Istituto Nanoscienze-CNR（柏林自由大学; 比萨高等师范学院; 意大利国家研究委员会纳米科学研究所）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
该研究提出一种量子路由原语，通过两次调用和隐藏顺序机制，使Alice能检测提供商Bob是否干扰请求，以非零概率防目的地读取攻击。
AI 中文摘要
量子网络将依赖中间节点来分发纠缠，但同一节点可能获知哪些用户正在被连接。我们引入了一种最小化的两次调用路由原语，其中用户Alice与多个客户端之一建立纠缠链路，同时测试提供商Bob是否干扰了相干编码的请求。该构造借鉴了量子私有查询的隐藏顺序机制：一次调用包含直接请求，另一次调用包含期望地址和空地址的相干叠加，而Alice对其顺序保密。由选定客户端持有的私有匹配量子比特在有利的贝尔测量结果后恢复相干测试状态，使得Alice无需Bob的任何进一步操作即可测试返回的查询。该声明有意保持有限。该协议表明路由请求可以携带物理作弊测试，并以非零概率检测到明确的目的地读取攻击。它尚未提供定量的信息干扰权衡、可组合安全性或针对任意攻击的未测量输出的认证。我们还刻画了精确的完美通过极限，在该极限下，Bob的残余状态在私有匹配状态上平均后与目的地无关。
英文摘要
Quantum networks will rely on intermediate nodes to distribute entanglement, but the same nodes may learn which users are being connected. We introduce a minimal two-call routing primitive in which a user, Alice, establishes an entangled link with one of several clients while testing whether the provider, Bob, has disturbed a coherently encoded request. The construction adapts the hidden-order mechanism of quantum private queries: one call contains a direct request, the other a coherent superposition of the desired and null addresses, and Alice keeps their order secret. A private matching qubit held by the selected client restores the coherent test state after a favorable Bell-measurement outcome, so that Alice can test the returned query without any further operation by Bob. The claim is deliberately limited. The protocol shows that a routing request can carry a physical cheating test, and it detects an explicit destination-reading attack with nonzero probability. It does not yet provide a quantitative information-disturbance tradeoff, composable security, or certification of an unmeasured output against arbitrary attacks. We also characterize the exact perfect-pass limit, in which Bob's residual state, averaged over the private matching states, is independent of the destination.
