扰动图实现单位运输效率,无环境噪声
Perturbed graphs achieve unit transport efficiency without environmental noise
摘要:
通过网络的激发的相干传输对应于图上的连续时间量子行走,并且系统的传输特性可以根据图和初始状态而完全不同。运输效率,即,在某个顶点处捕获的积分概率是转移过程的成功率的度量。已知PdR相干量子传输比观察到的激发传输效率低,例如,在生物系统中,有证据表明,环境噪音确实是至关重要的兴奋运输。与此不同的是,我们在这里解决了高度对称图上的纯相干传输,并分析表明,在没有环境噪声的情况下提高传输效率是可能的,即,只使用图的最小扰动。特别是,我们表明,添加额外的重量,一个或两个边缘,取决于初始状态是否本地化或在两个顶点状态的叠加,打破了固有的对称性的图形,可能足以实现单位运输效率。我们还简要讨论了获得零传输效率的条件,即,以免被困住
英文摘要:
Coherent transport of an excitation through a network corresponds to continuous-time quantum walk on a graph, and the transport properties of the system may be radically different depending on the graph and on the initial state. The transport efficiency, i.e., the integrated probability of trapping at a certain vertex, is a measure of the success rate of the transfer process. Purely coherent quantum transport is known to be less efficient than the observed excitation transport, e.g., in biological systems, and there is evidence that environmental noise is indeed crucial for excitation transport. At variance with this picture, we here address purely coherent transport on highly symmetric graphs, and show analytically that it is possible to enhance the transport efficiency without environmental noise, i.e., using only a minimal perturbation of the graph. In particular, we show that adding an extra weight to one or two edges, depending on whether the initial state is localized or in a superposition of two vertex states, breaks the inherent symmetries of the graph and may be sufficient to achieve unit transport efficiency. We also briefly discuss the conditions to obtain a null transport efficiency, i.e., to avoid trapping.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。