Related papers: Quantum scattering theory on graphs with tails
We develop a formalism for the scattering of a particle on the $q$-deformed Euclidean space. We write down $q$-versions of the Lippmann-Schwinger equation. Their iterative solutions for a weak scattering potential lead us to $q$-versions of…
There are presently two models for quantum walks on graphs. The "coined" walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the…
Quantum trajectory theory, developed largely in the quantum optics community to describe open quantum systems subjected to continuous monitoring, has applications in many areas of quantum physics. In this paper I present a simple model,…
We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…
In geometric analysis, an index theorem relates the difference of the numbers of solutions of two differential equations to the topological structure of the manifold or bundle concerned, sometimes using the heat kernels of two higher-order…
Quantum scattering is studied in a system consisting of randomly distributed point scatterers in the strip. The model is continuous yet exactly solvable. Varying the number of scatterers (the sample length) we investigate a transition…
We propose to analyse the statistical properties of a sequence of vectors using the spectrum of the associated Gram matrix. Such sequences arise e.g. by the repeated action of a deterministic kicked quantum dynamics on an initial condition…
Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information…
A new model of quantum random walks is introduced, on lattices as well as on finite graphs. These quantum random walks take into account the behavior of open quantum systems. They are the exact quantum analogues of classical Markov chains.…
In this paper, we work on a quantum walk whose system is manipulated by a five-diagonal unitary matrix, and present long-time limit distributions. The quantum walk launches off a location and delocalizes in distribution as its system is…
We introduce and study the Separation Problem for infinite graphs, which involves determining whether a connected graph splits into at least two infinite connected components after the removal of a given finite set of edges. We prove that…
We systematise and develop a graphical approach to the investigations of quantum integrable vertex statistical models and the corresponding quantum spin chains. The graphical forms of the unitarity and various crossing relations are…
A detailed discussion of semiclassical trace formulae is presented and it is demonstrated how a regularized trace formula can be derived while dealing only with finite and convergent expressions. Furthermore, several applications of trace…
We provide a new method to construct the S-matrix in quantum field theory. This method implements crossing symmetry manifestly by erasing the a priori distinction between in- and out-states. It allows the description of processes where the…
We explore the possibility of using quantum walks on graphs to find structural anomalies, such as extra edges or loops, on a graph. We focus our attention on star graphs, whose edges are like spokes coming out of a central hub. If there are…
We construct an effective Quantum Field Theory for the wrapping effects in 1+1 dimensional models of factorised scattering. The recently developed graph-theoretical approach to TBA gives the perturbative desctiption of this QFT. For the…
The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…
We explore the tunneling behavior of a quantum particle on a finite graph, in the presence of an asymptotically large potential. Surprisingly the behavior is governed by the local symmetry of the graph around the wells.
Quantum graphs have recently emerged as models of nonlinear optical, quantum confined systems with exquisite topological sensitivity and the potential for predicting structures with an intrinsic, off-resonance response approaching the…
A quantum walk places a traverser into a superposition of both graph location and traversal "spin." The walk is defined by an initial condition, an evolution determined by a unitary coin/shift-operator, and a measurement based on the…