Related papers: Two-particle quantum walks applied to the graph is…
We consider the Grover walk on a finite graph composed of two arbitrary simple graphs connected by one edge, referred to as a bridge. The parameter $\epsilon>0$ assigned at the bridge represents the strength of connectivity: if…
Using a quantum processor to embed and process classical data enables the generation of correlations between variables that are inefficient to represent through classical computation. A fundamental question is whether these correlations…
When two particles interact primarily through gravity and follow the laws of quantum mechanics, the generation of entanglement is considered a hallmark of the quantum nature of the gravitational interaction. However, we demonstrate that…
We report on the state of the art of quantum walk experiments with neutral atoms in state-dependent optical lattices. We demonstrate a novel state-dependent transport technique enabling the control of two spin-selective sublattices in a…
Nearest neighbour bosons possessing only onsite interactions do not form onsite bound pairs in their quantum walk due to fermionization. We obtain signatures of non-trivial onsite pairing in the quantum walk of strongly interacting two…
We present a comprehensive quantum many body theory for kq deformed particles, offering a novel framework that relates particle statistics directly to effective interaction strength. Deformed by the parameters k and q, these particles…
We compare discrete-time quantum walks on graphs to their natural classical equivalents, which we argue are lifted Markov chains, that is, classical Markov chains with added memory. We show that these can simulate quantum walks, allowing us…
We study a system of random walks, known as the frog model, starting from a profile of independent Poisson($\lambda$) particles per site, with one additional active particle planted at some vertex $\mathbf{o}$ of a finite connected simple…
We analyze the dynamics of multiparticle discrete-time quantum walk on the two-dimensional lattice, with an interaction inspired on a classical model for gas collision, called HPP model. In this classical model, the direction of motion…
We study the dynamics of inertial active particles in a one-dimensional chain with harmonic nearest-neighbor interactions, highlighting the interplay of persistence, interaction, and inertial timescales. Using a Green's function approach,…
Digital quantum computers offer a promising route for studying complex many-body systems that are otherwise inaccessible by their classical counterparts. Capabilities including mid-circuit measurements and feedback allow for simulating the…
We initiate a systematic study of quantum properties of finite graphs, namely, quantum asymmetry, quantum symmetry, and quantum isomorphism. We define the Schmidt alternative for a class of graphs, which reveals to be a useful tool for…
The partition function for a system of non-interacting $N-$particles can be found by summing over all the states of the system. The classical partition function for an ideal gas differs from Bosonic or Fermionic partition function in the…
All particles of the same type are indistinguishable, according to a fundamental quantum principle. This entails a description of many-particle states using symmetrised or anti-symmetrised wave functions, which turn out to be formally…
We investigate the dynamics of two identical spinless fermions on a one-dimensional lattice with open boundary conditions (OBC), subject to quasiperiodic long-range interactions. Using numerical exact diagonalization (ED), we study this…
Two objects can be distinguished if they have different measurable properties. Thus, distinguishability depends on the Physics of the objects. In considering graphs, we revisit the Ising model as a framework to define physically meaningful…
A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton. For a long time, these models have interested the community for their nice properties such as locality or translation invariance. This…
We present a new tensor network algorithm for calculating the partition function of interacting quantum field theories in 2 dimensions. It is based on the Tensor Renormalization Group (TRG) protocol, adapted to operate entirely at the level…
We prove that for every pair of quantum isomorphic graphs, their block trees and their block graphs are isomorphic, and that such an isomorphism can be chosen so that the corresponding blocks are quantum isomorphic -- in particular,…
I introduce a new type of continuous-time quantum walk on graphs called the quantum snake walk, the basis states of which are fixed-length paths (snakes) in the underlying graph. First I analyze the quantum snake walk on the line, and I…