论文标题
连续时间量子步行的运输效率在图上
Transport efficiency of continuous-time quantum walks on graphs
论文作者
论文摘要
连续的量子步行描述了量子粒子（或激发）在图上不断演变的传播。因此，它提供了一个自然框架，用于建模运输过程，例如在光收获系统中。特别是，运输特性在很大程度上取决于初始状态和所研究图的特定特征。在本文中，我们解决了图形拓扑的作用，并以不同的规律性，对称性和连通性研究图形的传输特性。我们忽略了障碍和反谐波，并假设一个陷阱顶点对损失过程负责。特别是，对于每个图，我们通过分析确定具有最大运输效率的状态的子空间。我们的结果为环境辅助量子运输提供了一组基准，并表明连通性是运输效率的差指标。确实，我们观察到某些图的运输效率和连通性之间的一些特定相关性，但总的来说它们是不相关的。
Continuous-time quantum walk describes the propagation of a quantum particle (or an excitation) evolving continuously in time on a graph. As such, it provides a natural framework for modeling transport processes, e.g., in light-harvesting systems. In particular, the transport properties strongly depend on the initial state and on the specific features of the graph under investigation. In this paper, we address the role of graph topology, and investigate the transport properties of graphs with different regularity, symmetry, and connectivity. We neglect disorder and decoherence, and assume a single trap vertex accountable for the loss processes. In particular, for each graph, we analytically determine the subspace of states having maximum transport efficiency. Our results provide a set of benchmarks for environment-assisted quantum transport, and suggest that connectivity is a poor indicator for transport efficiency. Indeed, we observe some specific correlations between transport efficiency and connectivity for certain graphs, but in general they are uncorrelated.
