论文标题
Quantum Jackson网络的经典能力和等待时间的擦除能力
The Classical Capacity of Quantum Jackson Networks with Waiting Time-Dependent Erasures
论文作者
论文摘要
我们使用量子状态研究了经典交流的基本限制，这些量子状态在它们穿过队列网络时将它们横穿。我们考虑一个马尔可夫队排队的网络，称为杰克逊网络，具有单一来源或多个来源和一个目的地。 Qubits通过该网络在中间节点进行不可避免的缓冲传达。我们将每个节点建模为“队列通道”，其中Qubits在缓冲区中等待时，它们继续与环境相互作用并遭受等待时间的噪声。为了擦除擦除，我们首先获得了简单拓扑结构的显式经典能力表达式，例如串联队列通道和平行队列通道。使用这些作为构建块，我们表征了具有等待时间的擦除的一般量子杰克逊网络的经典能力。在整个过程中，我们研究了两种类型的量子网络，即（i）中继器辅助和（ii）无中继器。我们还获得了最佳的泵送率和路由概率，以最大程度地利用简单拓扑的容量。更广泛地说，我们的工作量化了延迟诱导的破坏性对量子网络对经典沟通的基本限制的影响。
We study the fundamental limits of classical communication using quantum states that decohere as they traverse through a network of queues. We consider a network of Markovian queues, known as a Jackson network, with a single source or multiple sources and a single destination. Qubits are communicated through this network with inevitable buffering at intermediate nodes. We model each node as a `queue-channel,' wherein as the qubits wait in buffer, they continue to interact with the environment and suffer a waiting time-dependent noise. Focusing on erasures, we first obtain explicit classical capacity expressions for simple topologies such as tandem queue-channel and parallel queue-channel. Using these as building blocks, we characterize the classical capacity of a general quantum Jackson network with waiting time-dependent erasures. Throughout, we study two types of quantum networks, namely, (i) Repeater-assisted and (ii) Repeater-less. We also obtain optimal pumping rates and routing probabilities to maximize capacity in simple topologies. More broadly, our work quantifies the impact of delay-induced decoherence on the fundamental limits of classical communication over quantum networks.
