相关论文: Quantum walks as a probe of structural anomalies i…

Network centrality has important implications well beyond its role in physical and information transport analysis; as such, various quantum walk-based algorithms have been proposed for measuring network vertex centrality. In this work, we…

In the present paper, we study the continuous-time quantum walk on quotient graphs. On such graphs, there is a straightforward reduction of problem to a subspace that can be considerably smaller than the original one. Along the lines of…

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 introduce a continuous-time quantum walk on an ultrametric space corresponding to the set of p-adic integers and compute its time-averaged probability distribution. It is shown that localization occurs for any location of the ultrametric…

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 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…

Networks constitute efficient tools for assessing universal features of complex systems. In physical contexts, classical as well as quantum, networks are used to describe a wide range of phenomena, such as phase transitions, intricate…

We show that it is possible to use a quantum walk to find a path from one marked vertex to another. In the specific case of $M$ stars connected in a chain, one can find the path from the first star to the last one in $O(M\sqrt{N})$ steps,…

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…

Computational advantages gained by quantum algorithms rely largely on the coherence of quantum devices and are generally compromised by decoherence. As an exception, we present a quantum algorithm for graph isomorphism testing whose…

Quantum walks have been very successful in the development of search algorithms in quantum information, in particular in the development of spatial search algorithms. However, the construction of continuous-time quantum search algorithms in…

In this paper we isolate the combinatorial property responsible (at least in part) for the computational speedups recently observed in some quantum walk algorithms. We find that continuous-time quantum walks can exploit the covering space…

Rydberg atoms provide a highly promising platform for quantum computation, leveraging their strong tunable interactions to encode and manipulate information in the electronic states of individual atoms. Key advantages of Rydberg atoms…

In recent years, new neural network architectures designed to operate on graph-structured data have pushed the state-of-the-art in the field. A large set of these architectures utilize a form of classical random walks to diffuse…

Quantum random walks represent a powerful tool for the implementation of various quantum algorithms. We consider a convolution problem for the graphs which provide quantum and classical random walks. We suggest a new method for lattices and…

Quantum walks are accepted as a generic model for quantum transport. The character of the transport crucially depends on the properties of the walk like its geometry and the driving coin. We demonstrate that increasing transport distance…

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…

We address quantum spatial search on graphs and its implementation by continuous-time quantum walks in the presence of dynamical noise. In particular, we focus on search on the complete graph and on the star graph of order $N$, proving that…

Quantum walks underlie an important class of quantum computing algorithms, and represent promising approaches in various simulations and practical applications. Here we design stroboscopically monitored quantum walks and their subsequent…

Quantum walk is a useful model to simulate complex quantum systems and to build quantum algorithms; in particular, to develop spatial search algorithms on graphs, which aim to find a marked vertex as quickly as possible. Quantum walks are…