Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userNarrow peaks of full transmission in simple quantum graphs
118
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic 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.
rate research
Read More
The control of the quantum transport is an issue of current interest for the construction of new devices. In this work, we investigate this possibility in the realm of quantum graphs. The study allows the identification of two distinct periodic quantum effects which are related to quantum complexity, one being the identification of transport inefficiency, and the other the presence of peaks of full transmission inside regions of suppression of transport in some elementary arrangements of graphs. Motivated by the power of quantum graphs, we elaborate on the construction of simple devices, based on microwave and optical fibers networks, and also on quantum dots, nanowires and nanorings. The elementary devices can be used to construct composed structures with important quantum properties, which may be used to manipulate the quantum transport.
We consider the Dirac equation on periodic networks (quantum graphs). The self-adjoint quasi periodic boundary conditions are derived. The secular equation allowing us to find the energy spectrum of the Dirac particles on periodic quantum graphs is obtained. Band spectra of the periodic quantum graphs of different topologies are calculated. Universality of the probability to be in the spectrum for certain graph topologies is observed.
We consider quantum graphs with transparent branching points. To design such networks, the concept of transparent boundary conditions is applied to the derivation of the vertex boundary conditions for the linear Schrodinger equation on metric graphs. This allows to derive simple constraints, which use equivalent usual Kirchhoff-type boundary conditions at the vertex to the transparent ones. The approach is applied to quantum star and tree graphs. However, extension to more complicated graph topologies is rather straight forward.
We discuss some basic aspects of quantum fields on star graphs, focusing on boundary conditions, symmetries and scale invariance in particular. We investigate the four-fermion bulk interaction in detail. Using bosonization and vertex operators, we solve the model exactly for scale invariant boundary conditions, formulated in terms of the fermion current and without dissipation. The critical points are classified and determined explicitly. These results are applied for deriving the charge and spin transport, which have interesting physical features.
We propose a quantum algorithm in an embedding ion-trap quantum simulator for the efficient computation of N-qubit entanglement monotones without the necessity of full tomography. Moreover, we discuss possible realistic scenarios and study the associated decoherence mechanisms.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
