Related papers: Quantum Walk and Dressed Photon
Open Quantum Walks (OQWs) are exclusively driven by dissipation and are formulated as completely positive trace preserving (CPTP) maps on underlying graphs. The microscopic derivation of discrete and continuous in time OQWs is presented. It…
We study how quantum walks can be used to find structural anomalies in graphs via several examples. Two of our examples are based on star graphs, graphs with a single central vertex to which the other vertices, which we call external…
We analyze the equivalence between discrete-time coined quantum walks and Szegedy's quantum walks. We characterize a class of flip-flop coined models with generalized Grover coin on a graph $\Gamma$ that can be directly converted into…
Quantum walk represents one of the most promising resources for the simulation of physical quantum systems, and has also emerged as an alternative to the standard circuit model for quantum computing. Up to now the experimental…
Signaled by non-analyticities in the time evolution of physical observables, dynamic quantum phase transitions (DQPTs) emerge in quench dynamics of topological systems and possess an interesting geometric origin captured by dynamic…
Quantum random walks have received much interest due to their non-intuitive dynamics, which may hold the key to a new generation of quantum algorithms. What remains a major challenge is a physical realization that is experimentally viable…
We present a review of photonic implementations of discrete-time quantum walks (DTQW) in the spatial and temporal domains, based on spatial- and time-multiplexing techniques, respectively. Additionally, we propose a detailed novel scheme…
Quantum walks constitute a rich area of quantum information science, where multipartite entanglement plays a central role in the dynamics and scalability of quantum advantage over classical simulators. In this work, we study the…
The staggered quantum walk model on a graph is defined by an evolution operator that is the product of local operators related to two or more independent graph tessellations. A graph tessellation is a partition of the set of nodes that…
We analytically investigate the recently proposed and implemented discrete-time quantum walk based on kicked ultra-cold atoms. We show how the internal level structure of the kicked atoms leads to the emergence of a relative light-shift…
Quantum walks provide simple models of various fundamental processes. It is pivotal to know when the dynamics underlying a walk lead to quantum advantages just by examining its statistics. A walk with many indistinguishable particles and…
A non-perturbative and exactly solvable quantum field theoretical model for a "dressed Dirac field" is presented, that exhibits all the kinematical features of QED: an appropriate delocalization of the charged field as a prerequisite for…
We model a quantum walk of identical particles that can change their exchange statistics by hopping across a domain wall in a 1D lattice. Such a "statistical boundary" is transparent to single particles and affects the dynamics only by…
Quasi-random walks show similar features as standard random walks, but with much less randomness. We utilize this established model from discrete mathematics and show how agents carrying out quasi-random walks can be used for image…
A time-dependent theory for the interactions between spatially separated lossy cavities in a homogeneous background medium using quantized quasinormal modes (QNMs) is presented. The cavities interact via a bath of traveling photons,…
A thermodynamic theory is developed to describe the behavior of the entanglement between the coin and position degrees of freedom of the quantum walk on the line. This theory shows that, in spite of the unitary evolution, a steady state is…
The quantum walk (QW) is the term given to a family of algorithms governing the evolution of a discrete quantum system and as such has a founding role in the study of quantum computation. We contribute to the investigation of QW phenomena…
A discrete-time quantum walk is the quantum analogue of a Markov chain on a graph. Zhan [J. Algebraic Combin. 53(4):1187-1213, 2020] proposes a model of discrete-time quantum walk whose transition matrix is given by two reflections, using…
This tutorial article showcases the many varieties and uses of quantum walks. Discrete time quantum walks are introduced as counterparts of classical random walks. The emphasis is on the connections and differences between the two types of…
In this paper we focus our attention on a particle that follows a unidirectional quantum walk, an alternative version of the nowadays widespread discrete-time quantum walk on a line. Here the walker at each time step can either remain in…