Papers
Topics
Authors
Recent
Search
2000 character limit reached

Narrow peaks of full transmission in simple quantum graphs

Published 1 Jul 2019 in quant-ph, cond-mat.mes-hall, math-ph, and math.MP | (1907.00656v3)

Abstract: This work deals with quantum graphs, focusing on the transmission properties they engender. We first select two simple diamond graphs, and two hexagonal graphs in which the vertices are all of degree 3, and investigate their transmission coefficients. In particular, we identified regions in which the transmission is fully suppressed. We also considered the transmission coefficients of some series and parallel arrangements of the two basic graphs, with the vertices still preserving the degree 3 condition, and then identified specific series and parallel compositions that allow for windows of no transmission. Inside some of these windows, we found very narrow peaks of full transmission, which are consequences of constructive quantum interference. Possibilities of practical use as the experimental construction of devices of current interest to control and manipulate quantum transmission are also discussed.

Authors (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.