相关论文: Controlled Alternate Quantum Walk based Block Hash…

A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton. For a long time, these models have interested the community for their nice properties such as locality or translation invariance. This…

We give a quantum algorithm for finding a marked element on the grid when there are multiple marked elements. Our algorithm uses quadratically fewer steps than a random walk on the grid, ignoring logarithmic factors. This is the first known…

I introduce a new type of continuous-time quantum walk on graphs called the quantum snake walk, the basis states of which are fixed-length paths (snakes) in the underlying graph. First I analyze the quantum snake walk on the line, and I…

We show that a quantum walk process can be used to construct and secure quantum memory. More precisely, we show that a localized quantum walk with temporal disorder can be engineered to store the information of a single, unknown qubit on a…

Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of…

Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links.…

Multi-dimensional quantum walks can exhibit highly non-trivial topological structure, providing a powerful tool for simulating quantum information and transport systems. We present a flexible implementation of a 2D optical quantum walk on a…

Quantum entanglement has become an essential resource in quantum information processing. Existing works employ entangled quantum states to perform various tasks, while little attention is paid to the control of the resource. In this work,…

Continuous-time quantum walks (CTQWs) on static graphs provide efficient methods for search and sampling as well as a model for universal quantum computation. We consider an extension of CTQWs to the case of dynamic graphs, in which an…

We present a scheme for multi-bit quantum random number generation using a single qubit discrete-time quantum walk in one-dimensional space. Irrespective of the initial state of the qubit, quantum interference and entanglement of particle…

Quantum walks are a promising framework that can be used to both understand and implement quantum information processing tasks. The quantum stochastic walk is a recently developed framework that combines the concept of a 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…

Quantum walks are well-known for their ballistic dispersion, traveling $\Theta(t)$ away in $t$ steps, which is quadratically faster than a classical random walk's diffusive spreading. In physical implementations of the walk, however, the…

We present the first robust implementation of a coined quantum walk over five steps using only passive optical elements. By employing a fiber network loop we keep the amount of required resources constant as the walker's position Hilbert…

Quantum walks have by now been realized in a large variety of different physical settings. In some of these, particularly with trapped ions, the walk is implemented in phase space, where the corresponding position states are not orthogonal.…

Quantum walk serves as a versatile tool for universal quantum computing and algorithmic research. However, the implementation of discrete-time quantum walks (DTQWs) with superconducting circuits is still constrained by some limitations such…

Continuous-time quantum walks provide a natural framework to tackle the fundamental problem of finding a node among a set of marked nodes in a graph, known as spatial search. Whether spatial search by continuous-time quantum walk provides a…

The development of quantum walks in the context of quantum computation, as generalisations of random walk techniques, led rapidly to several new quantum algorithms. These all follow unitary quantum evolution, apart from the final…

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…

We identify a key difference between quantum search by discrete- and continuous-time quantum walks: a discrete-time walk typically performs one walk step per oracle query, whereas a continuous-time walk can effectively perform multiple walk…