arXiv Analytics

Sign in

arXiv:2101.05250 [quant-ph]AbstractReferencesReviewsResources

Average scattering entropy of quantum graphs

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

Published 2021-01-13Version 1

The scattering amplitude in simple quantum graphs is a well-known process which may be highly complex. In this work, motivated by the Shannon entropy, we propose a methodology that associates to a graph a scattering entropy, which we call the average scattering entropy. It is defined by taking into account the period of the scattering amplitude which we calculate using the Green's function procedure. We first describe the methodology on general grounds, and then exemplify our findings considering several distinct groups of graphs. We go on and investigate other possibilities, one that contains groups of graphs with the same number of vertices, with the same degree, and the same number of edges, with the same length, but with distinct topologies and with different entropies. And the other, which contains graphs of the fishbone type, where the scattering entropy depends on the boundary conditions on the vertices of degree $1$, with the corresponding values decreasing and saturating very rapidly, as we increase the number of elementary structures in the graphs.

Related articles: Most relevant | Search more
arXiv:1907.00656 [quant-ph] (Published 2019-07-01)
Braess paradox and quantum interference in simple quantum graphs
arXiv:1107.3366 [quant-ph] (Published 2011-07-18)
A Critical Discussion About The Methodology Of Quantum Theory
arXiv:1603.03996 [quant-ph] (Published 2016-03-13)
The methodology of composite quantum gates