Related papers: Two-particle quantum walks applied to the graph is…
We study the effect of inter-component interactions on the dynamical properties of quantum walkers. We consider the simplest situation of two indistinguishable non-interacting walkers on a tilted optical lattice interacting with a walker…
We study scattering quantum walks on highly symmetric graphs and use the walks to solve search problems on these graphs. The particle making the walk resides on the edges of the graph, and at each time step scatters at the vertices. All of…
We study the problem of particle indistinguishability for the three cases known in nature: identical classical particles, identical bosons and identical fermions. By exploiting the fact that different types of particles are associated with…
In this paper we propose quantum graphs as one-dimensional models with a complex topology to study Bose-Einstein condensation and phase transitions in a rigorous way. We fist investigate non-interacting many-particle systems on quantum…
Strongly interacting one-dimensional quantum systems often behave in a manner that is distinctly different from their higher-dimensional counterparts. When a particle attempts to move in a one-dimensional environment it will unavoidably…
We consider a slight modification of the frog model. For a given graph, each vertex has $\mathrm{Poisson}(\lambda)$ particles (or frogs). At time zero, only the particles at the origin are active, and all the other particles are sleeping.…
We consider two particles performing continuous-time nearest neighbor random walk on $\mathbb Z$ and interacting with each other when they are at neighboring positions. Typical examples are two particles in the partial exclusion process or…
We study the many-body physics of different quantum systems using a hierarchy of correlations, which corresponds to a generalization of the $1/\mathcal{Z}$ hierarchy. The decoupling scheme obtained from this hierarchy is adapted to…
It is commonly believed that there are only two types of particle exchange statistics in quantum mechanics, fermions and bosons, with the exception of anyons in two dimension. In principle, a second exception known as parastatistics, which…
We analyze a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum-walk features such as localization that starkly distinguishes classical from quantum…
We present and study a two-particle quantum walk on the line in which the two particles interact via a long-range Coulombian-like interaction. We obtain the spectrum of the system as well as study the type of molecules that form, attending…
A quantum walk is a time-homogeneous quantum-mechanical process on a graph defined by analogy to classical random walk. The quantum walker is a particle that moves from a given vertex to adjacent vertices in quantum superposition. Here we…
We study diffraction and interference of indistinguishable particles. We consider some examples where the wavefunctions and detection probabilities can be evaluated in an analytical way. The diffraction pattern of a two-particle system…
One of the main challenges for ab initio nuclear many-body theory is the growth of computational and storage costs as calculations are extended to heavy, exotic, and structurally complex nuclei. Here, we investigate the factorization of…
It is well known that the spectrum and the Smith normal form of a matrix can be computed in polynomial time. Thus, it is interesting to explore how good are these parameters for distinguishing graphs. This is relevant since it is related to…
We present a generalized definition of discrete-time quantum walks convenient for capturing a rather broad spectrum of walker's behavior on arbitrary graphs. It includes and covers both: the geometry of possible walker's positions with…
The subject of this paper is a kind of dynamical systems called quantum walks. We study one-dimensional homogeneous analytic quantum walks U. We explain how to identify the space of all the uniform intertwining operators between these…
The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several…
Let $G$ be a strongly regular graph of prime order $p$ with connection degree $k \geq 6$. We prove that the \emph{quantum walk characteristic polynomial} $\chi_q(G,\lambda) \coloneqq \det(\lambda I - U_G)$, where $U_G$ is the coined quantum…
The frog model is an interacting particle system on a graph. Active particles perform independent simple random walks, while sleeping particles remain inert until visited by an active particle. Some number of sleeping particles are placed…