pith. sign in

arxiv: 0907.5557 · v1 · pith:LZL7LO6Xnew · submitted 2009-07-31 · 🪐 quant-ph

Average transmission probability of a random stack

classification 🪐 quant-ph
keywords transmissionprobabilityaveragerandomstackupperanalyticalapproximation
0
0 comments X
read the original abstract

The transmission through a stack of identical slabs that are separated by gaps with random widths is usually treated by calculating the average of the logarithm of the transmission probability. We show how to calculate the average of the transmission probability itself with the aid of a recurrence relation and derive analytical upper and lower bounds. The upper bound, when used as an approximation for the transmission probability, is unreasonably good and we conjecture that it is asymptotically exact.

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.