We propose Dynamic, Hierarchical Entanglement Access Control (DH-EAC), a pure-quantum protocol for fair and anonymous allocation of scarce entanglement across wide-area quantum networks composed of many quantum LANs (QLANs). Prior Dicke-state-based pure-quantum MACs resolve contention by local measurements without classical signaling, but they mainly target a single QLAN under static conditions; extending them to wide-area, dynamic settings while avoiding post-selection reconciliation remains open. DH-EAC adopts a two-layer pure-quantum lottery: the outer layer selects winning QLANs and the inner layer selects winning nodes within each winning QLAN. A key design principle is that both the winning set and the per-QLAN quota are fixed by measurements alone, so the contention loop requires no classical round trip. The protocol thus aims to jointly satisfy anonymity (no node IDs revealed until decisions are fixed) and fairness (bias suppression under heterogeneous QLAN sizes). We also provide analytical models for success probability and latency under a standard i.i.d. loss model, and we evaluate DH-EAC against two baselines - single-layer Dicke within one QLAN and a classical GO-driven allocator - using a minimal, reproducible set of scenarios. Metrics include success probability, end-to-end latency, throughput, and Jain's fairness index. The results indicate that DH-EAC offers an implementable design point in the space of entanglement access control, balancing pure-quantum contention resolution, anonymity, and scalability for multi-QLAN networks.

翻译：我们提出了动态分层纠缠访问控制协议，这是一种纯量子协议，用于在由多个量子局域网组成的广域量子网络中公平且匿名地分配稀缺的纠缠资源。先前基于Dicke态的纯量子介质访问控制协议通过本地测量解决竞争，无需经典信令，但它们主要针对静态条件下的单个量子局域网；将其扩展到广域动态场景，同时避免后选择协调，仍然是一个开放问题。DH-EAC采用双层纯量子抽签机制：外层选择获胜的量子局域网，内层在每个获胜的量子局域网内选择获胜节点。一个关键设计原则是，获胜集合和每个量子局域网的配额仅通过测量确定，因此竞争环路无需经典往返通信。该协议旨在同时满足匿名性和公平性。我们还基于标准的独立同分布损耗模型，提供了成功概率和延迟的分析模型，并通过一组最小可复现的场景，将DH-EAC与两个基线方案进行了评估。评估指标包括成功概率、端到端延迟、吞吐量以及Jain公平性指数。结果表明，DH-EAC在纠缠访问控制的设计空间中提供了一个可实现的方案，在多量子局域网网络中平衡了纯量子竞争解决、匿名性和可扩展性。