Related papers: Spatial entanglement using a quantum walk on a man…
Entanglement is a fundamental resource for quantum information processing, occurring naturally in many-body systems at low temperatures. The presence of entanglement and, in particular, its scaling with the size of system partitions…
The "quantum walk" has emerged recently as a paradigmatic process for the dynamic simulation of complex quantum systems, entanglement production and quantum computation. Hitherto, photonic implementations of quantum walks have mainly been…
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 investigate the entanglement for a model of a particle moving in the lattice (many-body system). The interaction between the particle and the lattice is modelled using Hooke's law. The Feynman path integral approach is applied to compute…
Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing…
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…
We observe that changing a phase at a single point in a discrete quantum walk results in a rather surprising localization effect. For certain values of this phase change the possibility of localization strongly depends on the internal…
The coin-position entanglement generated by the evolution operator of a discrete--time quantum walk converges, in the long time limit, to a well defined value which depends on the initial state. We also discuss the asymptotic bi-partite…
This paper demonstrates and proves that the coordination of actions in a distributed swarm can be enhanced by using quantum entanglement. In particular, we focus on - Global and local simultaneous random walks, using entangled qubits that…
Entanglement lies at the heart of quantum mechanics and in recent years has been identified as an essential resource for quantum information processing and computation. Creating highly entangled multi-particle states is therefore one of the…
A review of discrete quantum walk with two particle is given. The use of different states encountered in identical particle, and the idea of entanglement and superposition is explored to explored the interesting dynamics of two particle…
Coined quantum walks may be interpreted as the motion in position space of a quantum particle with a spin degree of freedom; the dynamics are determined by iterating a unitary transformation which is the product of a spin transformation and…
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…
This work investigates a discrete-time quantum walk on a one-dimensional lattice driven by three entangled coins, each initialized via a Hadamard operator. The walker moves only when all three coins yield identical outcomes (HHH or TTT),…
Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walker's evolution gives a high degree of flexibility for…
Discrete-time quantum walks (QWs) represent robust and versatile platforms for the controlled engineering of single particle quantum dynamics, and have attracted special attention due to their algorithmic applications in quantum information…
The position density of a "particle" performing a continuous-time quantum walk on the integer lattice, viewed on length scales inversely proportional to the time t, converges (as t tends to infinity) to a probability distribution that…
Quantum walks can reconstruct quantum algorithms for quantum computation, where the precise controls of quantum state transfers between arbitrary distant sites are required. Here, we investigate quantum walks using a periodically…
Quantum walks have emerged as an interesting approach to quantum information processing, exhibiting many unique properties compared to the analogous classical random walk. Here we introduce a model for a discrete-time quantum walk with…
Quantum walks provide a framework for understanding and designing quantum algorithms that is both intuitive and universal. To leverage the computational power of these walks, it is important to be able to programmably modify the graph a…