pith. sign in

arxiv: 1502.07814 · v1 · pith:5PUHSAA3new · submitted 2015-02-27 · ❄️ cond-mat.mes-hall

How ubiquitous are dragon segments in quantum transmission?

classification ❄️ cond-mat.mes-hall
keywords dragonquantumgraphweightednanodevicetight-bindingtransmissionelectron
0
0 comments X
read the original abstract

Quantum dragon segments are nanodevices that have energy-independent total transmission of electrons. At the level of the single-band tight-binding model a nanodevice is viewed as a weighted undirected graph, with a vertex weight given by the on-site energy and the edge weight given by the tight-binding hopping parameter. A quantum dragon is a weighted undirected graph which when connected to idealized semi-infinite input and output leads, has the electron transmission probability ${\cal T}(E)$$=$$1$ for all electron energies $E$. The probability ${\cal T}(E)$ is obtained from the solution of the time-independent Schr\"odinger equation. A graph must have finely tuned tight-binding parameters in order to have ${\cal T}(E)$$=$$1$. This paper addresses classes of weighted graphs which can be tuned, by adjusting a small fraction of the total weights, to be a quantum dragon. We prove that with proper tuning any nanodevice can be a quantum dragon. Three prescriptions are presented to tune a weighted graph into a quantum dragon nanodevice. The implications of the prescriptions for physical nanodevices is discussed.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.