
A standard approach to analyzing tunneling processes in various physical contexts is to use instanton or imaginary time path techniques. For systems in which the tunneling takes place in a time dependent setting, the standard methods are often applicable only in special cases, e.g. due to some additional symmetries. We consider a collection of time dependent tunneling problems to which the standard methods cannot be applied directly, and present an algorithm, based on the WKB approximation combined with complex time path methods, which can be used to calculate the relevant tunneling probabilities. This collection of problems contains, among others, the spontaneous nucleation of topological defects in an expanding universe, the production of particle - antiparticle pairs in a time dependent electric field, and false vacuum decay in field theory from a coherently oscillating initial state. To demonstrate the method, we present detailed calculations of the time dependent decay rates for the last two examples.
29 pages, with 9 Postscript figures, uses epsf.tex and fps.sty
High Energy Physics - Theory, High Energy Physics - Theory (hep-th), FOS: Physical sciences
High Energy Physics - Theory, High Energy Physics - Theory (hep-th), FOS: Physical sciences
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 59 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
