相关论文: Quantum Walk on the Line

This paper presents a novel methodology that transforms discrete-time quantum walks into a graph embedding technique, offering a fresh perspective on graph representation methods.Through mathematical manipulations, the approach of this…

The classicalization of a decoherent discrete-time quantum walk on a line or an n-cycle can be demonstrated in various ways that do not necessarily provide a geometry-independent description. For example, the position probability…

Quantum walks are at the heart of modern quantum technologies. They allow to deal with quantum transport phenomena and are an advanced tool for constructing novel quantum algorithms. Quantum walks on graphs are fundamentally different from…

Quantum walks subject to decoherence generically suffer the loss of their genuine quantum feature, a quadratically faster spreading compared to classical random walks. This intuitive statement has been verified analytically for certain…

A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain…

This work examines the time complexity of quantum search algorithms on combinatorial $t$-designs with multiple marked elements using the continuous-time quantum walk. Through a detailed exploration of $t$-designs and their incidence…

The discrete time quantum walk defined as a quantum-mechanical analogue of the discrete time random walk have recently been attracted from various and interdisciplinary fields. In this review, the weak limit theorem, that is, the asymptotic…

Discrete-time quantum walks, quantum generalizations of classical random walks, provide a framework for quantum information processing, quantum algorithms and quantum simulation of condensed matter systems. The key property of quantum…

The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of the graph. It is shown how to map between…

We construct a new type of quantum walks on simplicial complexes as a natural extension of the well-known Szegedy walk on graphs. One can numerically observe that our proposing quantum walks possess linear spreading and localization as in…

We study the asymptotic position distribution of general quantum walks on a lattice, including walks with a random coin, which is chosen from step to step by a general Markov chain. In the unitary (i.e., non-random) case, we allow any…

We study the entanglement dynamics of discrete time quantum walks acting on bounded finite sized graphs. We demonstrate that, depending on system parameters, the dynamics may be monotonic, oscillatory but highly regular, or quasi-periodic.…

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 clarify that coined quantum walk is determined by only the choice of local quantum coins. To do so, we characterize coined quantum walks on graph by disjoint Euler circles with respect to symmetric arcs. In this paper, we introduce a new…

Given random walk on a graph, the corresponding discrete-time quantum walk can be constructed using the method proposed by Szegedy. On the other hand, given a partition of the set of states of a Markov chain, one can study the corresponding…

We analyze a set of discrete-time quantum walks for which the displacements on a chain follow binary aperiodic jumps according to three paradigmatic sequences: Fibonacci, Thue-Morse and Rudin-Shapiro. We use a generalized Hadamard coin…

The connection between coined and continuous-time quantum walk models has been addressed in a number of papers. In most of those studies, the continuous-time model is derived from coined quantum walks by employing dimensional reduction and…

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…

We study the motion of M particles performing a quantum walk on the line. Under various conditions on the initial coin states for quantum walkers controlled by the Hadamard operator, we give theoretical criterion to observe the quantum…

We address continuous-time quantum walks on graphs in the presence of time- and space-dependent noise. Noise is modeled as generalized dynamical percolation, i.e. classical time-dependent fluctuations affecting the tunneling amplitudes of…