Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userTunnelling times: An elementary introduction
86
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In this paper we examine critically and in detail some existing definitions for the tunnelling times, namely: the phase-time; the centroid-based times; the Buttiker and Landauer times; the Larmor times; the complex (path-integral and Bohm) times; the dwell time, and finally the generalized (Olkhovsky and Recami) dwell time, by adding also some numerical evaluations. Then, we pass to examine the equivalence between quantum tunnelling and photon tunnelling (evanescent waves propagation), with particular attention to tunnelling with Superluminal group-velocities (Hartman effect). At last, in an Appendix, we add a bird-eye view of all the experimental sectors of physics in which Superluminal motions seem to appear.
rate research
Read More
We describe some basic tools in the spectral theory of Schrodinger operator on metric graphs (also known as quantum graph) by studying in detail some basic examples. The exposition is kept as elementary and accessible as possible. In the later sections we apply these tools to prove some results on the count of zeros of the eigenfunctions of quantum graphs.
This is an expository introduction to simplicial sets and simplicial homotopy theory with particular focus on relating the combinatorial aspects of the theory to their geometric/topological origins. It is intended to be accessible to students familiar with just the fundamentals of algebraic topology.
We analyse a little known aspect of the Klein paradox. A Klein-Gordon boson appears to be able to cross a supercritical rectangular barrier without being reflected, while spending there a negative amount of time. The transmission mechanism is demonstrably acausal, yet an attempt to construct the corresponding causal solution of the Klein-Gordon equation fails. We relate the causal solution to a divergent multiple-reflections series, and show that the problem is remedied for a smooth barrier, where pair production at the energy equal to a half of the barriers height is enhanced yet remains finite.
In a recent review paper [{em Phys. Reports} {bf 214} (1992) 339] we proposed, within conventional quantum mechanics, new definitions for the sub-barrier tunnelling and reflection times. Aims of the present paper are: (i) presenting and analysing the results of various numerical calculations (based on our equations) on the penetration and return times $<tau_{, rm Pen}>$, $<tau_{, rm Ret}>$, during tunnelling {em inside} a rectangular potential barrier, for various penetration depths $x_{rm f}$; (ii) putting forth and discussing suitable definitions, besides of the mean values, also of the {em variances} (or dispersions) ${rm D} , {tau_{rm T}}$ and ${rm D} , {tau_{, rm R}}$ for the time durations of transmission and reflection processes; (iii) mentioning, moreover, that our definition $<tau_{rm T}>$ for the average transmission time results to constitute an {em improvement} of the ordinary dwell--time ${ove tau}^{rm Dw}$ formula: (iv) commenting, at last, on the basis of our {em new} numerical results, upon some recent criticism by C.R.Leavens. We stress that our numerical evaluations {em confirm} that our approach implied, and implies, the existence of the {em Hartman effect}: an effect that in these days (due to the theoretical connections between tunnelling and evanescent--wave propagation) is receiving ---at Cologne, Berkeley, Florence and Vienna--- indirect, but quite interesting, experimental verifications. Eventually, we briefly analyze some other definitions of tunnelling times.
Boson-sampling is a simplified model for quantum computing that may hold the key to implementing the first ever post-classical quantum computer. Boson-sampling is a non-universal quantum computer that is significantly more straightforward to build than any universal quantum computer proposed so far. We begin this chapter by motivating boson-sampling and discussing the history of linear optics quantum computing. We then summarize the boson-sampling formalism, discuss what a sampling problem is, explain why boson-sampling is easier than linear optics quantum computing, and discuss the Extended Church-Turing thesis. Next, sampling with other classes of quantum optical states is analyzed. Finally, we discuss the feasibility of building a boson-sampling device using existing technology.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
