渗流分层小世界网络中相干输运的连通性-干扰竞争
Connectivity--Interference Competition in Coherent Transport on Percolated Hierarchical Small-World Networks
浏览论文内容
中文总结 AI 辅助
该研究针对渗流分层小世界网络，发现相干量子输运存在过连通性惩罚，源于捷径扩散与层内干扰的竞争，为无序光子及量子网络的相干输运设计提供了准则。
中文摘要 AI 辅助
增加链路通常会通过增加可用路径数量来提升经典输运性能，但本文表明相干量子输运可呈现相反行为。通过对渗流分层小世界网络上的连续时间量子行走进行研究，发现存在相干过连通性惩罚：根到边界的输运在中间键概率下达到最大值，当网络趋近完全连通时会下降。该效应由最终层极限概率χ_N和惩罚项P_Q=1-χ_N(p=1)/max_pχ_N(p)量化，后者衡量架构完全连通造成的性能损失。最优结果源于捷径辅助扩散与干扰诱导的层内循环之间的竞争。光谱分析显示，键稀释会产生基序诱导的简并态，并重组连接根与最外层的本征态。与退相和经典输运的对比表明，非单调特性并非纯几何渗流效应，而是依赖相干架构的现象。这些结果为无序光子及量子网络架构中的相干输运提供了设计准则。
英文摘要
Adding links generally improves classical transport by increasing the number of available paths. We show that coherent quantum transport can display the opposite behavior. Using continuous-time quantum walks on a percolated hierarchical small-world network, we identify a coherent overconnectivity penalty: root-to-boundary transport is maximized at intermediate bond probability and decreases as the network approaches full connectivity. The effect is quantified by the final-layer limiting probability $χ_N$ and by the penalty $P_Q=1-χ_N(p=1)/\max_pχ_N(p)$, which measures the loss caused by making the architecture fully connected. The optimum results from a competition between shortcut-assisted spreading and interference-induced intra-layer recirculation. Spectral analysis shows that bond dilution creates motif-induced degeneracies and reorganizes the eigenstates connecting the root to the outermost layer. A comparison with dephased and classical transport shows that the non-monotonic landscape is not a purely geometrical percolation effect, but a coherent architecture-dependent phenomenon. These results provide a design principle for coherent transport in disordered photonic and quantum-network architectures.
