No Arabic abstract
We apply the framework developed in the preceding paper in this series (Smilansky 2017 J. Phys. A: Math. Theor. 50, 215301) to compute the time-delay distribution in the scattering of ultra short radio frequency pulses on complex networks of transmission lines which are modeled by metric (quantum) graphs. We consider wave packets which are centered at high wave number and comprise many energy levels. In the limit of pulses of very short duration we compute upper and lower bounds to the actual time-delay distribution of the radiation emerging from the network using a simplified problem where time is replaced by the discrete count of vertex-scattering events. The classical limit of the time-delay distribution is also discussed and we show that for finite networks it decays exponentially, with a decay constant which depends on the graph connectivity and the distribution of its edge lengths. We illustrate and apply our theory to a simple model graph where an algebraic decay of the quantum time-delay distribution is established.
An optical buffer having a large delay-bandwidth-product -- a critical component for future all-optical communications networks -- remains elusive. Central to its realization is a controllable inline optical delay line, previously accomplished via engineered dispersion in optical materials or photonic structures constrained by a low delay-bandwidth product. Here we show that space-time wave packets whose group velocity in free space is continuously tunable provide a versatile platform for constructing inline optical delay lines. By spatio-temporal spectral-phase-modulation, wave packets in the same or in different spectral windows that initially overlap in space and time subsequently separate by multiple pulse widths upon free propagation by virtue of their different group velocities. Delay-bandwidth products of ~100 for pulses of width ~1 ps are observed, with no fundamental limit on the system bandwidth.
We construct concrete examples of time operators for both continuous and discrete-time homogeneous quantum walks, and we determine their deficiency indices and spectra. For a discrete-time quantum walk, the time operator can be self-adjoint if the time evolution operator has a non-zero winding number. In this case, its spectrum becomes a discrete set of real numbers.
We give an estimate of the quantum variance for $d$-regular graphs quantised with boundary scattering matrices that prohibit back-scattering. For families of graphs that are expanders, with few short cycles, our estimate leads to quantum ergodicity for these families of graphs. Our proof is based on a uniform control of an associated random walk on the bonds of the graph. We show that recent constructions of Ramanujan graphs, and asymptotically almost surely, random $d$-regular graphs, satisfy the necessary conditions to conclude that quantum ergodicity holds.
There exist a large literature on the application of $q$-statistics to the out-of-equilibrium non-ergodic systems in which some degree of strong correlations exists. Here we study the distribution of first return times to zero, $P_R(0,t)$, of a random walk on the set of integers ${0,1,2,...,L}$ with a position dependent transition probability given by $|n/L|^a$. We find that for all values of $ain[0,2]$ $P_R(0,t)$ can be fitted by $q$-exponentials, but only for $a=1$ is $P_R(0,t)$ given exactly by a $q$-exponential in the limit $Lrightarrowinfty$. This is a remarkable result since the exact analytical solution of the corresponding continuum model represents $P_R(0,t)$ as a sum of Bessel functions with a smooth dependence on $a$ from which we are unable to identify $a=1$ as of special significance. However, from the high precision numerical iteration of the discrete Master Equation, we do verify that only for $a=1$ is $P_R(0,t)$ exactly a $q$-exponential and that a tiny departure from this parameter value makes the distribution deviate from $q$-exponential. Further research is certainly required to identify the reason for this result and also the applicability of $q$-statistics and its domain.
We describe a new class of scattering matrices for quantum graphs in which back-scattering is prohibited. We discuss some properties of quantum graphs with these scattering matrices and explain the advantages and interest in their study. We also provide two methods to build the vertex scattering matrices needed for their construction.