Related papers: Quantum walk on distinguishable non-interacting ma…
Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal…
Quantum random walks are shown to have non-intuitive dynamics which makes them an attractive area of study for devising quantum algorithms for long-standing open problems as well as those arising in the field of quantum computing. In the…
Discrete quantum walks are dynamical protocols for controlling a single quantum particle. Despite of its simplicity, quantum walks display rich topological phenomena and provide one of the simplest systems to study and understand…
We introduce a model of a quantum walk on a graph in which a particle jumps between neighboring nodes and interacts with independent spins sitting on the edges. Entanglement propagates with the walker. We apply this model to the case of a…
Coherent dynamics of interacting quantum particles plays a central role in the study of strongly correlated quantum matter and the pursuit of quantum information processors. Here, we present the state-space of interacting Rydberg atoms as a…
The quantum walk is the quantum analogue of the well-known random walk, which forms the basis for models and applications in many realms of science. Its properties are markedly different from the classical counterpart and might lead to…
The dynamics of a discrete-time quantum walk (DTQW) can be realized within a purely classical interacting particle system composed of some boxes and a large but finite number of balls, and can, in principle, be implemented in a tabletop…
We study the influence of particle interaction on a quantum walk on a bipartite one-dimensional lattice with decay from every second site. The corresponding non-interacting (linear) system has been shown to have a topological transition…
Recently, quantized versions of random walks have been explored as effective elements for quantum algorithms. In the simplest case of one dimension, the theory has remained divided into the discrete-time quantum walk and the continuous-time…
Photonics provide an efficient way to implement quantum walks, the quantum analogue of classical random walk that demonstrates rich physics with potential applications. However, most photonic quantum walks do not involve photon…
We introduce and analyze a one-dimensional quantum walk with two time-independent rotations on the coin. We study the influence on the property of quantum walk due to the second rotation on the coin. Based on the asymptotic solution in the…
Quantum walks are versatile simulators of topological phases and phase transitions as observed in condensed matter physics. Here, we utilize a step dependent coin in quantum walks and investigate what topological phases we can simulate with…
Quantum walks in atomic systems, owing to their continuous nature, are especially well-suited for the simulation of many-body physics and can potentially offer an exponential speedup in solving certain black box problems. Photonics offers…
Quantum versions of random walks have diverse applications that are motivating experimental implementations as well as theoretical studies. However, the main impetus behind this interest is their use in quantum algorithms, which have always…
We investigate quantum walks in multiple dimensions with different quantum coins. We augment the model by assuming that at each step the amplitudes of the coin state are multiplied by random phases. This model enables us to study in detail…
We investigate quantum dynamics of a quantum walker on a finite bipartite non-Hermitian lattice, in which the particle can leak out with certain rate whenever it visits one of the two sublattices. Quantum walker initially located on one of…
Quantum walks of correlated particles offer the possibility to study large-scale quantum interference, simulate biological, chemical and physical systems, and a route to universal quantum computation. Here we demonstrate quantum walks of…
Quantum walks are referred to as quantum analogs to random walks in mathematics. They have been studied as quantum algorithms in quantum information for quantum computers. There are two types of quantum walks. One is the discrete-time…
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a…
Quantum walks function as essential means to implement quantum simulators, allowing one to study complex and often directly inaccessible quantum processes in controllable systems. In this contribution, the notion of a driven Gaussian…