arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.09106quant-phmath-phmath.MP
收藏

随机化量子图中的量子输运

Quantum transport in randomized quantum graphs

Alison A. Silva, D. Bazeia, Fabiano M. Andrade

AI总结:

本文研究开放量子图中的量子输运,通过引入随机化量子图(RQG)透射系数及计算程序,发现顶点连接移除显著影响输运且存在传输完全抑制区域。

摘要:

本工作研究开放量子图中的量子输运。我们考虑具有 $n$ 个顶点的完全图,移除一条边并连接到两条引线,以表示入口和出口通道,据此计算透射系数。我们考虑多个顶点是否相连的情况,并将其与随机化参数 $p$ 关联。为实现计算,我们引入了随机化量子图(RQG)的透射系数,并提出了一种获取该透射系数精确及近似但可靠结果的程序。主要结果表明,顶点对间连接的移除显著影响输运,同时也表明存在一个传输被完全抑制的区域,即使边移除数量并不太少。

英文摘要:

This work deals with quantum transport in open quantum graphs. We consider the case of complete graphs on $n$ vertices with an edge removed and attached to two leads, to represent the entrance and exit channels, from where we calculate the transmission coefficient. We include the possibility of several vertices being connected or not and associate it with a randomization parameter $p$. To implement the calculation, we had to introduce the transmission coefficient of randomized quantum graphs (RQG), and we also proposed a procedure to obtain the exact and approximate but reliable results for such transmission coefficients. The main results show that the transport is importantly affected by the removal of connections between pairs of vertices, but they also indicate the presence of a region where the transmission is fully suppressed, even when the number of edge removal is not too small.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑