Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userLevinsons theorem for graphs
148
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We prove an analog of Levinsons theorem for scattering on a weighted (m+1)-vertex graph with a semi-infinite path attached to one of its vertices. In particular, we show that the number of bound states in such a scattering problem is equal to m minus half the winding number of the phase of the reflection coefficient (where each so-called half-bound state is counted as half a bound state).
rate research
Read More
The Birkhoffs theorem states that any doubly stochastic matrix lies inside a convex polytope with the permutation matrices at the corners. It can be proven that a similar theorem holds for unitary matrices with equal line sums for prime dimensions.
It was shown recently that Birkhoffs theorem for doubly stochastic matrices can be extended to unitary matrices with equal line sums whenever the dimension of the matrices is prime. We prove a generalization of the Birkhoff theorem for unitary matrices with equal line sums for arbitrary dimension.
We derive an adiabatic theory for a stochastic differential equation, $ varepsilon, mathrm{d} X(s) = L_1(s) X(s), mathrm{d} s + sqrt{varepsilon} L_2(s) X(s) , mathrm{d} B_s, $ under a condition that instantaneous stationary states of $L_1(s)$ are also stationary states of $L_2(s)$. We use our results to derive the full statistics of tunneling for a driven stochastic Schr{o}dinger equation describing a dephasing process.
The unitary Birkhoff theorem states that any unitary matrix with all row sums and all column sums equal unity can be decomposed as a weighted sum of permutation matrices, such that both the sum of the weights and the sum of the squared moduli of the weights are equal to unity. If the dimension~$n$ of the unitary matrix equals a power of a prime $p$, i.e. if $n=p^w$, then the Birkhoff decomposition does not need all $n!$ possible permutation matrices, as the epicirculant permutation matrices suffice. This group of permutation matrices is isomorphic to the general affine group GA($w,p$) of order only $p^w(p^w-1)(p^w-p)...(p^w-p^{w-1}) ll left( p^w right)!$.
Quantum control could be implemented by varying the system Hamiltonian. According to adiabatic theorem, a slowly changing Hamiltonian can approximately keep the system at the ground state during the evolution if the initial state is a ground state. In this paper we consider this process as an interpolation between the initial and final Hamiltonians. We use the mean value of a single operator to measure the distance between the final state and the ideal ground state. This measure could be taken as the error of adiabatic approximation. We prove under certain conditions, this error can be precisely estimated for an arbitrarily given interpolating function. This error estimation could be used as guideline to induce adiabatic evolution. According to our calculation, the adiabatic approximation error is not proportional to the average speed of the variation of the system Hamiltonian and the inverse of the energy gaps in many cases. In particular, we apply this analysis to an example on which the applicability of the adiabatic theorem is questionable.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
